{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"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":"StylesheetParser._expression (cyclomatic 84): StylesheetParser._expression has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 10 of the 45 methods over the threshold \u2014 including the worst \u2014 and 140 of the 415 points over it (34%), 3.3\u00D7 the next-largest file (lib/src/embedded/protofier.dart at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e554bdcc02734fe5f64ee3dc2a62dbe8a13e1589b452a25e70864227ff5cd70"}},{"ruleId":"D1","level":"warning","message":{"text":"Protofier._deprotofy (cyclomatic 57): Protofier._deprotofy 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":"lib/src/embedded/protofier.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd66be09a920d6838e90824a29217c2d73786b0a7336ccf73a9762e5613ab4ef"}},{"ruleId":"D1","level":"warning","message":{"text":"StylesheetParser._interpolatedDeclarationValue (cyclomatic 39): StylesheetParser._interpolatedDeclarationValue 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 10 of the 45 methods over the threshold \u2014 including the worst \u2014 and 140 of the 415 points over it (34%), 3.3\u00D7 the next-largest file (lib/src/embedded/protofier.dart at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3770}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1a8532ef0d4db547990467211eae7248c5a32170287c73d4cc74920a3d1d35"}},{"ruleId":"D1","level":"warning","message":{"text":"index.normalize (cyclomatic 39): index.normalize has cyclomatic complexity 39 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/index.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82cbfda0f398a925f6d9231a0abe3c11c077ea4c327894f0e571a3c8440f08c"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecutableOptions._ensureSources (cyclomatic 34): ExecutableOptions._ensureSources has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/executable/options.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7314a7be206c6c5f0a8e684de667e42d14ad4ef3f077a83eb709ac4c5f534e46"}},{"ruleId":"D1","level":"warning","message":{"text":"SassString.isSpecialNumber (cyclomatic 31): SassString.isSpecialNumber has cyclomatic complexity 31 (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":"lib/src/value/string.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b718104b0d75f3072620d14614db322c8bd15a4b0bb4bbc502fe02e8ba70a79"}},{"ruleId":"D1","level":"warning","message":{"text":"SrgbColorSpace.convert (cyclomatic 30): SrgbColorSpace.convert has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color/space/srgb.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e165f5e862660830e2c1177cd45f8fde78d398d507c7056c9c02d2c90d1140"}},{"ruleId":"D1","level":"warning","message":{"text":"_EvaluateVisitor._visitCalculation (cyclomatic 30): _EvaluateVisitor._visitCalculation has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":3242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b225ca7e0663e1a90ccc8c97d7f74c38d47b15c6b1cb7ff2badc50b83c86a8c8"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionStore._extendPseudo (cyclomatic 26): ExtensionStore._extendPseudo has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/extend/extension_store.dart"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54b5f0def2d7aa485e8fb6f2307d3475509b80e39b0452df3a514abedcf6189"}},{"ruleId":"D1","level":"warning","message":{"text":"StylesheetParser._declarationOrBuffer (cyclomatic 26): StylesheetParser._declarationOrBuffer 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 10 of the 45 methods over the threshold \u2014 including the worst \u2014 and 140 of the 415 points over it (34%), 3.3\u00D7 the next-largest file (lib/src/embedded/protofier.dart at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e429cbbce6a3598982c39bfa9cc41deb8a99b3530ba4dde2e2e442e32cc2bb"}},{"ruleId":"D1","level":"warning","message":{"text":"StylesheetParser.almostAnyValue (cyclomatic 26): StylesheetParser.almostAnyValue has cyclomatic complexity 26 (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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 10 of the 45 methods over the threshold \u2014 including the worst \u2014 and 140 of the 415 points over it (34%), 3.3\u00D7 the next-largest file (lib/src/embedded/protofier.dart at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3660}}}],"partialFingerprints":{"codehealthFindingId/v1":"255dccc478c513bd2813686830a30472c81648e3c2f4edd3e8a9c4c067c9b004"}},{"ruleId":"D1","level":"warning","message":{"text":"CssMediaQuery.merge (cyclomatic 25): CssMediaQuery.merge has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/ast/css/media_query.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd2a1bcbaf8c08c43b09515a239c88902300fd9011385534a206164a9200005"}},{"ruleId":"D1","level":"warning","message":{"text":"SassCalculation._roundWithStep (cyclomatic 25): SassCalculation._roundWithStep 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":"lib/src/value/calculation.dart"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacc2ef90ba5b18daa962c5793c5df9eca74b5b24044a6a53bedcd1ef29801ae"}},{"ruleId":"D1","level":"warning","message":{"text":"StylesheetParser.identifierLike (cyclomatic 24): StylesheetParser.identifierLike has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 10 of the 45 methods over the threshold \u2014 including the worst \u2014 and 140 of the 415 points over it (34%), 3.3\u00D7 the next-largest file (lib/src/embedded/protofier.dart at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3015}}}],"partialFingerprints":{"codehealthFindingId/v1":"180aea0220526b7a03420d00b059633adf46f1832fd98d6f78e6015b401d29f1"}},{"ruleId":"D1","level":"warning","message":{"text":"_SerializeVisitor._writeRounded (cyclomatic 24): _SerializeVisitor._writeRounded has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfc7e49d5ef99b86ddb423878d29bf096a096b9c44b2a0f9769c4902a9694d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.declarationValue (cyclomatic 23): Parser.declarationValue 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":"lib/src/parse/parser.dart"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"14827168fcf6857862f122c0ca279d4abca5c632c287ead82ad919172bfb215c"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorSpace.convertLinear (cyclomatic 23): ColorSpace.convertLinear has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color/space.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f20905d9040605b70dbc79b4139eaaa02588c68914b9235f125d31f315bd5ef"}},{"ruleId":"D1","level":"warning","message":{"text":"SassNumber._coerceOrConvertValue (cyclomatic 23): SassNumber._coerceOrConvertValue 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":"lib/src/value/number.dart"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9f6f950b29c25d9dce1e9b2bea68949750267c3a625d27e6ed4dea49bc6845"}},{"ruleId":"D1","level":"warning","message":{"text":"_SerializeVisitor._writeCalculationValue (cyclomatic 23): _SerializeVisitor._writeCalculationValue 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":"lib/src/visitor/serialize.dart"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a6c677457809155cf448a877362e4bc7d489027d796695c5a36ced1f176b00"}},{"ruleId":"D1","level":"warning","message":{"text":"NodePackageImporter._nodePackageExportsResolve (cyclomatic 22): NodePackageImporter._nodePackageExportsResolve has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/importer/node_package.dart"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f38552a324307eaa63a9640893e8126cc9255afebacd1e3b1dc763a70a1017e"}},{"ruleId":"D1","level":"warning","message":{"text":"_EvaluateVisitor._visitCalculationExpression (cyclomatic 22): _EvaluateVisitor._visitCalculationExpression has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"850a76e5509cfde0e3c025a2a139a3bbb358d34dd77edb1d6f8c4477a9b9cd1b"}},{"ruleId":"D1","level":"warning","message":{"text":"AsyncImportCache.canonicalize (cyclomatic 21): AsyncImportCache.canonicalize 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":"lib/src/async_import_cache.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57c3abbe45a4e2985419864a25c39e0b0131e75e9e68f241ad9a117ee02352b"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionStore._extendCompound (cyclomatic 21): ExtensionStore._extendCompound 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":"lib/src/extend/extension_store.dart"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fc36228ce2a7cde4f4185088625eb095e77b26f5b5da5dd85db283c3f80a9c"}},{"ruleId":"D1","level":"warning","message":{"text":"SassParser._loudComment (cyclomatic 21): SassParser._loudComment has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/sass.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"78195f03ab44db9730b50044bc466792f7336c37f809c7000cc5c923293e8443"}},{"ruleId":"D1","level":"warning","message":{"text":"AsyncEnvironment.importForwards (cyclomatic 20): AsyncEnvironment.importForwards 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":"lib/src/async_environment.dart"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7ebd8db3d632abe4aceb76f69dea6634af10e95701a45bb247de5f49b7da79"}},{"ruleId":"D1","level":"warning","message":{"text":"NodePackageImporter.canonicalize (cyclomatic 20): NodePackageImporter.canonicalize has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/importer/node_package.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d19a37b3a772847210df8b07cbefda41102d0d509f78577d25e8a24f5109c1"}},{"ruleId":"D1","level":"warning","message":{"text":"_SerializeVisitor.visitColor (cyclomatic 20): _SerializeVisitor.visitColor 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":"lib/src/visitor/serialize.dart"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d7bbf69bbe3ddae61dbc0290bc7c61b6d2ed44274f5d04b4d56f354b4a31ba"}},{"ruleId":"D1","level":"warning","message":{"text":"CompilationDispatcher._compile (cyclomatic 19): CompilationDispatcher._compile 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":"lib/src/embedded/compilation_dispatcher.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af623e3eddd5f3af2a8f8ee2427d749a9ad042c878fa9c5d513b987d1902d5e"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectorParser._complexSelector (cyclomatic 19): SelectorParser._complexSelector 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":"lib/src/parse/selector.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cf9c73c6bcb2ac52f54199b692304888207d19f73b15cca16188db1606d5e2"}},{"ruleId":"D1","level":"warning","message":{"text":"StylesheetParser._argumentInvocation (cyclomatic 19): StylesheetParser._argumentInvocation 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: StylesheetParser.atRule (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 10 of the 45 methods over the threshold \u2014 including the worst \u2014 and 140 of the 415 points over it (34%), 3.3\u00D7 the next-largest file (lib/src/embedded/protofier.dart at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"202c92e27416b3e21eebb3b6ed6c23fec690d6be029c6752a7d459f55203e4d5"}},{"ruleId":"D1","level":"warning","message":{"text":"StylesheetParser.trySpecialFunction (cyclomatic 19): StylesheetParser.trySpecialFunction 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: StylesheetParser.atRule (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 10 of the 45 methods over the threshold \u2014 including the worst \u2014 and 140 of the 415 points over it (34%), 3.3\u00D7 the next-largest file (lib/src/embedded/protofier.dart at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3417}}}],"partialFingerprints":{"codehealthFindingId/v1":"1389250bcca8644837652def18cdb540e30edb5a2bdb6ad6c8c9eaa71fb56c1d"}},{"ruleId":"D1","level":"warning","message":{"text":"StylesheetParser._complexSelector (cyclomatic 19): StylesheetParser._complexSelector 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: StylesheetParser.atRule (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 10 of the 45 methods over the threshold \u2014 including the worst \u2014 and 140 of the 415 points over it (34%), 3.3\u00D7 the next-largest file (lib/src/embedded/protofier.dart at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":4155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4497d79afe66960c03159c0f79727968e82db98c5cc94a757c7645d973288d54"}},{"ruleId":"D1","level":"warning","message":{"text":"ListExpression.toString (cyclomatic 19): ListExpression.toString has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/list.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"a054d3d8da43830e363394657e0f8184f646e30effc1e44359d54e91d050c7a3"}},{"ruleId":"D1","level":"warning","message":{"text":"StylesheetParser._ifConditionExpression (cyclomatic 18): StylesheetParser._ifConditionExpression has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: StylesheetParser.atRule (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 10 of the 45 methods over the threshold \u2014 including the worst \u2014 and 140 of the 415 points over it (34%), 3.3\u00D7 the next-largest file (lib/src/embedded/protofier.dart at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10eea67d3fddf1ad5dffca758f9f02794507a0fe820cf3b3ab16b67f7fa48df"}},{"ruleId":"D1","level":"warning","message":{"text":"_EvaluateVisitor.visitStyleRule (cyclomatic 18): _EvaluateVisitor.visitStyleRule has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: _EvaluateVisitor.visitBinaryOperationExpression (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e83531ac79c83b7049cbb281fe3930c01c168434f5df7d9f7fcf80a0db554c"}},{"ruleId":"D1","level":"warning","message":{"text":"LmsColorSpace.convert (cyclomatic 17): LmsColorSpace.convert has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color/space/lms.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d07a40d0ff3fd33b1c503e1d3e4da4d7dfcb6a1b152da42e3c626dabee40a6"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectorList.nestWithin (cyclomatic 16): SelectorList.nestWithin 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":"lib/src/ast/selector/list.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf08acb828b38667b4e09e4a24e0a9b7d7ebd72ea2aae45f9417d331f85f53c"}},{"ruleId":"D1","level":"warning","message":{"text":"AsyncEnvironment.setVariable (cyclomatic 16): AsyncEnvironment.setVariable 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":"lib/src/async_environment.dart"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fc0036612b0838ccf27f7bab7ea67806e42c83155203966427a60b91a777cc"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionStore.addExtensions (cyclomatic 16): ExtensionStore.addExtensions 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":"lib/src/extend/extension_store.dart"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc6446d8309b893dd9defe25e73a1659be64002ce4b27ba28fd00a568d2803e"}},{"ruleId":"D1","level":"warning","message":{"text":"StylesheetParser._tryUrlContents (cyclomatic 16): StylesheetParser._tryUrlContents has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: StylesheetParser.atRule (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 10 of the 45 methods over the threshold \u2014 including the worst \u2014 and 140 of the 415 points over it (34%), 3.3\u00D7 the next-largest file (lib/src/embedded/protofier.dart at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3551}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8a32be4d715024510ccf22f880e7c6fb7bc6f9207935065af1cfebaa102bec"}},{"ruleId":"D1","level":"warning","message":{"text":"SassCalculation.operateInternal (cyclomatic 16): SassCalculation.operateInternal 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":"lib/src/value/calculation.dart"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"350a9a3657150363fbbec8f60d046cff48a4d8373c7b45b31afdc8a084ad3eb1"}},{"ruleId":"D1","level":"warning","message":{"text":"XyzD50ColorSpace.convert (cyclomatic 16): XyzD50ColorSpace.convert 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":"lib/src/value/color/space/xyz_d50.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe26ba3c9cc257604aef576cefdf65637837a7baec275d8919960043102d2388"}},{"ruleId":"D1","level":"warning","message":{"text":"_SerializeVisitor._writeLegacyColor (cyclomatic 16): _SerializeVisitor._writeLegacyColor 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":"lib/src/visitor/serialize.dart"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"3825be029c9c4984b65c096675a6b8a409a77b935fd92c86eef0fc1ddcf51018"}},{"ruleId":"D1","level":"warning","message":{"text":"_SerializeVisitor.visitList (cyclomatic 16): _SerializeVisitor.visitList has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6385daed62b4ee83aebce00d6b3157fab7bf2d086b4e8515e28c168038cbe5"}},{"ruleId":"D1","level":"warning","message":{"text":"_SerializeVisitor._visitQuotedString (cyclomatic 16): _SerializeVisitor._visitQuotedString 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":"lib/src/visitor/serialize.dart"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d299a5b229bde6c00a7714af57cd48274ae75c0d8879a2a5e3bb5d3a94fefb"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser._expression (cognitive 87): StylesheetParser._expression has cognitive complexity 87 (threshold 15). Drivers by points: if/else 34 (55 pts), boolean chains 18, ternaries 2 (6 pts), match/switch 2 (5 pts), loops 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6d43dc884c813b40d2adfa496e223f8ad572f051ac10d8ca02d9d2ca2c9e30"}},{"ruleId":"D2","level":"warning","message":{"text":"Protofier._deprotofy (cognitive 64): Protofier._deprotofy has cognitive complexity 64 (threshold 15). Drivers by points: if/else 10 (26 pts), ternaries 6 (18 pts), match/switch 3 (8 pts), loops 2 (6 pts), boolean chains 4, error handling 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/embedded/protofier.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"50eb414a157fa9b8612e73e0b12727b8cb225b13ec45118bd5c5dd5b2f94725d"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutableOptions._ensureSources (cognitive 59): ExecutableOptions._ensureSources has cognitive complexity 59 (threshold 15). Drivers by points: if/else 26 (43 pts), ternaries 3 (9 pts), boolean chains 5, loops 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/executable/options.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccdac32899b7552f6fe155812644d073ca4d812123682ee19898d4d1e78af42"}},{"ruleId":"D2","level":"warning","message":{"text":"SassParser._loudComment (cognitive 55): SassParser._loudComment has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 7 (24 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/sass.dart"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c916f31c951a4be73e274db115ab3ee8ad72bdb3001e685806b24e779a31f7b5"}},{"ruleId":"D2","level":"warning","message":{"text":"SrgbColorSpace.convert (cognitive 51): SrgbColorSpace.convert has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 10 (27 pts), if/else 9 (13 pts), boolean chains 10, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color/space/srgb.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb59d8ef854c74ac398ed9796e9a807f917b88ea8ba957ccd8cc64fcf4798c5"}},{"ruleId":"D2","level":"warning","message":{"text":"index.normalize (cognitive 44): index.normalize has cognitive complexity 44 (threshold 15). Drivers by points: if/else 31 (36 pts), boolean chains 5, loops 2, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/index.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dc6dd46f142aa4d8e33e615ab1378a6a7b7612f3dbb8622dd24a8940ded06b"}},{"ruleId":"D2","level":"warning","message":{"text":"CssMediaQuery.merge (cognitive 41): CssMediaQuery.merge has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (23 pts), ternaries 7 (14 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/ast/css/media_query.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a293cbd9769f22b420b21e5fa4a80d21d5b3e820a4d5a1777075a9cde0d21526"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser._interpolatedDeclarationValue (cognitive 39): StylesheetParser._interpolatedDeclarationValue has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3770}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63d79680017957e9c06e15c40123127e53efb1a91fd27461a6d9ebb53bb1794"}},{"ruleId":"D2","level":"warning","message":{"text":"CompilationDispatcher._compile (cognitive 38): CompilationDispatcher._compile has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 5 (12 pts), error handling 3 (8 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/embedded/compilation_dispatcher.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"917003f8add4746c274895de197198e0b81128e92f36051bfc379e2c45aa1ade"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionStore.addExtensions (cognitive 38): ExtensionStore.addExtensions has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/extend/extension_store.dart"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea7dfa2843624c76eab5bd54cb25a45b1d8faddde17a75699828ba55b4fbc13"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser.tryImportModifiers (cognitive 37): StylesheetParser.tryImportModifiers has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (34 pts), boolean chains 2, loops 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"9540e65ae222c9b9d0d8f0ffaaa97ba83a077cd238b8c6ee899cd09652c9a409"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncEnvironment.importForwards (cognitive 36): AsyncEnvironment.importForwards has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 9 (12 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/async_environment.dart"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29bad3123179da965e9ad30001a34d0c3e6538e7d8dbc4331df4e7a1552b772"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectorList.nestWithin (cognitive 35): SelectorList.nestWithin has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 4 (12 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/ast/selector/list.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"58541fb0e51c400b2773377a6d4b368f5cb4876938c719d3a04a722e00bdd710"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser._declarationOrBuffer (cognitive 35): StylesheetParser._declarationOrBuffer has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 5, ternaries 3 (5 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefedeeca5a316df7ad368e65fa65ecff85c7bf43524ebab1533ea14f297c4a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionStore._extendCompound (cognitive 34): ExtensionStore._extendCompound has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (6 pts), boolean chains 3, ternaries 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/extend/extension_store.dart"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2da87163956b4509b9d7e57122574a13817c5ce3670a2601e5c39fdf3f7a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser._argumentInvocation (cognitive 34): StylesheetParser._argumentInvocation has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 7, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b28e1d46ab8b434e1819aa9072e87c58f2d28cef32614db2026e23d214dfb0"}},{"ruleId":"D2","level":"warning","message":{"text":"_EvaluateVisitor._runFunctionCallable (cognitive 32): _EvaluateVisitor._runFunctionCallable has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (5 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":3734}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03fe0711b689c23627911f6508e6bb020399d2c9fe5b335ed7fada896d35f97"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpolationMap._expandInterpolationSpanRight (cognitive 31): InterpolationMap._expandInterpolationSpanRight has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (14 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/interpolation_map.dart"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8d657145ab94c9a4ae2bcf2efa87252cbfbaa34674e5531a73e2e11c9dfc52"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpolation._normalize (cognitive 31): Interpolation._normalize has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (5 pts), ternaries 1 (2 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/interpolation.ts"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"059d9fb26d6c7cb512e40582478492452818ab590cc5182f3c8a635d0e6fa42b"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncImportCache.canonicalize (cognitive 30): AsyncImportCache.canonicalize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (5 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/async_import_cache.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4465231883579280677b50c96af636e2d8f3463fe26c2889fb791393b630d74"}},{"ruleId":"D2","level":"warning","message":{"text":"SassNumber._coerceOrConvertValue (cognitive 30): SassNumber._coerceOrConvertValue has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 9, loops 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":"lib/src/value/number.dart"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ef97a8bb1616698d1189f62bf844f5f7b94212738518be3dc09696ce6b6e80"}},{"ruleId":"D2","level":"warning","message":{"text":"_SerializeVisitor._writeRounded (cognitive 30): _SerializeVisitor._writeRounded has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 7 (9 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58d145126bc257bf375d8ced324c699ce8b4efbc3b6815b2a741400b870077d"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncEnvironment._fromOneModule (cognitive 29): AsyncEnvironment._fromOneModule has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (10 pts), ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/async_environment.dart"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"7033595f1f65a20fd8869a362ec213b04b24d5ff5f84d475d7c794d934f01e77"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser.identifierLike (cognitive 29): StylesheetParser.identifierLike has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (8 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3015}}}],"partialFingerprints":{"codehealthFindingId/v1":"940ba3eb10cf5d3c9fc7900a271e715c9c8a29234a3f5fb97c0b5f124190ab14"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.declarationValue (cognitive 28): Parser.declarationValue has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/parser.dart"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b19da6be333671b1fc4b36b14529bd12b24df186c1c229832095348d0a0170"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser.trySpecialFunction (cognitive 28): StylesheetParser.trySpecialFunction has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, ternaries 1 (4 pts), error handling 1 (3 pts), loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3417}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0938714deb8f933c9fbfad5e16c30a9b8300896fd29c23439cfb662cf33c28"}},{"ruleId":"D2","level":"warning","message":{"text":"SassCalculation.operateInternal (cognitive 28): SassCalculation.operateInternal has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 3 (9 pts), boolean chains 5 (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":"lib/src/value/calculation.dart"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b084421255c44be5c1966133f97fe5e2520102dbd9b4958786d198ed1dfaf652"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionStore._extendExistingExtensions (cognitive 27): ExtensionStore._extendExistingExtensions has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (12 pts), error handling 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/extend/extension_store.dart"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddf265a0071fec258e9a894f1a0e964e16181f2e5ba12c1476f8b4314e0d292"}},{"ruleId":"D2","level":"warning","message":{"text":"AsyncEnvironment.setVariable (cognitive 26): AsyncEnvironment.setVariable has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/async_environment.dart"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc34ccaa397b3cdbc09d552e3eb8bf038ccf1ada3695370312861ba88d2eee8"}},{"ruleId":"D2","level":"warning","message":{"text":"_EvaluateVisitor._loadStylesheet (cognitive 26): _EvaluateVisitor._loadStylesheet has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (21 pts), error handling 3, boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeacef7a57dcfd44582350fe2a36974ee3e681919cc5fc92bd304411653aa8bc"}},{"ruleId":"D2","level":"warning","message":{"text":"_SerializeVisitor._writeCalculationValue (cognitive 26): _SerializeVisitor._writeCalculationValue has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, match/switch 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e639c9eb6d8c3cd47291694ec8d5498bcfdf74cd50ba3b4854efd23e26102db"}},{"ruleId":"D2","level":"warning","message":{"text":"NodePackageImporter._nodePackageExportsResolve (cognitive 25): NodePackageImporter._nodePackageExportsResolve has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 7, loops 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/importer/node_package.dart"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf60d0688a4749d88d3d2245b59744926c61feed0ae2b5c65686c6d38abe7937"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser._ifConditionExpression (cognitive 25): StylesheetParser._ifConditionExpression has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35783adc50c7c1ce08efba13cf8c19c3f8a6aaf9a4fba24dcce12c468891dbc"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser._mediaInParens (cognitive 25): StylesheetParser._mediaInParens has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (25 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":4688}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d20b390a106ba8d14cd8bf07381774ea80fa6b167766cd426fba03681044dc6"}},{"ruleId":"D2","level":"warning","message":{"text":"_SerializeVisitor._removeExponent (cognitive 25): _SerializeVisitor._removeExponent has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (5 pts), ternaries 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"944421b0a4adddc18d575e5498566a0d42fb16ba66e45ab8aea114ce8eed00e3"}},{"ruleId":"D2","level":"warning","message":{"text":"NodePackageImporter._packageTargetResolve (cognitive 23): NodePackageImporter._packageTargetResolve has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/importer/node_package.dart"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecdeb060a0265a6a68132f6a0a94bb1998fcc2b4f789b049524098bd21c9b45"}},{"ruleId":"D2","level":"warning","message":{"text":"SassParser._silentComment (cognitive 23): SassParser._silentComment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (9 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/sass.dart"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"124b38a192af4dfed9ec569b0edbd6ef0ae91c867f706a46d9945c5ec44c6856"}},{"ruleId":"D2","level":"warning","message":{"text":"_EvaluateVisitor._warnForBogusCombinators (cognitive 23): _EvaluateVisitor._warnForBogusCombinators has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 2 (8 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":2604}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc2463cb96de107f7df639460b647cdfd7e9d5034a12cd76cb36a7de4e084a8"}},{"ruleId":"D2","level":"warning","message":{"text":"NodePackageImporter.canonicalize (cognitive 22): NodePackageImporter.canonicalize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5, ternaries 2 (3 pts), error handling 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":"lib/src/importer/node_package.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ea6f270dc17b3186099d609817a07c5ec5a9414fcd88b4debde0555003d824"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser.mozDocumentRule (cognitive 22): StylesheetParser.mozDocumentRule has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"36712c412ce93906363594134694c83e042e448c8d0cee4db275b65973be5476"}},{"ruleId":"D2","level":"warning","message":{"text":"SassString.isSpecialNumber (cognitive 22): SassString.isSpecialNumber has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 15, match/switch 3 (5 pts), if/else 2 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/string.dart"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12f52ad0482a16255fc893526376d63382e9ba5330d41aeadf72dedd9ad060d"}},{"ruleId":"D2","level":"warning","message":{"text":"_EvaluateVisitor.visitStyleRule (cognitive 22): _EvaluateVisitor.visitStyleRule has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (6 pts), boolean chains 3, match/switch 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64b22472282f87f653866f82065c4acfd1e287af6c97c5ca5b31f78289191e2"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser.almostAnyValue (cognitive 21): StylesheetParser.almostAnyValue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3660}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac795e4509036d1587578ad942f676e444166b130171f2888c05581a349552e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionStore._extendComplex (cognitive 20): ExtensionStore._extendComplex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/extend/extension_store.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09482ad42708bf8bc23dd03dbb9e3aa45ef35b627666bf70e1bfd280efac8ac"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionStore._extendPseudo (cognitive 20): ExtensionStore._extendPseudo has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, ternaries 1 (2 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/extend/extension_store.dart"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"210e3889bca386b89adfb5ea830082f0dda6de193a690bf034a633972808f9ba"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectorParser._complexSelector (cognitive 20): SelectorParser._complexSelector has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/selector.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fec3445016c22da035e1f45f2f187787749bc8e3fda9aec0afdbd436257f76"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorSpace.convertLinear (cognitive 20): ColorSpace.convertLinear has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 7, ternaries 3 (6 pts), if/else 5, match/switch 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color/space.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c7f93bec8b86c8a6faf4e8dec68af39be8d7dd3e285fc5af992da79c211c33"}},{"ruleId":"D2","level":"warning","message":{"text":"LmsColorSpace.convert (cognitive 20): LmsColorSpace.convert has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (8 pts), boolean chains 7, if/else 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color/space/lms.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"850bfe70112f52053cced32ec83ea427c6ebc4a77805febb7ad515e383c497c0"}},{"ruleId":"D2","level":"warning","message":{"text":"XyzD50ColorSpace.convert (cognitive 20): XyzD50ColorSpace.convert has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (8 pts), boolean chains 7, if/else 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color/space/xyz_d50.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"17660373e83944f1ed558aa821b6d21be457f3bc2c6bb64d93613b529518257d"}},{"ruleId":"D2","level":"warning","message":{"text":"_SerializeVisitor._minimumIndentation (cognitive 20): _SerializeVisitor._minimumIndentation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 4 (6 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fe8a2b5b3b451f78e3d667ea035491708efb76fd5687c1ea5615ac83a6044f"}},{"ruleId":"D2","level":"warning","message":{"text":"_SerializeVisitor._writeWithIndent (cognitive 20): _SerializeVisitor._writeWithIndent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a1cc61991a4f0a9e1e48eeb79887fb00677d3ce828f0c9ff71f6cd4e7aec13"}},{"ruleId":"D2","level":"warning","message":{"text":"_SerializeVisitor.visitColor (cognitive 20): _SerializeVisitor.visitColor has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (9 pts), boolean chains 5, if/else 3 (5 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f0e9439cdadd8897982f63c3b89de945771b0ba9e0d21b8f881a54602bc307"}},{"ruleId":"D2","level":"warning","message":{"text":"_SerializeVisitor._writeLegacyColor (cognitive 20): _SerializeVisitor._writeLegacyColor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"b015c6e9d533dcc444211747420db1c9f28a20bd5fb6a4cd95525fe00e629a57"}},{"ruleId":"D2","level":"warning","message":{"text":"CssComment.constructor (cognitive 20): CssComment.constructor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/css-comment.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8470dcd6abdf9a666541885fc26d0a92f517211c7cd16a126e80d6aadceeb8a9"}},{"ruleId":"D2","level":"warning","message":{"text":"from-props.fromProps (cognitive 20): from-props.fromProps 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":"pkg/sass-parser/lib/src/expression/from-props.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94c3bdf84826182e9b42d535e804c093e1448efa5f9bc5a4fbc9eda409325fa"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbeddedLogger.internalWarn (cognitive 19): EmbeddedLogger.internalWarn has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 1, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"lib/src/embedded/logger.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cf3f2a1e3dcecd7d49f8d3e9fa7a2969619f9e925147192f8e155abc7d031c"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionStore._trim (cognitive 19): ExtensionStore._trim has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/extend/extension_store.dart"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba85e6ed3fac8fddb4850d9577294f6c8cc05878d2ec4819ffbcebe532a174da"}},{"ruleId":"D2","level":"warning","message":{"text":"Value._selectorStringOrNull (cognitive 19): Value._selectorStringOrNull has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), match/switch 2 (4 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value.dart"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb53400c171186f4210e365fc2f1ebb7aaca6aef1bc0351b2c730b9707273cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"_EvaluateVisitor._execute (cognitive 19): _EvaluateVisitor._execute has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 5 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"147b63312bcd773aa5d171e733b27e6ecd5a345ad6bbda3c3b0b5f3d72bed335"}},{"ruleId":"D2","level":"warning","message":{"text":"_EvaluateVisitor.visitDeclaration (cognitive 19): _EvaluateVisitor.visitDeclaration has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, ternaries 2 (5 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"c645a805b8c12fe6a5a4e71c1032a3cbd4c77da64cf96558bff0cfa7b5d5234d"}},{"ruleId":"D2","level":"warning","message":{"text":"_SerializeVisitor.visitCssStylesheet (cognitive 19): _SerializeVisitor.visitCssStylesheet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cf3aaafce8cd0ebde5fbd33b63364178f6239fd363074eca7eeb6f7da8ffa9"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser.interpolatedStringToken (cognitive 18): StylesheetParser.interpolatedStringToken has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":2971}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdc0bf43e0361b735ce02b37b404e53109e09f8a893175861bb5c55348861a1"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser._complexSelector (cognitive 18): StylesheetParser._complexSelector has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, match/switch 1 (2 pts), 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":4155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7360554af7ebb46bda9b1d467565c80dd3e7094735f7b4d336398f2aee3992"}},{"ruleId":"D2","level":"warning","message":{"text":"_EvaluateVisitor.visitForwardRule (cognitive 18): _EvaluateVisitor.visitForwardRule has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e0efd821b1fd4dc166a36f7fe2f557b206b1e34c2ba99d8b3d6fa153a80d5c"}},{"ruleId":"D2","level":"warning","message":{"text":"ListExpression.toString (cognitive 18): ListExpression.toString has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 8, 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":"pkg/sass-parser/lib/src/expression/list.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6a973125b7340e1a8488ed90874194c6194351619322a198d39c42da9d481e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.wrapSpanFormatException (cognitive 17): Parser.wrapSpanFormatException has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 3 (4 pts), loops 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/parser.dart"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc998069d00e9c406de2811fe9e47ba33b53ccc444e79dc0c66b2b981239d7dc"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser._configuration (cognitive 17): StylesheetParser._configuration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f151a846fb98b033ef32e3d9b0642cf4cbc27997c3ced00d49d8b23f38722f"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser._ifConditionRaw (cognitive 17): StylesheetParser._ifConditionRaw has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 1, match/switch 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd5a6a6acee7c8ca69f13e56d7188157c5c1e176a88c0c8603259a6da62627b"}},{"ruleId":"D2","level":"warning","message":{"text":"SassCalculation._roundWithStep (cognitive 17): SassCalculation._roundWithStep has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (6 pts), boolean chains 4, if/else 4, match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/calculation.dart"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dc0c76f2b00313e307baa0ce18b6a17764249204cb9556a7a1699ac726dc01"}},{"ruleId":"D2","level":"warning","message":{"text":"_SerializeVisitor.visitList (cognitive 17): _SerializeVisitor.visitList has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffebfcc76ffb055f3ce4eabfbda45b9dff328635179661ad515e96558f541b32"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectorList._nestWithinCompound (cognitive 16): SelectorList._nestWithinCompound has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 3, ternaries 2 (3 pts), error handling 2, match/switch 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":"lib/src/ast/selector/list.dart"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"370df6fd70d5bdad2079148235c2365b3645683a2e21d5a5ab47a2cac88dc962"}},{"ruleId":"D2","level":"warning","message":{"text":"StylesheetParser._tryUrlContents (cognitive 16): StylesheetParser._tryUrlContents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 1 (2 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: lib/src/parse/stylesheet.dart holds 16 of the 77 methods over the threshold \u2014 including the worst \u2014 and 228 of the 904 points over it (25%), 3.4\u00D7 the next-largest file (lib/src/extend/extension_store.dart at 68). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3551}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf1655d5052ff8d85045a478897b2f31a0ca36291938a471d65fb6156f82bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"SassColor.changeChannels (cognitive 16): SassColor.changeChannels has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 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":"lib/src/value/color.dart"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"93775329ddb670b84edf9952baa3b477f7bfb2e3f7c8925694f46cf97423e1a6"}},{"ruleId":"D2","level":"warning","message":{"text":"_EvaluateVisitor._combineCss (cognitive 16): _EvaluateVisitor._combineCss has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da073710a47c2dd349b2efd5b3726ab7be2d87c759c8cbf40014a424c9dfbba"}},{"ruleId":"D2","level":"warning","message":{"text":"_EvaluateVisitor.visitMediaRule (cognitive 16): _EvaluateVisitor.visitMediaRule has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 5, boolean chains 4, ternaries 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. This shape REPEATS in the file: one other method here (_EvaluateVisitor.visitCssMediaRule) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3254f51914bedddc1c3e3f24f4cb6f23548b54a653d6161dff047763ec756f49"}},{"ruleId":"D2","level":"warning","message":{"text":"_EvaluateVisitor.visitCssMediaRule (cognitive 16): _EvaluateVisitor.visitCssMediaRule has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 5, boolean chains 4, ternaries 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. This shape REPEATS in the file: one other method here (_EvaluateVisitor.visitMediaRule) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":4286}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3e29be09318cb3375456da7b522d56c1c05ded06ccf9824de6f54c5bc6247c"}},{"ruleId":"D2","level":"warning","message":{"text":"_SerializeVisitor._visitChildren (cognitive 16): _SerializeVisitor._visitChildren has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, 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":"lib/src/visitor/serialize.dart"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0c89fd2d62a01cd0b08e7922f80660651d12206dc81904824e590793e2bbdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parse/stylesheet.dart: FileTooLong \u2014 3248 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2748 over it, 6.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dea809803c888d5e834b7f6444028bf6f5d01eb4f0e81f21ef43fb15c5ce3f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/async_evaluate.dart: FileTooLong \u2014 3181 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2681 over it, 6.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b656d72917e7f0ee84bfb95790d51743af7283f8e6b72e68e9d69200cb1ef60a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _EvaluateVisitor: TooManyMethods \u2014 149 methods. The bar is 30 methods; this is 119 over it, 4.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":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6bc1c6dec8abde2614ba7fba7948a526ae683616956b92dbd49be1b9bdaa30"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StylesheetParser: TooManyMethods \u2014 146 methods. The bar is 30 methods; this is 116 over it, 4.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc147d81ab8646565a96e18052a35cb69b4b52c063052a530ff1507fe534b066"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _SerializeVisitor: TooManyMethods \u2014 83 methods. The bar is 30 methods; this is 53 over it, 2.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95051e010f007fb7b0c25c869270bc0370660f6b40560fccfba815c63043707"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: _SerializeVisitor: ClassTooLong \u2014 1097 significant lines (blank, comment-only and punctuation-only lines excluded), 83 methods. The bar is 400 significant lines; this is 697 over it, 2.74\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a18e5e932611dc3677f2c0c89409fcf348530b0876350ae3a23df97b208cb44"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: visitor/serialize.dart: FileTooLong \u2014 1177 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: _SerializeVisitor (115-1927). The bar is 500 significant lines; this is 677 over it, 2.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/serialize.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bcc31dc7d551c5ea4e33f903039814dd545fa6998400a6983be648a70a89fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SassColor: TooManyMethods \u2014 67 methods. The bar is 30 methods; this is 37 over it, 2.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7236c7375dc3ca9d536d87657fcdf6a48926e99e687cb078a103accebec0f93e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SassNumber: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\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":"lib/src/value/number.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"317c8e2acd4c7b030a543f7f277b38c4163bf6f4d2d6492e8a3a30ec255121d7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SassCalculation: 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":"lib/src/value/calculation.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1078d9ecacbf559a55bac65b7070c125922d52a97f9d24a15bc0fa5c8585f77a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/parser.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f7144c96db15582b84197572d834c3d14d2c010863b2fc180bfa17d8be0da2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExtensionStore: ClassTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 161 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/extend/extension_store.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba77922d1c4c9ca2f685136a5aea85cd5b54bc97ef322bd8254b7679d08cd4c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Value: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value.dart"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"02101e63da06fd39077611224f269b9904f8c63447ebea6a467ca21e4673428a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Protofier._deprotofy: MethodTooLong \u2014 _deprotofy runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/embedded/protofier.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7854b788adfa154b7ab1976f470e77547f15bd60e9cf962860c553e27c63d44"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AsyncEnvironment: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/async_environment.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e11226b74f5062ba0e0a6bedf51ad541a5690a00cbb78333e772c2c184e620"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SassColor: ClassTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded), 67 methods. The bar is 400 significant lines; this is 129 over it, 1.32\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df0c74c9fe56050d7eda1405ef6b5b3e981c7be5aaaa61f72c00b56f28a30c3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExecutableOptions: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/executable/options.dart"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e1fb8a18e7f0d25a37d8b884bbe43888dca4f6de176c60a583f6fa30192ca5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Exports: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/js/exports.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c3c215a04d849319640854bce392d0d67418e7ed04116aa6267b5db9fd72fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompilationDispatcher._compile: MethodTooLong \u2014 _compile runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/embedded/compilation_dispatcher.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33578918dcf9d2ecb38a4d97a05e121d78be3d9a44ac13d850b45a81cdb1313"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SassCalculation: ClassTooLong \u2014 496 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 96 over it, 1.24\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":"lib/src/value/calculation.dart"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c004acaf6d778b823d92c2a08a54e00d223d7edbd52a4e2285d343ea3ee3b0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/async_environment.dart: FileTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: AsyncEnvironment (37-955). The bar is 500 significant lines; this is 106 over it, 1.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/async_environment.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b6e01a44dc15016a5dbb802609a8f0cf74458be26ccd052248e50fa0f625a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extend/extension_store.dart: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: ExtensionStore (26-1122). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/extend/extension_store.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5591c288e14916b8b606a57fd654dbc6e1803e844838fbbccb1af7a99bb1cf4d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AsyncEnvironment: ClassTooLong \u2014 461 significant lines (blank, comment-only and punctuation-only lines excluded), 40 methods. The bar is 400 significant lines; this is 61 over it, 1.15\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":"lib/src/async_environment.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2619e0eecec7429fa65c32eb7d7f682e476f8ad1e1f333777129c445ffdc2006"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: value/color.dart: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: SassColor (23-1116). The bar is 500 significant lines; this is 54 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff9918d2d8e547277eb9f8663ebf47832e8528fe0534fb4e9997dd119f929f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: value/calculation.dart: FileTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: SassCalculation (31-972). The bar is 500 significant lines; this is 53 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/calculation.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b5cbdbd9bbec3a1ed7558d44d08177dea9dd35b933675b036841533587a342"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 442 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 42 over it, 1.11\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/parser.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b791b742c20512e2235cc1e98a3d7c98c3af2e822bb986c508d5df43c5b15c00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: value/number.dart: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/number.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1be1bd9d4177520b8a13bc52759974435059d6e425bf494088a5d73d61681f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): lib/src/visitor/async_evaluate.dart:2374-2444 | lib/src/visitor/async_evaluate.dart:4286-4356 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28fb93234aeb5fbb51dbc1656d73c9427da5a5e32d113404edc8bc824136e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): lib/src/visitor/async_evaluate.dart:2655-2708 | lib/src/visitor/async_evaluate.dart:4423-4468 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":2655}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa929dc31c35170f0aca402d00907a490567a99fcde82a0f82d72b4a0e20363"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): lib/src/importer/js_to_dart/async.dart:53-86 | lib/src/importer/js_to_dart/sync.dart:56-97 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/importer/js_to_dart/async.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a698c062fc4b54013b876efda3480a1146d9729dec1fbd7d6ea4238b717274b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): lib/src/parse/scss.dart:69-103 | lib/src/parse/scss.dart:105-135 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/scss.dart"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"663c0f75fc32b908b6b38cc2f149eb845bcc41f4c5d5a80aef529b5331560030"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): lib/src/importer/js_to_dart/async_file.dart:25-49 | lib/src/importer/js_to_dart/file.dart:20-51 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/importer/js_to_dart/async_file.dart"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5002be5b15857893e475dabc2e70ba25dcae4b72493930efc2e7493ebaf9145"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): lib/src/value/color/space/lch.dart:41-59 | lib/src/value/color/space/oklch.dart:42-60 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color/space/lch.dart"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0995e8ba027bad36d2bbda0c8fbfa4187c24c1a8429f89d3fd04440807671e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): lib/src/visitor/ast_search.dart:75-85 | lib/src/visitor/statement_search.dart:59-67 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/ast_search.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"497c8747da7c3452c9dca3c58643e1083314df71383f168cbf74104803be01c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): lib/src/visitor/recursive_ast.dart:84-98 | lib/src/visitor/recursive_statement.dart:61-74 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/recursive_ast.dart"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca406bc69cafff817a24375f0a49aa8953adf434a242d2a0c1053e3337bd9ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): lib/src/value/color/space/display_p3.dart:28-43 | lib/src/value/color/space/display_p3_linear.dart:28-43 | lib/src/value/color/space/srgb_linear.dart:28-44 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color/space/display_p3.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"126a5c849844df5bd3605b7181afd213222406c1c94c8e662fc6760b715f0c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): lib/src/value/color/space/lms.dart:141-152 | lib/src/value/color/space/prophoto_rgb.dart:44-55 | lib/src/value/color/space/rec2020.dart:42-53 | lib/src/value/color/space/xyz_d50.dart:111-122 | lib/src/value/color/space/xyz_d65.dart:33-44 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color/space/lms.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"db54b47a45800e314e0a96aecc88bffcffc810c6771d6287ca06661d760624ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/ast/sass/statement/include_rule.dart:48-55 | lib/src/ast/sass/statement/mixin_rule.dart:31-37 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/ast/sass/statement/include_rule.dart"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cea82e770655741fedf652037040eb99a134865e29670c1397cb25438fe793"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/module/built_in.dart:68-74 | lib/src/module/shadowed_view.dart:115-122 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/module/built_in.dart"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d748aa3274d5dd4a05606e4d8d92e3cc5641cf585f5a13946c0cb7d2e0959bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/value/color/space/prophoto_rgb.dart:34-42 | lib/src/value/color/space/rec2020.dart:34-40 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color/space/prophoto_rgb.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"93921ac4201b42518590a374d573a35fffcfded0a57663a633c63a595ea2681a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): lib/src/parse/selector.dart:543-547 | lib/src/parse/stylesheet.dart:4560-4570 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/selector.dart"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ac5aab542ede102119d5715e2e01356afaf3b9e937e5f77bb363e1791151e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): lib/src/value/color/space/prophoto_rgb.dart:26-32 | lib/src/value/color/space/rec2020.dart:26-32 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/color/space/prophoto_rgb.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5e6eb723475eb64ed70ccc0d3c0b39056669af33060ad6338ed2d7eb45f7d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): lib/src/importer/js_to_dart/async.dart:59-86 | lib/src/importer/js_to_dart/sync.dart:70-97 \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 \u0060lib/src/importer/js_to_dart/async.dart:59\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/importer/js_to_dart/async.dart"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edfe4cfce425ef27823168f42d854cbbc92a894afbb68e5ae1a05cdbb607a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): lib/src/value/color/space/lms.dart:35-61 | lib/src/value/color/space/xyz_d50.dart:28-54 \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 \u0060lib/src/value/color/space/lms.dart:35\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":"lib/src/value/color/space/lms.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a92dcd6db423211b1fce31667f891c3c681af21e9d012a75fabfbe2bf82aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): lib/src/visitor/async_evaluate.dart:2414-2439 | lib/src/visitor/async_evaluate.dart:4328-4353 \u2014 both copies are in the same file, so extract the block 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 \u0060lib/src/visitor/async_evaluate.dart:2414\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f2f5aa3dda27ada57f7507638e772ab37d9c21335ac73c78912fd521f99ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): lib/src/visitor/async_evaluate.dart:2683-2703 | lib/src/visitor/async_evaluate.dart:4445-4465 \u2014 both copies are in the same file, so extract the block 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 \u0060lib/src/visitor/async_evaluate.dart:2683\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":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5802eaf6819f8e4d297aedae04ea57e3626c1f3f53bda5d4b0306b9cb71a90f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): lib/src/importer/js_to_dart/async_file.dart:34-49 | lib/src/importer/js_to_dart/file.dart:37-51 \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 \u0060lib/src/importer/js_to_dart/async_file.dart:34\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/importer/js_to_dart/async_file.dart"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6c6c262315e5ed0a86d19c3a93574929537949b2f6a9dfa06638d0c14c3353"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): lib/src/embedded/logger.dart:53-64 | lib/src/logger/stderr.dart:30-42 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060lib/src/embedded/logger.dart:53\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":"lib/src/embedded/logger.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8199f11a59a3fb08a4519fbf240f73ebfaeca0df671d38ff7fc0e0ac1cc06d66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/parse/scss.dart:75-87 | lib/src/parse/scss.dart:110-122 \u2014 both copies are in the same file, so extract the block 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 \u0060lib/src/parse/scss.dart:75\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":"lib/src/parse/scss.dart"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7794162fa911178fab3051aeadebb5de69513815b53eec452f408c60219628"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): lib/src/visitor/async_evaluate.dart:2577-2589 | lib/src/visitor/async_evaluate.dart:4394-4406 \u2014 both copies are in the same file, so extract the block 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 \u0060lib/src/visitor/async_evaluate.dart:2577\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":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73a4511fb923b2df191b6b1c339cb7cd8bc7460889658b425df3ebfbe47e3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/value/color/space/display_p3.dart:53-64 | lib/src/value/color/space/display_p3_linear.dart:53-64 \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":"lib/src/value/color/space/display_p3.dart"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29d90268be06077ee85a146914b012cbee9becc8e532e1b40e29aeef0064f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): lib/src/value/color/space/srgb.dart:141-152 | lib/src/value/color/space/srgb_linear.dart:54-65 \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":"lib/src/value/color/space/srgb.dart"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"070ec549f0e57182d3f016fad7a434bff4b43feb2522085f7408216de08dcfdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): lib/src/ast/sass/interpolated_selector/class.dart:22-32 | lib/src/ast/sass/interpolated_selector/id.dart:22-32 | lib/src/ast/sass/interpolated_selector/placeholder.dart:22-32 \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. 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":"lib/src/ast/sass/interpolated_selector/class.dart"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d74a8f648fed36a093331db194c5c93913a681a4d3ea822d01107879dc16cd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): lib/src/ast/sass/interpolated_selector/compound.dart:26-43 | lib/src/ast/sass/interpolated_selector/list.dart:27-44 \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":"lib/src/ast/sass/interpolated_selector/compound.dart"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f673a86728c48479743afaeed0f61a1801092442095a3ee697159ceac1e364"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: sass (pub): sass (pub): abstractness 0.14, instability 0.00, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6082aaf2fa72ceff6bcefe46525b6635cf03f71aa51faa98a376cf54d688f8d7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SassColor (LCOM4 18): SassColor\u0027s methods fall into 18 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 18 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":"lib/src/value/color.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ceb2ca697d8767b786a121a4d5e10c90689b59664d1c634451a4437b2f03fb5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _EvaluateVisitor (LCOM4 16): _EvaluateVisitor\u0027s methods fall into 16 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 16 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":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3622fe4bbe5970bb8ffde947b40c5aea33218136654e956cd32f4112147c02"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _EvaluateVisitor (LCOM4 16): _EvaluateVisitor\u0027s methods fall into 16 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 16 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":"lib/src/visitor/evaluate.dart"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e46e8b5c8c45e86d7f1396f4bf6ada9f679cbd4e08cfcb34e81a3c208fafee3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ForwardedModuleView (LCOM4 14): ForwardedModuleView\u0027s methods fall into 14 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 14 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":"lib/src/module/forwarded_view.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba02084435febca852e81cebeffaa07c5f5c3be7c896c6ce75f010641a650441"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LazyFileSpan (LCOM4 13): LazyFileSpan\u0027s methods fall into 13 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 13 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":"lib/src/util/lazy_file_span.dart"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"572e91d8f74b78a22119edec3c2f31c022b47295c6ac7c09466fbe7317f564a3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SassNumber (LCOM4 13): SassNumber\u0027s methods fall into 13 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 13 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":"lib/src/value/number.dart"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93a36800e0e7dac9242d5edbeb8b71bd3117cb5fa3e362d979b1835ee4de264"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BuiltInModule (LCOM4 10): BuiltInModule\u0027s methods fall into 10 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 10 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":"lib/src/module/built_in.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"db89cb3481bb33cb12a67f2d0894102fe45ca9577d4e134db5a7adbf95bb222b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SassList (LCOM4 8): SassList\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/list.dart"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a21760b337460fc9e2c3f48b9f5ffe4f6f1a85c7f2372fd854a2d1721887755"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SassString (LCOM4 8): SassString\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/string.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"70344b7e6f99a493b53877b88c985143f10b02cf91043e6f4e3cf082dfb0a72f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PseudoSelector (LCOM4 7): PseudoSelector\u0027s methods fall into 7 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 7 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":"lib/src/ast/selector/pseudo.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3031c6f4f516fd3ae81146071027fdc5785736041ffed2382c2541166e8471"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _EnvironmentModule (LCOM4 6): _EnvironmentModule\u0027s methods fall into 6 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 6 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":"lib/src/async_environment.dart"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"7363e41adb525be5c699bbd5d40cc2f4f603de46ba83b1ba85b192e24be56086"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _EnvironmentModule (LCOM4 6): _EnvironmentModule\u0027s methods fall into 6 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 6 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":"lib/src/environment.dart"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaba5b9b3d1bc353e4e64cb556f86deae1f6005ebf7030d9e9326cfe58dff871"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SassMap (LCOM4 6): SassMap\u0027s methods fall into 6 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 6 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":"lib/src/value/map.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdeb2d38b29d1bf1515d28e5fae0347d692e7b3b67e3cbfde64cff6d6a64192"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _FindDependenciesVisitor (LCOM4 6): _FindDependenciesVisitor\u0027s methods fall into 6 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 6 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":"lib/src/visitor/find_dependencies.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81d1aff1943c2594b277e4e4deff27e79ffa6175dbd69eddd4e33beccd5bae3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VariableDeclaration (LCOM4 5): VariableDeclaration\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":"lib/src/ast/sass/statement/variable_declaration.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"637d75b6cd4f7e361372423688bfaa5b9b92ead3ea2f91f9a0809e5402843748"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SassParser (LCOM4 5): SassParser\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":"lib/src/parse/sass.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4753e0946dd2f875bd999d7d3bfa0dbfc8033f145976c4a5c6773e206e58c6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ModifiableCssStyleRule (LCOM4 4): ModifiableCssStyleRule\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/ast/css/modifiable/style_rule.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9172cbde983359d060c02abea538fa24e4ef28723c673eab4048d7d920d09334"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CssStylesheet (LCOM4 4): CssStylesheet\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/ast/css/stylesheet.dart"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72f887970163ef19cbbef0d970233a63505f23877787cfc594faac48ff0d5d8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FunctionExpression (LCOM4 4): FunctionExpression\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/ast/sass/expression/function.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d2f73343d8efac99634cb21646d4aab641e4b3509fedbc59f4126352e77967"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IncludeRule (LCOM4 4): IncludeRule\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/ast/sass/statement/include_rule.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebeb5a41de1eb24b116a234ba5ddb86fc31196c296dc15dabd985dc591444f5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Configuration (LCOM4 4): Configuration\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/configuration.dart"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7581f65cf8fc0d99f8feafc4e2be2509f26f59e393b9483c32539abfd1cb58a8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HostImporter (LCOM4 4): HostImporter\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/embedded/importer/host.dart"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fee6df9e4e23020e4e1992d1c63eb8dfb123db02afefb1fa74f414a21ff8b1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SassException (LCOM4 4): SassException\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/exception.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07ae70d090a5ef2c392892f22e8a7b9eac867b728d702acfb5264dbdffb92e8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FilesystemImporter (LCOM4 4): FilesystemImporter\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/importer/filesystem.dart"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"066e0a00f8d2e7b0168ec6835a32a531b5db0cf851d298cf90c9ba63e347c653"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NodePackageImporter (LCOM4 4): NodePackageImporter\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/importer/node_package.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cea530a77e808953981699572d9971c312eea2eb22cc08ad528e5385900c1dd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NoSourceMapBuffer (LCOM4 4): NoSourceMapBuffer\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/no_source_map_buffer.dart"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"391bf615f76eece81be19ab1a94c7ad02f0cbaca5bd7448d9962de471ba96c57"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the jest suite in pkg/sass-parser/ ran and not one test passed (FAIL lib/src/expression/list.test.ts), so the coverage would describe the failed run, not the code. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: toJSON: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/configuration.test.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c82254ab2da7ac084d4a1b4f5fbbef27e4789ca779528b6000ab97f62260b1"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: toJSON: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/forward-rule.test.ts"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ce2ba286bc7fa187877c6a42c0435ecf01d71f1fbbfd976b19128eca86bdd1"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: toJSON: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/use-rule.test.ts"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bb22ae8a7e2e858388e51ed2634dabd49f33b5dd0a2ca939d3fa33c1529f3e"}},{"ruleId":"D12","level":"warning","message":{"text":"Floating npm dependency: source-map-js: \u0060source-map-js\u0060 is declared as \u0060\u003E=0.6.2 \u003C2.0.0\u0060 in package/package.json, which names no releasable version: \u0060\u003E=0.6.2 \u003C2.0.0\u0060 is an open range with no upper bound on the major. A production dependency that cannot be resolved to one immutable release makes the build non-reproducible \u2014 two installs a day apart can ship different code \u2014 and leaves nothing for a vulnerability scanner to match against."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"38bd671dcdf55476de4a0a379fc645e9d869e452e01ed7c4e950b1d3a3108a23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/parse/stylesheet.dart: lib/src/parse/stylesheet.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in StylesheetParser._expression at line 2024. 2 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/parse/stylesheet.dart\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":"lib/src/parse/stylesheet.dart"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46d795b2dfeb7ac50874c17c520c009176ae1b61ab929038e358267b9c24bbd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/embedded/protofier.dart: lib/src/embedded/protofier.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in Protofier._deprotofy at line 176. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/embedded/protofier.dart\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":"lib/src/embedded/protofier.dart"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf005f41ac23d7be6408fd541170d5124fd8194111c523ab8db069f6b9388c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/executable/options.dart: lib/src/executable/options.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ExecutableOptions._ensureSources at line 319. 1 of those changes was a fix/bug commit, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/executable/options.dart\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":"lib/src/executable/options.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fd206b3e729c73d493a6d7299efb820a709f76e50c43e4c59a4f5c27f132d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/visitor/serialize.dart: lib/src/visitor/serialize.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in _SerializeVisitor._writeCalculationValue at line 532. 4 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/visitor/serialize.dart\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":"lib/src/visitor/serialize.dart"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf0cb7a3fb161fd874cdcaaa18542c299c910c30a81b38ccaf610fcc21aa1b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/visitor/async_evaluate.dart: lib/src/visitor/async_evaluate.dart changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _EvaluateVisitor._visitCalculationExpression at line 3428. 2 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/visitor/async_evaluate.dart\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":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7419065655b83117b46f611643d6e95d81d9bbfb0e3f46d2f7b7d2fd72ca9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/ast/css/media_query.dart: lib/src/ast/css/media_query.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in CssMediaQuery.merge at line 90. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/ast/css/media_query.dart\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":"lib/src/ast/css/media_query.dart"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"1daa9a8fa34c338b825d062c8b3a44028512510b670840244308bafd61ed7939"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/value/color/space/srgb.dart: lib/src/value/color/space/srgb.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in SrgbColorSpace.convert at line 31. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/value/color/space/srgb.dart\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":"lib/src/value/color/space/srgb.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b897ef1124c49cee07d986da4ebd9231fbe8300485cfb6eac6b3e20cccad1d79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/embedded/compilation_dispatcher.dart: lib/src/embedded/compilation_dispatcher.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in CompilationDispatcher._compile at line 107. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/embedded/compilation_dispatcher.dart\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":"lib/src/embedded/compilation_dispatcher.dart"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b9fff497374e0c39c369c0a572371ffc1b7f841b466fe5081ee224e6918fa6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/parse/selector.dart: lib/src/parse/selector.dart changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SelectorParser._complexSelector at line 117. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/parse/selector.dart\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":"lib/src/parse/selector.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fbfe32d150f44dab6ea9638197a79c522a65b2f3908cf0baa44e2142f1ba7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/value/color.dart: lib/src/value/color.dart changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in SassColor.interpolate at line 927. 1 of those changes was a fix/bug commit, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/value/color.dart\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":"lib/src/value/color.dart"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"608d474233eb1c5622468d80760ae433acbae8b374d36e4948834a9569cbcaf1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/value/color/space.dart: lib/src/value/color/space.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ColorSpace.convertLinear at line 192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/value/color/space.dart\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":"lib/src/value/color/space.dart"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e9275e689e918ab871573078f9c1367b161ab99a20887cfeb6613bb5b80b9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/value/calculation.dart: lib/src/value/calculation.dart changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SassCalculation.roundInternal at line 508. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/value/calculation.dart\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":"lib/src/value/calculation.dart"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"af62370572ca2164260a14e1ab6d6962ae708c4f3a942620d26204fd926ddc12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/value/color/space/lms.dart: lib/src/value/color/space/lms.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LmsColorSpace.convert at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/value/color/space/lms.dart\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":"lib/src/value/color/space/lms.dart"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9438d83bf5176275ec68eff6c58a699b70a12c0bca2faa11a5662d5f90ee3d31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/extend/extension_store.dart: lib/src/extend/extension_store.dart changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ExtensionStore._extendCompound at line 614. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/extend/extension_store.dart\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":"lib/src/extend/extension_store.dart"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"02db2d6689e61421b11258db080c626d685aca723279c9c942fe65fa9ba74a9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: lib/src/value/color/space/xyz_d50.dart: lib/src/value/color/space/xyz_d50.dart changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in XyzD50ColorSpace.convert at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 17:35:53 -08:00\u0027 --until=\u00272026-11-10 17:35:53 -08:00\u0027 --full-history --no-merges -- lib/src/value/color/space/xyz_d50.dart\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":"lib/src/value/color/space/xyz_d50.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b797a22ca81aeb0bfe1008f6cb51587b1e8f96c59439c94911c9941144a2943"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): Remove this when we use this tag to trigger the release \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":"tool/grind/sass_api.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"865dff405cb58d135d5e0e266496ac16027bc90d4f0b5bb44649cc431440a093"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): test SASS_PATH when dart-lang/sdk#28160 is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/dart_api_test.dart"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f574373baef746d0a16a4d42dfba1090eeb6e1ab6624dccc76fa58a56f3c373a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: update \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":"test/dart_api/value/color_test.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6df98d766a979e5601d854b8bc68027e5ec8b5f7b0097011ae34c5d59f989c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test this when there\u0027s an expression-level future deprecation \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":"test/cli/shared/deprecations.dart"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"1620681dc4369a104525e6f365069f0b2089c60f41e442c6d3bab015ab924f54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test this when there\u0027s an expression-level future deprecation \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":"test/cli/shared/deprecations.dart"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f869e8bd33d28147f0797a829822b62c8d3be7db0b57b9dd7697b859bb295e3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test this when there\u0027s an expression-level future deprecation \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":"test/cli/shared/deprecations.dart"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"5986c02ff58a575b17d36bb2a6d39b2a61004ea4bce78498b17ef63bd1e247bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test this when there\u0027s an evaluation-time future deprecation \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":"test/cli/shared/deprecations.dart"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"47abc46bfee5f6b9673e6e0877d89393643a04d0bdba41e22f9c461300eb254b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: set lazy raws here to use when stringifying \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":"pkg/sass-parser/lib/src/argument-list.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9ac79e54bbb694df938a6fa2b337f121f1b7147e9a15dc57c3b26787240b26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: set lazy raws here to use when stringifying \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":"pkg/sass-parser/lib/src/interpolation.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6454e9fcecd58ff2b7fa2d19cfaeeee276bfa1c5a6c56e8d9748e9e2e393487"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: set lazy raws here to use when stringifying \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":"pkg/sass-parser/lib/src/parameter-list.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb7b69054fe378726c3ca73248cb6504a9475b5eeeedfe1edc30633dbd3429d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Provide source information for this argument. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/argument-list.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6581d41d150ede32597f444b18d2f88a3aed93bc7017f01b6b0541230d57fbd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Provide source information for this argument. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/argument-list.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6b19c79b49cf0ff147126f56a859ea887288ccf8aa3b4b5250119967037caa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment repeated across 22 files: The identical TodoComment appears in 22 files (88 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 88 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// TODO - postcss/postcss#1957: Mark this as dirty\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/argument-list.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8021b22c0b074234c316663b7710068bd06efff23594c6da25a6b144b5396853"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment repeated across 28 files: The identical TodoComment appears in 28 files (28 occurrences) \u2014 almost certainly one boilerplate line from a single migration or decision, not 28 independent debts. Fix the systemic cause once rather than file-by-file. Text: \u0022// TODO: remove this once raws are properly parsed\u0022. Source code is not a task system: track the cleanup where tasks live. (Every occurrence still counts toward the score and metrics.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/configuration.test.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81c5f659f0966220b8e959323ac0742e33330a824a14e29578fb0cc785b3250"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should probably implement a similar interface to \u0060ParameterList\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/configuration.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab05fc0460448e65ca9e5823e9c74545f16e565d53a7fb049e1129edd45545e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: expand inner[0] and inner.at(-1) out through \u0060(\u0060 and \u0060)\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/configuration.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1d26aacd997a9d4441fd9647c78d7a088e8b7f5be01c981cb16e5b5fca270a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once raws are properly parsed. \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":"pkg/sass-parser/lib/src/dynamic-import.test.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e46023fd4143274c7efbd99c4014442929e872d410a86456440b8921476ee2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once raws are properly parsed. \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":"pkg/sass-parser/lib/src/static-import.test.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a604da0246570fba734db7acb7c2e0945b2e686547ad8240dc026392fc311c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once raws are properly parsed. \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":"pkg/sass-parser/lib/src/expression/color.test.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51a27ec7c5ddde70f964e9290eaa0a0d49225b55b18ec0e91e694d731e34c0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once raws are properly parsed. \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":"pkg/sass-parser/lib/src/expression/if.test.ts"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9c727a317949d59462974a04739b1579728a2dcffe676b563f94918417b3ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once raws are properly parsed. \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":"pkg/sass-parser/lib/src/expression/list.test.ts"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"5794a348dbc297a211d19d23b34ee0b015a1e019d0f4b47b77bc8a3c6ea0db43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once raws are properly parsed. \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":"pkg/sass-parser/lib/src/expression/map.test.ts"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"7858b599848f63ab16c2642125ec39266c510ae054bbf40922b0feef4e72b6fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once raws are properly parsed. \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":"pkg/sass-parser/lib/src/expression/number.test.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef681d0f9101a5a647693727902fa5fe4214056da3cb89729b5e79b3fd77d543"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test before and after raws for children \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":"pkg/sass-parser/lib/src/import-list.test.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adaeb3c18b2e7ef92d6e288e7a1acd8b85925fdd3699a4173873aef7f559665"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Are there any node types that allow empty interpolation? \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":"pkg/sass-parser/lib/src/interpolation.test.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"038276fcd7bb4ba89f995699d583439ef1509e9d296657c654f4bba8271cb296"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Provide source information for this parameter. \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":"pkg/sass-parser/lib/src/parameter-list.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fa438d34fa076f2667e8c1f99ccf27c49a4acdf46e42aa56030559ff0d8268"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u0060@import url(\u0022foo\u0022)\u0060 when the expression-level syntax is \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":"pkg/sass-parser/lib/src/static-import.test.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f13a828da5ba742722e746938f7abd46a037bf4e755ab6e55ee47e5f4802173"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test \u0060@import url(\u0022foo\u0022)\u0060 when the expression-level syntax is \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":"pkg/sass-parser/lib/src/static-import.test.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6178e4a26934ec3c2c91e7d32bfff9a6792b0873e92830131dc371f9017ef5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If staticUrl is of the form \u0060url(\u0022...\u0022)\u0060, it gets parsed as an \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":"pkg/sass-parser/lib/src/static-import.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6f0b0dd0dfdede53cdad6bbefa58d779618055b947adcabc7348d212e65c42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test a variable used directly without interpolation \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":"pkg/sass-parser/lib/src/statement/at-root-rule.test.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cb375bc5835b3bd19d1dbd1b6d458d5526aa1b1a16c614ec331c5fe2b79340"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test a variable used directly without interpolation \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":"pkg/sass-parser/lib/src/statement/media-rule.test.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"513c41b0709a97bb9427815986f8b9b4fe036dbaf448eca5970f8753779ea697"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test explicit whitespace after text and interpolation once we \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":"pkg/sass-parser/lib/src/statement/css-comment.test.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b5b8a4ab9e8e611c94bf242554e35411419481ea0e1dc65bde49354e716141"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): Make sure setting non-identifier strings for prop here and name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/declaration.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7746b76df55b6df5a078cc68fe8443cc510f41f7fe13916ade556ec9b00d09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return whether \u0060this.expression\u0060 is a nested series of unbracketed \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":"pkg/sass-parser/lib/src/statement/declaration.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8947dbb46afccb105faa6c6634ad2bc8ff40385c9c5dccd9670aa5d3a2e9fc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return whether \u0060this.expression\u0060 is a nested series of unbracketed \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":"pkg/sass-parser/lib/src/statement/variable-declaration.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e564f6cf8b8abbaf4a54ea0705930de4d41040b7dfff7c26c91a2810a83dae7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If value !== this.important, either set this to a space-separated \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":"pkg/sass-parser/lib/src/statement/declaration.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26b6f66d90da0e892c1fd645f8e72f549bc99d02759b07285154b182549ebf5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If value !== this.important, either set this to a space-separated \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":"pkg/sass-parser/lib/src/statement/variable-declaration.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7b63755feecbdb32a5c2ed2ecd931057aabca3a3e69ced9346f8b523686d54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use raws technology to include the actual original text between \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":"pkg/sass-parser/lib/src/statement/media-rule.test.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0d6e46d5c31a87ef685c235047f93800aa8ffaac637086f3ee343eddb7be94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Once we make selector parsing available to JS, use it to override \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":"pkg/sass-parser/lib/src/statement/rule.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"365c7376594619e8aaa745e519de523f9140baf28a7f3c914055684c5bbd52d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse strings. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/complex.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cc8196af05b4b74c78142e310354c2efb2b22b002b0bb5ac517ea1a6ed4134"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse strings. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/compound.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42729b1ecea0fe07cab903d330a18d95ed6f6a2fcca4bab876a7fd5ccc8053a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse strings. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/list.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b30003972e62ad0c12705e6cf11782660ac176534c131a9a022eb1a7ca93d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse strings. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9e1b95d010428998e3a0e54e8b37655c5d0fbd42304a0ef87fb4b8c0712d29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse strings. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/list.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"41284a22638572d0e0cbcce9b888e49cc8e8bbb00fbe1178357a530cf5124c18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse strings. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/map.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3506e64460605319735c2d7c0279b39057a7e3253a9b8feeb5a873e3fb7deff8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Parse strings. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-condition-expression/operation.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3075e637a1b0a2adb01eb01b9bac7a535d924acf979d6e95020b7e190331f844"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Enable this once slash separators aren\u0027t parsed as division. \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":"pkg/sass-parser/lib/src/expression/list.test.ts"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64c1cd65297f065964c772895329df0cd204b061eb96ed7f385841bcb3e1ecc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Enable this once slash separators aren\u0027t parsed as division. \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":"pkg/sass-parser/lib/src/expression/list.test.ts"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a361facefdc3bea18dcb2e2c992ea4ef0436a323a1470c81f3893236bdcc31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: provide a utility asPlainIdentifier method that returns the value of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/string.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8bcaca87d5b793d1202a33a01651d203a1d4244c4012d5a5c7813948d53b31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): This used to avoid tracking source spans for variables if source \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":"lib/src/async_environment.dart"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"650fa729b40bbf396fd4d4711a330cc1eb50e4521b3a5401b6eb7525aa507c4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): Use an SDK function for this when dart-lang/sdk#35370 and/or"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/io.dart"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ce176177127b66729896a0f46d91abd87caf8ef0d392acffa74673b5d135fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): Use a built-in solution for this when dart-lang/sdk#10297 is"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/utils.dart"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1f511f601eaeb7c3d19674a5d4b6772a2e0dc16165608c22b787cd3e0898ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): colorize this if we\u0027re running in an environment where \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":"lib/src/value.dart"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"608f65661341821af87bd3e8418089d3b0707ce3880b204aa4b84c84c2bac6a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): colorize this if we\u0027re running in an environment where \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":"lib/src/value.dart"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"204d2d4ecfe3396c6005e67a9ebf857d399834301f8e99a15fc3aa8f5d0ccb49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): colorize this if we\u0027re running in an environment where \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":"lib/src/value.dart"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1a7c01d6c08d5ee199e17eb916033cdf8bf6f4fc765f3348a8da3f7f7719c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): colorize this if we\u0027re running in an environment where \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":"lib/src/value.dart"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b028276d5c38b3f02ba978c4b620a0c52b0e62c3a67ba9bc13c36f29ce54a94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): Set [trackSpans] to \u0060null\u0060 once we\u0027re no longer emitting \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":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":3633}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2079838781c3f0fb4a1760c6ebb43ebbebbe324e4cdea89f90f24904c39099"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): This used to avoid tracking source spans for arguments if \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":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":3893}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6e9abb8e5f99e35e61f9c8207a2506fb5cba516045f400d3df69a7d9b36076"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): This used to return [expression] as-is if source map \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":"lib/src/visitor/async_evaluate.dart"},"region":{"startLine":4633}}}],"partialFingerprints":{"codehealthFindingId/v1":"7669a9266b7d52cf3d2d505d9823cae979c4939ffad05e16af959ef82d6aa211"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(pamelalozano): Get rid of this case once dart-lang/sdk#52908 is solved."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/calculation.dart"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e11903a70c52a0468ef5ab5a4d162e2a5c5c2fb291811a3fcf1ccad3ecaf20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): Use persistent data structures rather than copying here. An \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":"lib/src/value/list.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6a8e28a715bd5ecec715ad4b134dc50f7ea7eec17fddccf9af5aa103db2ceb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): Use persistent data structures rather than copying here. We \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":"lib/src/value/map.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d085634ba845e202da66890304d39e525fc209cbb3ba533a28c2e8a5a0aae8e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dart-lang/language#3160): Remove extra null checks"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/value/number.dart"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4806715cf72fe2d7c914303eeef24766ad70f9265e47dd090ccd0fedab9cc8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): Remove this once dart-lang/collection#289 is released."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/util/map.dart"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e67589279893c315260e853c32a9b8fed43f0231d92f2e9c2a318dcae90daa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dart-lang/sdk/issues/64598) - remove \u0060var _!\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1280dfd10dcb90145af1e39e464a770885dcead42a05dc84490332db2d2355"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dart-lang/sdk/issues/64598) - remove \u0060var _!\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cef0b65efbf76f7f3dae2ee61ac5503e38bc72f68493b01fa44e8bd77d986f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dart-lang/sdk/issues/64598) - remove \u0060var _!\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"296a465bc1a9f5803ffb9f5f3feb29de958de423d9559134fc78a084c8622d34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dart-lang/sdk/issues/64598) - remove \u0060var _!\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b6c9f31aee24c4981f7111ecb4be4dfb5185930d535fdbd4a999b44bcedc6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dart-lang/sdk#52756): Use patterns to null-check these values."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":2440}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5e830fd5d0ccfc404b39cfb2028a901531344f8a00fb5cd9cca534a97beab7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dart-lang/sdk#52757): Make this a separate case."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/parse/stylesheet.dart"},"region":{"startLine":3104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecbf9b48483989da15b28183b635e9cd5f08b73e9102c461f2c0c9b90dbb80d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): Remove this ignore and add an explicit type argument once we \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":"lib/src/js/legacy/value.dart"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a7d9925c060d902b54794a3390e56207f01f06196fd2372ef8fbbcde51dca3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): explicitly decode the bytes as UTF-8 like we do in the VM when"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/io/js.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edf06b6ef018deccc061fc2ee15bb0f2393153a445ca246eea280dff0ca238c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): I think there may be a way to get perfect trimming without \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":"lib/src/extend/extension_store.dart"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c97334f25b8097f074a10e825d62201a2cbdf10ae23893fe3b2bd66833e7a1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): There\u0027s got to be a way to do this without a bunch of extra \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":"lib/src/extend/functions.dart"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"c296238782e5a47dc9c16056370c4156a20a90689dc1cd4298c238ce4b0d1215"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): Don\u0027t explicitly use a type parameter when dart-lang/sdk#25490"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/executable/compile_stylesheet.dart"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b108265f487c6ce21a92bd0733f13a08b61b36ef47c8aa0f48135e1c8807c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(sass/sass#4252) - Remove this once \u0060Deprecation.forVersion()\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/executable/options.dart"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e451bb59a1230f69ef9cc65f76cb0a07a5f15a485877e589b0dd31247c2df2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nweiz): Make this a [Url] when dart-lang/sdk#32490 is fixed, or when"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/ast/sass/import/dynamic.dart"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"980fd90c0f55756e93a2c901c73a0438bf67daa3cc3f028d8572fe6fb89b794d"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to make analysis work. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/ast/sass/expression/binary_operation.dart"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efc5ba590f1a6b246fd76481a004fb369fef645910377fa1464b98f960b44e2"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060sass-types\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060pkg/sass-types/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-types/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80157c066d1c50c9125bbda124261dc7c3a08e56434a0470bf7955ea111e9f50"}},{"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":"D21","level":"note","message":{"text":"\u0060toJsonField\u0060 spells \u0060Json\u0060 where 208 names in the project spell it \u0060JSON\u0060: 208 of 209 names in project sass spell the token \u0060JSON\u0060 (208 of 209; unit: names in project sass containing \u0060JSON\u0060). Peers: ArgumentList.toJSON (pkg/sass-parser/lib/src/argument-list.ts:128); ArgumentList.toJSON (pkg/sass-parser/lib/src/argument-list.ts:130); ArgumentList.toJSON (pkg/sass-parser/lib/src/argument-list.ts:131); Argument.toJSON (pkg/sass-parser/lib/src/argument.ts:171); Argument.toJSON (pkg/sass-parser/lib/src/argument.ts:173). Rename to \u0060toJSONField\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/utils.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"941e653db639c181dd1e63b60299c70559a6a430c7855d8958328d0f3a16855e"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 2 of 3 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (52399 LoC, 366 module-visible types across 35 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c6e781e3d283305d66359da9958b8e2409e6029e97be4b035467a1c5a0f7540"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"974fca984ee6c3627efcc59a279005e0270bdfa94bb8c3557e59848669b0521d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"38431bea619055cbd46ac8e3f4294d8d2e9d9c311a514e7f1ac00a5d00f6540d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0dbb915274563a1a1c7710b67a8c19d2a107f22fcaf0daddfce999f66be50e9d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1e0f2f867b4d97069f6832d7fa56984497ad07167d4f5cf2818df73e0f2e571"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6ef2f316ca631b692d03c475bed7e473e93f3db6fa35d9ef86248c50808e234"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c802ec97e672feaa32f710e6686a62b890e325cf5a04a8fb4136422a8a2ef74"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e511d4aa9f4a8e0648920c4027b41b4a7f5a87483dd4c27f4e6d8c7005a5b11d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0c9b44ff1a7ba4933d3bcbabee2db51350f5cf83c9dd504f69735e26aea1355"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e83d38ae5efa171285928bfffce7b0279ea99589e5732d8cf4bf813f752a5c31"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9314c288d245f727a3b8b966ff4a9ae65804a3af50a131f86dca4675b067c33"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"56561c55daa3f118c076529d1dfe46c86cb4c3d1358fb47357bd471a1bff6031"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c89505c0937513477529cf32c6ff1e6c72a44033402514100e971434da2e5e3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"762fd10125e3f763c0d655fc0bfcde13af3d9e1afdef407186d2cd14cb643247"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"16f681279111693d3aac628be09bc3f45113a2f19aab0d289fa2e6368a50ed11"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51868f1ae25833a34c2e843cf9c0f7075e935be17d7d983ed2edf4b07531cfe5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f79d09e9fb5e5a92da025269a17b0f5f3975e290e2ca74766ce372e93ffed832"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e7c575500ba865b50d2fd1fec6c91c6ebb3104cfe9dd863dc48ad125cf743fa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0acb2d2d669c815bc7f021c924e65718529f7bf27231213c56293a5a5456ca9b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09350e130536910be60307a5aef6a5a8fe5ee0c0865dbdcffc4171a374b71674"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53fbba340449fdcc8ccb48dd3a1531495f8da2b3d933fd91837a6538028f2056"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2cbccc0f3c877762e7049ff234c0ef79383b0dee6bfe4af7fc7d063f0cd6341c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0260d4dce196ad9befcc56730b31fe5700b132ffba7f5536303e8fe7aa3eeec0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04799d0f344432a500572e4970294a4ca6c15e9921b53585e97bee6059586479"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c14d1831b2c0d6ed3b0a34057bf911782c5436ecde09c98455c6f5994a4cb1c4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be9d8cdb9824ef5c2eb8f0c7c05e7fb3bfc0be54d98190e4c8bc19b59fa51ace"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e46e0d1416f1aa59cce4bbc9de0bb9d4dbf449db825c4d7ad2df5d9e86c0bb6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d2cde871ff4dda3ab0459bb4cf928addf815cec0cfd3a3fb0a43b0cd06fc887"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e16cac1048ddb61639317bc89683594f96fcc5cafa3ce9f3ee8e768bcaaacbfa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"926599882751bd146e9b0beaa0b9e48c74cc2e8e6234ea45f31a6663227c8fe3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 225 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; 225 of the 469 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: pkg/sass-parser/lib/src/expression/number.ts. 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":"pkg/sass-parser/lib/src/expression/number.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"914ad5a869e580694f10fa24e43880a347a143ece6e9cc8ae8e29fd9f505cb3a"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060visitSupportsCondition\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":"lib/src/visitor/find_dependencies.dart"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89c53ff3e02d5f1105293c2e871e5a9fcb1a818ed31ca9725686be9658e7b60"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cli/shared.dart"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1756dd6b07cbf6e085d158c86701000584be1b622dd64919fca0d084a101083"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cli/shared/deprecations.dart"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f2051979b4822993ac6e47281230905eb7e904873896e3aa266c0c980273d1"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cli/shared/deprecations.dart"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2722c580eadb6d732de3431dd04f5ab4f0c4a8cef5e891462771bce4db13a3"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cli/shared/deprecations.dart"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32dfe7d1a6e3ccc9d8b6c30e4bca851684954b88c67a07ae94c836496ff27cc"}},{"ruleId":"IC1","level":"note","message":{"text":"Disabled test: A test is skipped/ignored \u2014 coverage that looks present but never runs. Re-enable it or delete it so the green run means something."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cli/shared/deprecations.dart"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"3482606512d1b6048dbe466f4e732662c79b98c4757708ba52ede55e0fd51ac8"}},{"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":"M4","level":"note","message":{"text":"README/code drift: lib/src/README.md links to \u0060js/value/README.md\u0060, but \u0060lib/src/js/value/README.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/README.md"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9563c1c9aefc1246195c61c96f3266e24975c7c7020df1d1dbec918c02d4e2f4"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: lib/src/README.md links to \u0060embedded/value.dart\u0060, but \u0060lib/src/embedded/value.dart\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/README.md"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8083510fef151fa0550dc3ba1bc77d36a7bd07ece6f56b69ce555ef21e2b450"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add the Dart analyzer\u0027s security lints plus \u0060semgrep --config=auto\u0060 as a CI step. What was searched, so you can tell an absence from a miss: the 8 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 3 sibling directories (24 clone groups): 24 duplicated blocks under pkg/sass-parser/lib/src/ have copies in at least two of the sibling directories expression, selector, statement \u2014 17 of them are reported below, and 7 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 24 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 24 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 24 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/list.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc8dee69e3dac0f3cf9dcd3c95cc279c7c546ffea77d8ce93697f0eeed0b549"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (206 matched lines \u00D7 2 locations): pkg/sass-parser/lib/src/argument-list.ts:21 \u00B7 pkg/sass-parser/lib/src/parameter-list.ts:20 \u2014 the two spans are one implementation copied and then locally edited \u2014 1396 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/argument-list.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1079aa4d1b463c5c13d9d0a3462a53f33d7adef45109e3d741ef31cc3a59e1ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (181 matched lines \u00D7 2 locations): pkg/sass-parser/lib/src/selector/complex.ts:99 \u00B7 pkg/sass-parser/lib/src/selector/list.ts:80 \u2014 the two spans are one implementation copied and then locally edited \u2014 1228 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/complex.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d534320eaf006c7b8e662afee1de66042f8747f2f209c896002c6916a3ec61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (154 matched lines \u00D7 2 locations): pkg/sass-parser/lib/src/selector/compound.ts:23 \u00B7 pkg/sass-parser/lib/src/selector/list.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 1012 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/compound.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0d0da7cfc6c64f3cec26c70bcdb23dc5be04626b394250803b5545f431db04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (132 matched lines \u00D7 2 locations): pkg/sass-parser/lib/src/import-list.ts:75 \u00B7 pkg/sass-parser/lib/src/interpolation.ts:98 \u2014 the two spans are one implementation copied and then locally edited \u2014 934 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/import-list.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7b07b7f9f630a2395726988cff1c8449ae46334d40ad5d6398701389bc363a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (117 matched lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/list.ts:168 \u00B7 pkg/sass-parser/lib/src/selector/complex.ts:157 \u2014 the two spans are one implementation copied and then locally edited \u2014 800 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/list.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"457c63f95ab8f9ea532e3a991a5aeae36359f8b52003b190449420e1bbe56ff8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (113 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/if.ts:119 \u00B7 pkg/sass-parser/lib/src/expression/map.ts:103 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddf8e6d9468c548430c3018bd06549c7dcbc6554d28f776eee683f028a7b907"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (111 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/if-condition-expression/operation.ts:126 \u00B7 pkg/sass-parser/lib/src/selector/list.ts:132 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-condition-expression/operation.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b496ce6b1d0d8ce71aaaa6f40ece39862f1b98d643c81b832e9d8c4ad2a51c0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (68 lines \u00D7 2 locations): pkg/sass-parser/lib/src/statement/function-rule.ts:31 \u00B7 pkg/sass-parser/lib/src/statement/mixin-rule.ts:31 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/function-rule.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c145b4391d0f55bcba87baf73d2af49f6fe4dc4e95962ecb51bc1eabd57b78a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (62 matched lines \u00D7 2 locations): pkg/sass-parser/lib/src/argument.ts:20 \u00B7 pkg/sass-parser/lib/src/parameter.ts:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 396 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/argument.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb54fd7e8f6842096750e9d763b239dcc990589851e57e0c3358f04a59ca560"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (51 matched lines \u00D7 2 locations): pkg/sass-parser/lib/src/selector/attribute.ts:153 \u00B7 pkg/sass-parser/lib/src/selector/pseudo.ts:154 \u2014 the two spans are one implementation copied and then locally edited \u2014 367 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/attribute.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a63e54227d23e56e4d9a807813ad42440fb45a2794c62ba9e08fde2b998804e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/if-condition-expression/negation.ts:39 \u00B7 pkg/sass-parser/lib/src/expression/if-condition-expression/parenthesized.ts:39 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-condition-expression/negation.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1861df5e055f4528306c31a56f62689a0ff04ab51b3534969a8b57e373ccbadb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2 locations): pkg/sass-parser/lib/src/statement/if-rule.ts:32 \u00B7 pkg/sass-parser/lib/src/statement/while-rule.ts:32 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/if-rule.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89f22a094f21aac3e1c808160d8961ebd808a498805eeac704f6565ef10e942"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/if.ts:22 \u00B7 pkg/sass-parser/lib/src/expression/map.ts:21 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"77da480b661fd7c43282c3097d923d2d237d796c33a720b17f5492de0204ddfc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (38 matched lines \u00D7 2 locations): pkg/sass-parser/lib/src/statement/declaration.ts:64 \u00B7 pkg/sass-parser/lib/src/statement/generic-at-rule.ts:41 \u2014 the two spans are one implementation copied and then locally edited \u2014 219 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/declaration.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc636d09bb110f842a7f9733d5d22d6d419f3266f85d8ba5954edb1afb5b8d1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): pkg/sass-parser/lib/src/interpolation.ts:168 \u00B7 pkg/sass-parser/lib/src/parameter-list.ts:108 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/interpolation.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbc5c98c71ecca6579ba468acf74bb17a2a53e37ea510a015ef8f3abd21ada8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): pkg/sass-parser/lib/src/selector/id.ts:20 \u00B7 pkg/sass-parser/lib/src/selector/placeholder.ts:20 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/id.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"644d30471e48a3cd610cbb952790e7e30666974e1ab563d72e9e89e2943c1db0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 4 locations): pkg/sass-parser/lib/src/statement/debug-rule.ts:24 \u00B7 pkg/sass-parser/lib/src/statement/error-rule.ts:24 \u00B7 pkg/sass-parser/lib/src/statement/return-rule.ts:24 \u00B7 pkg/sass-parser/lib/src/statement/warn-rule.ts:24 \u2014 the 4 copies are spread across 4 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/debug-rule.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22786f589fef0ed482025cddc5669a5a9b1284d583e4c31301ae5a3ff3d323c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): pkg/sass-parser/lib/src/statement/forward-rule.ts:207 \u00B7 pkg/sass-parser/lib/src/statement/use-rule.ts:129 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/forward-rule.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"50202f53c2be1d82794bc0d12cd12274f1a503bba83c8084b3b9cfa6934d6a38"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/list.ts:355 \u00B7 pkg/sass-parser/lib/src/selector/compound.ts:253 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/list.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe29fdfb6af57b11fb7dcbe1fdd801c65b28a6952cc5421115d273fef782b382"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): pkg/sass-parser/lib/src/selector/parent.ts:43 \u00B7 pkg/sass-parser/lib/src/selector/universal.ts:43 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/parent.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c126a6f81b891093389158431b256dd44f2a5128a35cb145771b69381ad3a0f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3 locations): pkg/sass-parser/lib/src/selector/class.ts:50 \u00B7 pkg/sass-parser/lib/src/selector/id.ts:50 \u00B7 pkg/sass-parser/lib/src/selector/placeholder.ts:49 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/class.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c511dc8df710195bd869c649f2efd56c94d750a2d7e2337f45ce733f16e2a732"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4 locations): pkg/sass-parser/lib/src/statement/debug-rule.ts:82 \u00B7 pkg/sass-parser/lib/src/statement/error-rule.ts:82 \u00B7 pkg/sass-parser/lib/src/statement/return-rule.ts:82 \u00B7 pkg/sass-parser/lib/src/statement/warn-rule.ts:80 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/debug-rule.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41bd7d6fa810fbf2eb813395192207f334980830f63ca1fbd8b6481801a684b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/boolean.ts:48 \u00B7 pkg/sass-parser/lib/src/expression/color.ts:74 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/boolean.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb9b8175272ebcdbed6a543eaf70eb01e81a508ade3ae6dd28f2c76228c0117"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3 locations): pkg/sass-parser/lib/src/expression/if-condition-expression/parenthesized.ts:91 \u00B7 pkg/sass-parser/lib/src/expression/if-condition-expression/sass.ts:86 \u00B7 pkg/sass-parser/lib/src/expression/parenthesized.ts:72 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-condition-expression/parenthesized.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9d315bf41845086ddafbeada3b844bf818597032ef6d4b392ca55bae72d24c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/if-entry.ts:100 \u00B7 pkg/sass-parser/lib/src/expression/map-entry.ts:81 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-entry.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1480a6a27ef0661aae40e86ec34b24f787963b1e016f96fd7835a477c527cba4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/function.ts:85 \u00B7 pkg/sass-parser/lib/src/expression/interpolated-function.ts:55 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/function.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a7c862953e0a4a432b7efff940c3d2aa829b2459ca3080463ccb43631fb0d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): pkg/sass-parser/lib/src/expression/if-condition-expression/operation.ts:294 \u00B7 pkg/sass-parser/lib/src/expression/list.ts:369 \u00B7 pkg/sass-parser/lib/src/selector/compound.ts:267 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-condition-expression/operation.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9b7c66b694351f89d84b7982edce5c263fe85c9ae01455bde95632dbdedbef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): pkg/sass-parser/lib/src/selector/attribute.ts:73 \u00B7 pkg/sass-parser/lib/src/selector/type.ts:40 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/attribute.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a36410207bbaa4ec25b503f4dbae76a37eb7f61a76d549bec10d74cf1178912"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/binary-operation.ts:99 \u00B7 pkg/sass-parser/lib/src/expression/unary-operation.ts:62 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/binary-operation.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7522dac8b96d9a3d094fff15c3307b986fd7c1cfec5d1c5cef60b8fd6f4c77"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): pkg/sass-parser/lib/src/statement/function-rule.ts:137 \u00B7 pkg/sass-parser/lib/src/statement/mixin-rule.ts:137 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/function-rule.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff62fde1f44bc63b3cc22343de9311c5777f88724ab40e15ca8c19f044919055"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/map-entry.ts:69 \u00B7 pkg/sass-parser/lib/src/statement/for-rule.ts:110 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/map-entry.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1894de4467757baed7c67c9389d502aa9fa746b641bb76bea307e83d0a86e276"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): pkg/sass-parser/lib/src/statement/content-rule.ts:55 \u00B7 pkg/sass-parser/lib/src/statement/include-rule.ts:112 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/content-rule.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2107d4aa08567e642650ec233a56c166f8b152a7213dfe9726d2b9ef14f9bf9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/null.ts:54 \u00B7 pkg/sass-parser/lib/src/expression/selector.ts:42 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/null.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44d7019f6a64a62b81e16044a6b9613eb3c7c6c7c1b5253658b48adff7d2697"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): pkg/sass-parser/lib/src/configured-variable.ts:153 \u00B7 pkg/sass-parser/lib/src/parameter.ts:178 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/configured-variable.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"76205f5adffe7fff5cc35ecfbe5102c55aabb5c612d18affa348279eff8ce284"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): pkg/sass-parser/lib/src/statement/forward-rule.ts:331 \u00B7 pkg/sass-parser/lib/src/statement/use-rule.ts:190 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/forward-rule.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3592ea3c346511a469326b198a5230cc9c4a66f0d740afcb39e513080b1ec3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/if-condition-expression/function.ts:90 \u00B7 pkg/sass-parser/lib/src/statement/sass-comment.ts:155 \u2014 the two spans are one implementation copied and then locally edited \u2014 108 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-condition-expression/function.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5fea0e783dbfca89d4d57af8733bebfa2d07474d2d88e4eb4cb327d720b771"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/variable.ts:115 \u00B7 pkg/sass-parser/lib/src/statement/variable-declaration.ts:124 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/variable.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c765fab918c3a32edf06f46d23eff10105ec0646380d2bbe4d9970a4321901"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): pkg/sass-parser/lib/src/statement/if-rule.ts:55 \u00B7 pkg/sass-parser/lib/src/statement/import-rule.ts:63 \u00B7 pkg/sass-parser/lib/src/statement/while-rule.ts:58 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/if-rule.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e540b66c624986295894b54cd5d04582783f042012d7d9eddf54d2ec82b554af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): pkg/sass-parser/lib/src/dynamic-import.ts:79 \u00B7 pkg/sass-parser/lib/src/expression/color.ts:80 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/dynamic-import.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cb9079fddaf9442afc2ed41acc099d2c630540ec44920e35afd865cc732002"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): pkg/sass-parser/lib/src/selector/attribute.ts:106 \u00B7 pkg/sass-parser/lib/src/selector/attribute.ts:132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/attribute.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf299fbcebf08d2068380cc90810b79e2f7c9b43d7d527dae19b2b2a4edcbde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): pkg/sass-parser/lib/src/argument.ts:110 \u00B7 pkg/sass-parser/lib/src/expression/map-entry.ts:69 \u00B7 pkg/sass-parser/lib/src/statement/for-rule.ts:110 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/argument.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b09cf76c499498ac890eb2c41b71c5932db5f52d77391a3c9832e458caf5b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): pkg/sass-parser/lib/src/expression/if-condition-expression/operation.ts:86 \u00B7 pkg/sass-parser/lib/src/expression/list.ts:127 \u00B7 pkg/sass-parser/lib/src/expression/map.ts:75 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-condition-expression/operation.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33ac06b4841e1a37010e75622f8df0e6a424f794fe464814adc246e889b52e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5 locations): pkg/sass-parser/lib/src/expression/parenthesized.ts:54 \u00B7 pkg/sass-parser/lib/src/selector/class.ts:54 \u00B7 pkg/sass-parser/lib/src/selector/id.ts:52 \u00B7 pkg/sass-parser/lib/src/selector/placeholder.ts:53 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/parenthesized.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b5e5183c3897012d59f492771c96fe6ce108db1e5a45abe2e4063f0e86791f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 9 locations): pkg/sass-parser/lib/src/statement/debug-rule.ts:111 \u00B7 pkg/sass-parser/lib/src/statement/each-rule.ts:140 \u00B7 pkg/sass-parser/lib/src/statement/error-rule.ts:111 \u00B7 pkg/sass-parser/lib/src/statement/for-rule.ts:174 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 9 files, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/debug-rule.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b6369b490eeb6c4bdd3e02a23d39bda4362ab9bcd76c8389a348104c58a18f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): pkg/sass-parser/lib/src/statement/declaration.ts:136 \u00B7 pkg/sass-parser/lib/src/statement/else-rule.ts:91 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/declaration.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d11c464129905c5447fec4afd5e4d021c318632c5d2da422351f7f445416a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4 locations): pkg/sass-parser/lib/src/statement/each-rule.ts:92 \u00B7 pkg/sass-parser/lib/src/statement/for-rule.ts:99 \u00B7 pkg/sass-parser/lib/src/statement/if-rule.ts:65 \u00B7 pkg/sass-parser/lib/src/statement/while-rule.ts:68 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/each-rule.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ce8b1c2ae1784d9784d7414da5948eafa783cbecf9ad6a5fcbfa1040355c66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): pkg/sass-parser/lib/src/argument-list.ts:260 \u00B7 pkg/sass-parser/lib/src/configuration.ts:186 \u00B7 pkg/sass-parser/lib/src/parameter-list.ts:250 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/argument-list.ts"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca85364a0ad929cd2002ecbb107a540ee68e63a759d9a2062cfe8b858b4cfbd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): pkg/sass-parser/lib/src/expression/if.ts:121 \u00B7 pkg/sass-parser/lib/src/expression/map.ts:105 \u00B7 pkg/sass-parser/lib/src/statement/root.ts:56 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ee2ec689da6e8528da1c53e87e0567c48c3934f91861f9112cff74ed0cfc2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): pkg/sass-parser/lib/src/selector/complex-component.ts:84 \u00B7 pkg/sass-parser/lib/src/selector/type.ts:52 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/complex-component.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0c8cdb54a6ad142fccd3d1d53ac4d0009f129750d3f7a82264249fac78cf42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): pkg/sass-parser/lib/src/statement/forward-rule.ts:178 \u00B7 pkg/sass-parser/lib/src/statement/use-rule.ts:108 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/forward-rule.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"837049f50644f0f7072533e08437c8d37aeda98239e558e5fd9a7385bf170d19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): pkg/sass-parser/lib/src/stringifier.ts:190 \u00B7 pkg/sass-parser/lib/src/stringifier.ts:278 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/stringifier.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42e38e9abf515c42c6e955a4af95caed47307474f35b41736bfc721f0221792"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): pkg/sass-parser/lib/src/lazy-source.ts:31 \u00B7 pkg/sass-parser/lib/src/lazy-source.ts:42 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/lazy-source.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5847a1af705ca3315b39f67d8f3eb3dd0a6065759548911c69a90e944323edc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): pkg/sass-parser/lib/src/selector/attribute.ts:169 \u00B7 pkg/sass-parser/lib/src/selector/pseudo.ts:171 \u00B7 pkg/sass-parser/lib/src/static-import.ts:108 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/attribute.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac53c4e86d37bf8c31ace3d068ff2f9b04ba2811cbb5290b7e0a0caace22487"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): pkg/sass-parser/lib/src/selector/pseudo.ts:128 \u00B7 pkg/sass-parser/lib/src/selector/qualified-name.ts:71 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/pseudo.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f40184b564baa98efddef03d529971da5a0acc3fd82bda5a71a67d0840a9c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): pkg/sass-parser/lib/src/argument.ts:143 \u00B7 pkg/sass-parser/lib/src/configured-variable.ts:124 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/argument.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5ff9dadf604a6f6afc803b4ddab395dfd7866a9dec0b574b80f6e430611d51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): pkg/sass-parser/lib/src/configured-variable.ts:106 \u00B7 pkg/sass-parser/lib/src/statement/variable-declaration.ts:110 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/configured-variable.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9ee6842f256ed248350861554663cc132219c6fba5e267ccff3300dd86aac7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): pkg/sass-parser/lib/src/expression/if-condition-expression/raw.ts:59 \u00B7 pkg/sass-parser/lib/src/selector/id.ts:56 \u00B7 pkg/sass-parser/lib/src/selector/placeholder.ts:57 \u00B7 pkg/sass-parser/lib/src/selector/type.ts:59 \u2014 the 4 copies are spread across 4 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-condition-expression/raw.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edff8f567388d9f74056b7f2ec297f271dd678fec33b92a652d8b21aa8f9f37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8 locations): pkg/sass-parser/lib/src/expression/if-condition-expression/sass.ts:63 \u00B7 pkg/sass-parser/lib/src/statement/debug-rule.ts:74 \u00B7 pkg/sass-parser/lib/src/statement/each-rule.ts:103 \u00B7 pkg/sass-parser/lib/src/statement/error-rule.ts:74 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 8 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-condition-expression/sass.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ace572624e7e1bf46006321a02e6f5b3d22e449e839d4f2a34aaa10769bc41a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9 locations): pkg/sass-parser/lib/src/statement/css-comment.ts:74 \u00B7 pkg/sass-parser/lib/src/statement/debug-rule.ts:78 \u00B7 pkg/sass-parser/lib/src/statement/each-rule.ts:105 \u00B7 pkg/sass-parser/lib/src/statement/error-rule.ts:78 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 9 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/css-comment.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7168c7329780f61776a590c0391e0321e68998e35ff5a0724daccbb9ec4e98bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/string.ts:110 \u00B7 pkg/sass-parser/lib/src/statement/generic-at-rule.ts:106 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/string.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"99680555b8695f9068c4dfd27b2121759012ba85c9a91957c9956bfbb74ef7d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6 locations): pkg/sass-parser/lib/src/statement/each-rule.ts:111 \u00B7 pkg/sass-parser/lib/src/statement/for-rule.ts:131 \u00B7 pkg/sass-parser/lib/src/statement/function-rule.ts:108 \u00B7 pkg/sass-parser/lib/src/statement/if-rule.ts:84 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/each-rule.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2820bba63ec1f58c08e964524d3223b23cd19801e0cb2f5e5bb81fdf361b458d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): pkg/sass-parser/lib/src/statement/forward-rule.ts:320 \u00B7 pkg/sass-parser/lib/src/statement/use-rule.ts:179 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/forward-rule.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40cb1d3a7dde8519b0999c504fd2ca52a7ff80e71ab3b6c6252705d6bc37fe4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 17 locations): pkg/sass-parser/lib/src/expression/boolean.ts:50 \u00B7 pkg/sass-parser/lib/src/expression/color.ts:76 \u00B7 pkg/sass-parser/lib/src/expression/function.ts:104 \u00B7 pkg/sass-parser/lib/src/expression/if-condition-expression/function.ts:79 \u00B7 \u002B13 more site(s) not listed \u2014 the 17 copies are spread across 17 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/boolean.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f4b84aecc4cae2aad42fa760b8962ef01a9e9b80d980deeafbc3345ced1a65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): pkg/sass-parser/lib/src/expression/interpolated-function.ts:84 \u00B7 pkg/sass-parser/lib/src/selector/qualified-name.ts:106 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/interpolated-function.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f833707c0ad9913e089a508f5a4f4ceaac82a97eca9d64e2a27d815dfe719a15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7 locations): pkg/sass-parser/lib/src/selector/attribute.ts:182 \u00B7 pkg/sass-parser/lib/src/selector/complex-component.ts:114 \u00B7 pkg/sass-parser/lib/src/selector/parent.ts:85 \u00B7 pkg/sass-parser/lib/src/selector/universal.ts:78 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 7 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/attribute.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fe05461c1333f482c99f6d1516ee8378bf80a6d29e206c3a370576cba5aeae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10 locations): pkg/sass-parser/lib/src/selector/pseudo.ts:189 \u00B7 pkg/sass-parser/lib/src/statement/css-comment.ts:136 \u00B7 pkg/sass-parser/lib/src/statement/debug-rule.ts:101 \u00B7 pkg/sass-parser/lib/src/statement/declaration.ts:211 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 10 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/pseudo.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5d228d898bd89988b5ecee5d05a17b245675694342e605bb0255f70126e2eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8 locations): pkg/sass-parser/lib/src/statement/content-rule.ts:90 \u00B7 pkg/sass-parser/lib/src/statement/css-comment.ts:80 \u00B7 pkg/sass-parser/lib/src/statement/debug-rule.ts:84 \u00B7 pkg/sass-parser/lib/src/statement/error-rule.ts:84 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 8 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/content-rule.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f993583ccee89595f962c6e0845cfa909c2d7abea2c8ed76ebe325bc6605a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4 locations): pkg/sass-parser/lib/src/import-list.ts:101 \u00B7 pkg/sass-parser/lib/src/selector/complex.ts:117 \u00B7 pkg/sass-parser/lib/src/selector/compound.ts:91 \u00B7 pkg/sass-parser/lib/src/selector/list.ts:98 \u2014 the 4 copies are spread across 4 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/import-list.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6edd73dfec8155d1683055416632109d29a010da3270f20cd0467c762a4c3b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: pkg/sass-parser/lib/src/postcss.js:5 imports postcss/lib/symbols, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/postcss.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e8e87df9ddd82428d3f2ae9694eeeb33650f0b2c4142f1def67bd76b251e9b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: pkg/sass-parser/lib/src/statement/declaration-internal.d.ts:6 imports postcss/lib/container, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/declaration-internal.d.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"163fc92ad7c3c74a47db5df9936d876dd273b6601a3a8b4245c9c2523e056d34"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: pkg/sass-parser/lib/src/statement/index.ts:6 imports postcss/lib/container, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/index.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d60b9c4b1beed5b6ab6bc903d07500c6a130e42b87defb0d27085d2855dcad"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: pkg/sass-parser/lib/src/stringifier.ts:53 imports postcss/lib/stringifier, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/stringifier.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"171d9c97ea5f1ed4845ebca8c0942b0d4cfce49d8bc8725623c9ee3afae936a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #escapeQuoted (cyclomatic 41, cognitive 10): #escapeQuoted has cyclomatic complexity 41 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/string.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eec09373c73e81c6a23a285684f61eff3572152249fa642da6d2f46d38d0f88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalize (cyclomatic 39, cognitive 45): normalize has cyclomatic complexity 39 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/index.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"621e033d96edc7c8fb527eafe7cb00b4bf04c04f8b3718e7284c31c4d0bea6c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 20, cognitive 24): (top-level) has cyclomatic complexity 20 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/include-rule.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b93ad6c21cddd9763ffe3426f39687785244bfdb83acb1780a5b07cf42ad0a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 19, cognitive 27): (top-level) has cyclomatic complexity 19 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/generic-at-rule.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0036d2777337037e23316f7b349e414147e2a355bf0e2426a96e11e3374131b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toHaveNode (cyclomatic 17, cognitive 16): toHaveNode has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/test/setup.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7f4e1a7787a3ce7cb650e35a19976064895ef804cc2c699519a66ed431f016"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function serialize (cyclomatic 16, cognitive 26): serialize has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/test/setup.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9003f8161212f3d1ea6d1dff236e47f192edb7c1ac0edfbab031ebadd7b6ba0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromProps (cyclomatic 15, cognitive 20): fromProps has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/from-props.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe6237f292a15363335490c4704f9e6021d52e795940944a3b5cd7812bce16d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 14, cognitive 15): (top-level) has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/use-rule.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"716dfe74dabd93fe5fa64c52702725aef6980a0bc594f2ff70e95dc898fc7056"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromProps (cyclomatic 14, cognitive 12): fromProps has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-condition-expression/from-props.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6542591217825688e3dfdbad17d282621ea91d623859f85d35f2d9a0cfe77c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function atrule (cyclomatic 13, cognitive 10): atrule has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/stringifier.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab83c59df69ffbe06bd7ca6aa08905cf10cbed5c5ecbc75fe86f83d534808a1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 12, cognitive 14): (top-level) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/declaration.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da2af2bcc78856b64dd6a5d4d9c379ee792f3c9358ef774e4fb733afe9e1e9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toString (cyclomatic 12, cognitive 12): toString has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/pseudo.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f6696ad69b7edf01b9d5b588f3d087b11f40abcfb2a94dfeebb0a31954a8ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toHaveStringExpression (cyclomatic 12, cognitive 11): toHaveStringExpression has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/test/setup.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7252e788fbcae2200d0c393164f88847c14a5158f9a2ac36290beb23037ccb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 23): (top-level) has cyclomatic complexity 11 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/css-comment.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d093829e12b3d9491785c50d6c0144ac35fe993721c6f33503bb95856e219382"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cloneNode (cyclomatic 11, cognitive 21): cloneNode has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/utils.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a9c3dc74920086703a4618b14e97d8b34d4981dbbdca7c5ffe17ab6b613a16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decl (cyclomatic 11, cognitive 16): decl has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/stringifier.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"660faa60e1e6769633f07b13851bef07712cae9b2fcbcab92aa02152fd02834b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 11): (top-level) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/for-rule.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a69fbf0d159dacf90244b196e02d9d71812b26501d441dd94d0dc5a4389a8e4"}},{"ruleId":"R3","level":"warning","message":{"text":"pkg/sass-parser/lib/src/sass-internal.ts: 552 lines of code: pkg/sass-parser/lib/src/sass-internal.ts has 552 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/sass-internal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"322fe000fb1383ec6cdd04dcd2d251472ddc186a073a38c0a6b53b46af52eaae"}},{"ruleId":"R3","level":"warning","message":{"text":"pkg/sass-parser/lib/index.ts: 419 lines of code: pkg/sass-parser/lib/index.ts has 419 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d2903b2a0ef4905cd13fa3bc06ed4bf7f0055e857271decaba007edf18cae2"}},{"ruleId":"R3","level":"warning","message":{"text":"pkg/sass-parser/lib/src/statement/index.ts: 412 lines of code: pkg/sass-parser/lib/src/statement/index.ts has 412 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/statement/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0888e6e4874949ba953ecb9fe6573e9fd3ebd3e72e7bc1b62165ae24f1af1e29"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createSourceFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/sass-internal.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e71cddcf0febf4a56e41053e584b85b250fbdc0b6fc4c4425ab5e71f272180"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027parseSelectorList\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/sass-internal.ts"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a03fbceb1a8099e043a5d2f6f72b3b1857a276abdb80267bee6870baee348f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027_fakePropertyToMakeStatementVisitorAUniqueType\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/sass-internal.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"77940b0854c61f6c4e13c971f795e95d3f23a599c29a3433099a679984cc70a6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027_fakePropertyToMakeExpressionVisitorAUniqueType\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/sass-internal.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba04d01a0496ab61984e7f5a72f22dab535d771ae4f5d5ff1b3f38a56be4e40d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027_fakePropertyToMakeIfConditionExpressionVisitorAUniqueType\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/sass-internal.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6291fbea5d35ab002d017ef92be75c64e3fedee867d06ec1c21bd4777ad5ccce"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027_fakePropertyToMakeSimpleSelectorVisitorAUniqueType\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/sass-internal.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c3521e2571fafd1a785af2f0c2b4a9ad41e394c99eebf2bfb5d6df6fa4d573"}},{"ruleId":"R8","level":"warning","message":{"text":"Unlisted import \u0027pretty-format\u0027: Imported only as a TYPE and declared in no reachable package.json. The import is erased at compile time, so nothing is installed and no runtime resolution depends on it \u2014 but type-checking a clean clone will fail. Declare the typings it resolves through (or the package itself) in the owning package.json."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/test/setup.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"64615870ac6c215be5e145b6daebaca3dd4ebb0f9f0f09e5ccfe9524cae26f06"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@parcel/watcher\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1c0c8f9ff357be9de7f5dcc0a95b1e3fc6e8327a95e2dac559af0a4e6427d8d8"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027chokidar\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"02ddd518617eb764a6409dada9469877141daa407257bf6b03ce13e13db3b3cd"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027immutable\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"26e572a378bd48d92267eb7cd4452be7e86fcbf32b972147c1d8c0a282f70a7f"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): pkg/sass-parser/lib/src/configuration.ts \u2192 pkg/sass-parser/lib/src/configured-variable.ts \u2192 pkg/sass-parser/lib/src/configuration.ts (one verified cycle inside a mutually-dependent group of 31 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/configuration.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f1a25f1a8424b45535e1384b2154d9e8b0e0d7e438c69e6fbc818ec722f9b3"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): pkg/sass-parser/lib/src/argument-list.ts \u2192 pkg/sass-parser/lib/src/argument.ts \u2192 pkg/sass-parser/lib/src/argument-list.ts (one verified cycle inside a mutually-dependent group of 32 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/argument-list.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"143a58e8d98363102779befb937d3dc2ff5fd3f9a1e0d3353a23891a9c8b5976"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): pkg/sass-parser/lib/src/parameter-list.ts \u2192 pkg/sass-parser/lib/src/parameter.ts \u2192 pkg/sass-parser/lib/src/parameter-list.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/parameter-list.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f728efec5f9369ff6d98f359d00efb38635c9d9bf28fb262c5682bc63d4294"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): pkg/sass-parser/lib/src/selector/complex-component.ts \u2192 pkg/sass-parser/lib/src/selector/complex.ts \u2192 pkg/sass-parser/lib/src/selector/complex-component.ts (one verified cycle inside a mutually-dependent group of 7 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/complex-component.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe44076ba95a6c3b861e4ed8048c73ea027dd0261bf9062223c3f72f438dd14"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd699919aa591b262d8f4a07a70eed2e90d52ddb856cc6e42aa98540126b06b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: package/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package/package.json"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e87588cd03e987eec3a995990f7b363abdde77c005bd4f3111760815ffe02ab"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: pkg/sass-parser/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/package.json"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53586e853c906ff5a6e20df6fa78cc3078b11caf0721adc096a66cd6efc6cf4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!scanner.isDone \u0026\u0026 !scanner.peekChar().isNewline\u0060 appears character-identically in 2 files \u2014 lib/src/parse/parser.dart, lib/src/parse/sass.dart. 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":"lib/src/parse/parser.dart"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af522c08272b5de868735c4ce73fda480f8f85be6bb2c556093add5e5511002"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060VariableDeclaration() || FunctionRule() || MixinRule()\u0060 appears character-identically in 2 files \u2014 lib/src/ast/sass/statement/if_rule.dart, lib/src/ast/sass/statement/parent.dart. 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":"lib/src/ast/sass/statement/if_rule.dart"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a01f659ac49acc63c7828396053794551b41ec3c9964526c5376768e6f4f0bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_compileContext != null \u0026\u0026 _compileContext != compileContext\u0060 appears character-identically in 3 files \u2014 lib/src/value/function.dart, lib/src/value/mixin.dart, lib/src/value/module.dart. 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":"lib/src/value/function.dart"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d317dc0a3c7172172cbfb9dfa395a76775cfe3a9ffe3a30fe46b257472450eb4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060deprecation != null \u0026\u0026 deprecation != .userAuthored\u0060 appears character-identically in 2 files \u2014 lib/src/embedded/logger.dart, lib/src/logger/stderr.dart. 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":"lib/src/embedded/logger.dart"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bca488a688adf76b751d61ba339898a2e3836a787c73cd9584f65e1a51cdd97"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060newNumerators.length == 1 \u0026\u0026 newDenominators.isEmpty\u0060 appears character-identically in 2 files \u2014 lib/src/value/number.dart, lib/src/value/number/single_unit.dart. 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":"lib/src/value/number.dart"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd5120ce1f5c469080fc27410a82f01e1d0fa1175fd5937c2a367020029b1d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060other is PseudoSelector \u0026\u0026 (other.isHost || other.isHostContext)\u0060 appears character-identically in 2 files \u2014 lib/src/ast/selector/pseudo.dart, lib/src/ast/selector/simple.dart. 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":"lib/src/ast/selector/pseudo.dart"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ba44df39834728f594987dbf8f3002be944557744768b206201dbfc69969da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(defaults) \u0026\u0026 \u0027nodes\u0027 in defaults \u0026\u0026 !(\u0027sassType\u0027 in defaults)\u0060 appears character-identically in 2 files \u2014 pkg/sass-parser/lib/src/selector/complex.ts, pkg/sass-parser/lib/src/selector/list.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/complex.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1a1d85bdca4f428054c119e728d6ddb2a1558a1e68119e63df255cd497194f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nodes.length === 2 \u0026\u0026 typeof nodes[0] === \u0027string\u0027 \u0026\u0026 typeof nodes[1] === \u0027object\u0027 \u0026\u0026 !(\u0027name\u0027 in nodes[1])\u0060 appears character-identically in 2 files \u2014 pkg/sass-parser/lib/src/argument-list.ts, pkg/sass-parser/lib/src/parameter-list.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/argument-list.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee7d9c0bc605d68047f4b477acc2cd09da832d6990394991a675811f4e61009"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof argument === \u0027object\u0027 \u0026\u0026 \u0027sassType\u0027 in argument\u0060 appears character-identically in 2 files \u2014 pkg/sass-parser/lib/src/expression/if-condition-expression/function.ts, pkg/sass-parser/lib/src/selector/pseudo.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-condition-expression/function.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd09acbef881149b548ade47da641b280a460ad2ad5c3b60bb92e324b3a8228"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof name === \u0027object\u0027 \u0026\u0026 \u0027sassType\u0027 in name\u0060 appears character-identically in 2 files \u2014 pkg/sass-parser/lib/src/expression/if-condition-expression/function.ts, pkg/sass-parser/lib/src/expression/interpolated-function.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/expression/if-condition-expression/function.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80a6d4d8246c437c6276eba298917e9e4c66073d88d2c7093233070789eec7f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof node === \u0027object\u0027 \u0026\u0026 \u0027sassType\u0027 in node\u0060 appears character-identically in 2 files \u2014 pkg/sass-parser/lib/src/import-list.ts, pkg/sass-parser/lib/src/parameter-list.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/import-list.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede9629876dc367983781e9b967639a68d4acc767aabcb143722912596733a25"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027object\u0027 \u0026\u0026 \u0027sassType\u0027 in value\u0060 appears character-identically in 2 files \u2014 pkg/sass-parser/lib/src/selector/attribute.ts, pkg/sass-parser/lib/src/selector/qualified-name.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pkg/sass-parser/lib/src/selector/attribute.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7d9a7e9c575ede4dc5fb54f9840c46c3fcc951b139f61276ac13fd032a0ffb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parseDeprecationSelector\u0060 is public and takes \u0060Object ? selectors\u0060 from its caller, and it calls itself at line 108 (\u0060parseDeprecationSelector\u0060) with a piece of \u0060selectors\u0060 (and at line 121) \u2014 and nowhere in \u0060parseDeprecationSelector\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. \u0060jsonDecode\u0060 sets no nesting limit: 2 MB of brackets parse to a million levels, while a walk like this one throws \u0060StackOverflowError\u0060 from about 20,000 levels \u2014 40,000 bytes (Dart 3.13 VM; on the web the limit is the browser\u0027s stack). That is an \u0060Error\u0060, not an \u0060Exception\u0060: an \u0060on Exception catch\u0060 around the call does not stop it, so the request, the frame or the isolate fails with it. Thread a depth argument through \u0060parseDeprecationSelector\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"lib/src/js/deprecations.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cb30842f3a3855f5d2a14e71e1d42ebc345d2b4a948cb8b67c6eeefa1d3633"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (_)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, 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":"lib/src/stylesheet_graph.dart"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"23323347d8e1fb047a386b539d568718074397df6cb7b5b2c102508c533f9349"}}],"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-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":32,"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."]}]}