{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"]}},{"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"]}],"properties":{"cwe":["CWE-506"]}},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"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":"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":"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":"parser.Parser (cyclomatic 606): parser.Parser has cyclomatic complexity 606 (threshold 15). Of this number, 151 points are the body\u0027s own statements and 455 belong to 75 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0715bcb8b0d0631067212a04154f1c8b6f9d558e61d6ac283c570197b41d9e"}},{"ruleId":"D1","level":"warning","message":{"text":"parser-input.default (cyclomatic 80): parser-input.default has cyclomatic complexity 80 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 51 belong to 11 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser-input.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ffdfea19ab9b372da9443efd33e35d7ae9b6522fde1b35b0e547fcc04c2c75"}},{"ruleId":"D1","level":"warning","message":{"text":"Import.doEval (cyclomatic 50): Import.doEval has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/import.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e86688e9fd134b621e6580dc4c66e32dffc6ac5efdf5134aafac4655f945486"}},{"ruleId":"D1","level":"warning","message":{"text":"Ruleset.eval (cyclomatic 46): Ruleset.eval has cyclomatic complexity 46 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c709508b3579820e5478c85196773f8301d9d08090cbf6263e7682851096a4cb"}},{"ruleId":"D1","level":"warning","message":{"text":"MixinCall.eval (cyclomatic 40): MixinCall.eval has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/mixin-call.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9b06ffa8904e2b7a3171712bde641a3b6bc70d418c7d57cb4da85d813f03fa"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::args (cyclomatic 40): Parser::args has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"863eb6a950e622e987914c69dfd8519e0b96d3f9fb6f347a78ec123e41287e99"}},{"ruleId":"D1","level":"warning","message":{"text":"bump-and-publish.main (cyclomatic 39): bump-and-publish.main 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":"scripts/bump-and-publish.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc142057d255d738bdfa0151b53e7c15aa15404f5730cc114bd72807bc68e2bd"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::mediaFeature (cyclomatic 39): Parser::mediaFeature has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f09650e5cea41389be6ddaaf4050f832459acdaf15c953be900cf77b5122c1"}},{"ruleId":"D1","level":"warning","message":{"text":"Ruleset.joinSelector (cyclomatic 38): Ruleset.joinSelector has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01d433c06eb84a0df4cf3316d08e0d78bf564920f3c01d2399be67637c0cff5"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::atrule (cyclomatic 37): Parser::atrule has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5398af705f64b8507279685c5f82da22e4d4dde4fe383d223dce35e1ae6d72"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 36): (anonymous) has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 3 of the 36 points are its own statements and the rest belongs to 21 function items inside it that branch (loadStyleSheet::loadInitialFileCallback, registerStylesheetsImmediately, refresh::(anonymous)::(anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/index.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaadb29e066fa5912b3515232a09795333c6d8b66686ae21ac6e3854dc9e8eaa"}},{"ruleId":"D1","level":"warning","message":{"text":"index.default (cyclomatic 35): index.default has cyclomatic complexity 35 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 14 belong to 9 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/index.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4ca0768fc279daf53f61938c908684d4598ffa343e23addd3a3bb5da8dc005"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::$parseUntil (cyclomatic 34): (anonymous)::$parseUntil 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":"packages/less/lib/less/parser/parser-input.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b0fc6270ca9c3e7d13913e6c156d79ef81edf1c5e3b71aa8483f9a8d5e90fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Ruleset.genCSS (cyclomatic 32): Ruleset.genCSS has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebaa71ac17a07faf5034d4801f41fb959a3d8e8ca89b510b595752575076a95"}},{"ruleId":"D1","level":"warning","message":{"text":"error-reporting.default (cyclomatic 32): error-reporting.default has cyclomatic complexity 32 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/error-reporting.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f585924bc9de9315db02c399da2b9f6be1f60166231ac88b3c329cac32399bf8"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 32): (anonymous) has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 1 of the 32 points is its own statement and the rest belongs to 9 function items inside it that branch (errorHTML, errorConsole, removeError, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/error-reporting.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aceb4c1bcd18366e533ea88c0b2d7a2206dbd907923a827bcfe39fde8c5c35"}},{"ruleId":"D1","level":"warning","message":{"text":"source-map-output.default (cyclomatic 31): source-map-output.default has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/source-map-output.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"770be8ed595705e85ec041b38cc0b5cd85175947d5dae11f03e1865330245656"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 31): (anonymous) has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to 6 function items inside it that branch (add, toCSS, constructor, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/source-map-output.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"359278bfbd0850c627869e6256bf0377ea9d42c1ea8a32a6924728d0eb50596e"}},{"ruleId":"D1","level":"warning","message":{"text":"number.minMax (cyclomatic 30): number.minMax 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":"packages/less/lib/less/functions/number.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d284458d03fcaa166ecb16a0007cd1f7745023cb1ce67c26a97831bd56e21d5"}},{"ruleId":"D1","level":"warning","message":{"text":"import-manager.default (cyclomatic 30): import-manager.default has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 11 of the 30 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 79, 45, 161). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/import-manager.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23bdce9da4e010da5c516bf3f42e10543299742964771754475e8c2bd8655a6"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 30): (anonymous) has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to 6 function items inside it that branch (push::loadFileCallback, push, push::fileParsedFunc, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/import-manager.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d9ff07751c458a8820cf4102cd3f74536c99f7d15444dacb82d7efbed4175c"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportManager.push (cyclomatic 29): ImportManager.push has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 10 of the 29 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 79, 45, 161). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/import-manager.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"342c11b2cfde0d88709c27923dd55c4808e4258d73c130b5501d851e12cde8ea"}},{"ruleId":"D1","level":"warning","message":{"text":"loadFile (cyclomatic 29): loadFile has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 10 of the 29 points are its own statements and the rest belongs to 6 function items inside it that branch (getFileData::tryPathIndex::tryPrefix, getFileData::tryPathIndex::tryWithExtension, getFileData::tryPathIndex::tryPrefix::(anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-node/file-manager.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4713b659b87a677e9ec44a200c96d2d896b0bb48d7e94a845783080b35b357"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTree.toCSS (cyclomatic 27): ParseTree.toCSS has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (parse-tree.default) 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":"packages/less/lib/less/parse-tree.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"797b6f3d21a3fdc770b7ccfc9a60272a62202c377c134bb369ef52625ae5c4ef"}},{"ruleId":"D1","level":"warning","message":{"text":"parse-tree.default (cyclomatic 27): parse-tree.default has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (ParseTree.toCSS) 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":"packages/less/lib/less/parse-tree.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7407da69552398b335bbf50462c3313df4361f83c5993982d9ca6135f17b5115"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::toCSS (cyclomatic 27): (anonymous)::toCSS has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parse-tree.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcb5a180ba670fd15c0e44d723183cf2879c71e5ac5b52dd9b8e6fac58e0bb1"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::permissiveValue (cyclomatic 27): Parser::permissiveValue has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6395f06ac70b9da0e57e68f895609440ae9473346be59b8b21098e640a9e88e"}},{"ruleId":"D1","level":"warning","message":{"text":"Definition.evalParams (cyclomatic 25): Definition.evalParams 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":"packages/less/lib/less/tree/mixin-definition.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05b07f89aced539688c35cce26282a85c5839fef7e85b8b39f6a806c26ff885"}},{"ruleId":"D1","level":"warning","message":{"text":"AtRule.constructor (cyclomatic 23): AtRule.constructor has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/atrule.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4688855af008f9535bc02664f78f77a8416fbdbe8e41260a8328975349eda424"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessExtendsVisitor.isElementValuesEqual (cyclomatic 22): ProcessExtendsVisitor.isElementValuesEqual 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":"packages/less/lib/less/visitors/extend-visitor.js"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9497b56d82099f25b39539e4e88e9a91205a7451b48d49e71bd637b47468089"}},{"ruleId":"D1","level":"warning","message":{"text":"AtRule.evalRoot (cyclomatic 22): AtRule.evalRoot has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/atrule.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50fdf3d572a93b9db3e6be062336c5492c574888455ef4de3b9487ea9e79170"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse (cyclomatic 22): Parser::parse has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f05f5995f275fea54f7506f28ab3f76ab5223cbdaed9002b76115af2a6be43a"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::declaration (cyclomatic 22): Parser::declaration 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":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ed02a72d2dafa1e96c4b3e77f9b1ab213b76680e82177eb830641a29430a7f"}},{"ruleId":"D1","level":"warning","message":{"text":"AbstractPluginLoader.evalPlugin (cyclomatic 20): AbstractPluginLoader.evalPlugin 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":"packages/less/lib/less/environment/abstract-plugin-loader.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cf4d62e646551e2e16a3ef85f48c4a1a79bdb5165cc1aa79d4ee0edcd2fdba"}},{"ruleId":"D1","level":"warning","message":{"text":"svg.default (cyclomatic 20): svg.default has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to one function literal inside it that branches (line 8). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/functions/svg.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f003440bac8edf63c4687ab6e937a2d7ed41e88209421e819bd28f7dbe90fc56"}},{"ruleId":"D1","level":"warning","message":{"text":"transform-tree.default (cyclomatic 20): transform-tree.default has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/transform-tree.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f75376c3b4fe6208f1d66ad9a0cc2e801e90e36a1831ebcb781be634475720"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/transform-tree.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f5bc0843e2b6172bbefea7a70f7c2c792c5bcf8d5e718979665a74155fba2e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::call (cyclomatic 20): Parser::call 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":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5c9b4b17ec8ee884c5f84c011b4b627c3bde1cfa3ee27b7abe31fadbc3fd93"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::selector (cyclomatic 20): Parser::selector 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":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb72ad5652bc0a35385f6dbe5a00ff28ebed0b436baa9d02cce271466d73e66e"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::svg-gradient (cyclomatic 20): (anonymous)::svg-gradient 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":"packages/less/lib/less/functions/svg.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e24fc6a70b9a8a16e6a84ce5404b4a8b37a79676cb39b6a4dd6dc621b598a5"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessExtendsVisitor.findMatch (cyclomatic 19): ProcessExtendsVisitor.findMatch 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":"packages/less/lib/less/visitors/extend-visitor.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9ac995a54a07ae55a1a584019321ff0c53a1784de42ec963e54d000d39cad4"}},{"ruleId":"D1","level":"warning","message":{"text":"toString (cyclomatic 19): toString 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":"packages/less/lib/less/less-error.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf8b63ed77d3f7acc7eb1deb7cf53050cd12343a2a721fefe1121e4ec32deaf"}},{"ruleId":"D1","level":"warning","message":{"text":"joinSelector::replaceParentSelector (cyclomatic 19): joinSelector::replaceParentSelector 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":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6151d9367459fdf85f36689982a7a21a24015bd0ea492408349b5d751bb5c9d"}},{"ruleId":"D1","level":"warning","message":{"text":"each (cyclomatic 19): each has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/functions/list.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46cc6c75bad4e257c8663b98cc18bb51a9ba9866cf79186c3102e969239e291"}},{"ruleId":"D1","level":"warning","message":{"text":"Color.toCSS (cyclomatic 18): Color.toCSS has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/color.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"03788885c0f7053c24ab8f3c90b8d0ee0deeee6a7109dbf6429aba1cb8c60687"}},{"ruleId":"D1","level":"warning","message":{"text":"Visitor.visit (cyclomatic 18): Visitor.visit has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/visitors/visitor.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1598a0f67e6bc643cc654b5d40a862499402227f3a584519e792847c36d71e4c"}},{"ruleId":"D1","level":"warning","message":{"text":"Definition.matchArgs (cyclomatic 18): Definition.matchArgs has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/mixin-definition.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f632945dee139eeab99f2fa64bcbed5ec29f3dcdaca33f15be9d54cc8ed25a8"}},{"ruleId":"D1","level":"warning","message":{"text":"AbstractFileManager.extractUrlParts (cyclomatic 17): AbstractFileManager.extractUrlParts 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":"packages/less/lib/less/environment/abstract-file-manager.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf887575dfdf75f647786fa9df10393461a186f624f5c9a7ec102801a3ea326"}},{"ruleId":"D1","level":"warning","message":{"text":"add-default-options.default (cyclomatic 17): add-default-options.default has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/add-default-options.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba9df64f20c72e4b7e5b07ded87a1abbcd4acb9f32a5a509438f3bdf8a587a0"}},{"ruleId":"D1","level":"warning","message":{"text":"createCSS (cyclomatic 17): createCSS has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/browser.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"63664da1b08a011995b76e33e5322cd944fd1ed2710cf2f46bb6978f07688728"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 17): (anonymous) has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/add-default-options.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8496069d9c2ce21520923b628fca7d2cda86f171a23cce56c216a338737631ef"}},{"ruleId":"D1","level":"warning","message":{"text":"Call.eval (cyclomatic 16): Call.eval has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/call.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dca7796ce6ebec39397e53905121392d1d5e88ca5fa7e2c921be3be89e36b6"}},{"ruleId":"D1","level":"warning","message":{"text":"cache.default (cyclomatic 16): cache.default has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 26, 11). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/cache.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"19383d099a216ece42fad5fddd743a48f6bbba73aa227cd969b6127b3d5f4678"}},{"ruleId":"D1","level":"warning","message":{"text":"loadFile (cyclomatic 16): loadFile has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 38, 23). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-node/url-file-manager.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a89e486060395dae580cdba044ad6792f5f76c01bd8be1a6c69fc362485445"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 16): (anonymous) has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (getCSS, setCSS). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/cache.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c3a5935d3554c33eb32b208838c6543cc14d438343804499b2846f51b56740"}},{"ruleId":"D1","level":"warning","message":{"text":"onImported (cyclomatic 16): onImported has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/visitors/import-visitor.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb216e2431a64ad8a4040734b1cff24c6c5c8821c7f76226d76834fb1a924a52"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::primary (cyclomatic 16): Parser::primary 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":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c55e2e514502d709e6bb78f26e4aa6bda6922af2a7d572be1ce660c6787bba"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.Parser (cognitive 178): parser.Parser has cognitive complexity 178 (threshold 15). Drivers by points: boolean chains 139, if/else 27 (32 pts), loops 2 (3 pts), error handling 2, ternaries 2 (nesting depth added 6). Of this number, 150 points are the body\u0027s own statements and 28 belong to 75 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"36493b4b73ccd990e52de9326a992d31d9c4be27f79e6a41e0af2d930911ae50"}},{"ruleId":"D2","level":"warning","message":{"text":"MixinCall.eval (cognitive 93): MixinCall.eval has cognitive complexity 93 (threshold 15). Drivers by points: if/else 20 (54 pts), loops 9 (21 pts), boolean chains 10, error handling 1 (5 pts), ternaries 1 (3 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/mixin-call.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff44165073949085522e1bad9069a8acf42a35b7e5c2da4b46c59fb67bb6b450"}},{"ruleId":"D2","level":"warning","message":{"text":"Ruleset.joinSelector (cognitive 92): Ruleset.joinSelector has cognitive complexity 92 (threshold 15). Drivers by points: if/else 31 (59 pts), loops 11 (28 pts), boolean chains 5 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9d1665253e69062267e67ed71177170c1494a3538d6135b36acd73ee1f5794"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::args (cognitive 89): Parser::args has cognitive complexity 89 (threshold 15). Drivers by points: if/else 26 (68 pts), boolean chains 10, ternaries 3 (10 pts), loops 1 (nesting depth added 49). 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":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"948a01328a341fc6275cee31b1c5cfb5a23ffba507884a390ef3647636f45a99"}},{"ruleId":"D2","level":"warning","message":{"text":"eval (cognitive 83): eval has cognitive complexity 83 (threshold 15). Drivers by points: if/else 22 (50 pts), loops 10 (19 pts), boolean chains 10, ternaries 2 (4 pts) (nesting depth added 39). Of this number, 72 points are the body\u0027s own statements and 11 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae89c4644e4d9d4f004d491e6b756d64034c76a723a4d38bea1364eb7d9259c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::mediaFeature (cognitive 82): Parser::mediaFeature has cognitive complexity 82 (threshold 15). Drivers by points: if/else 24 (59 pts), boolean chains 11, ternaries 2 (10 pts), loops 2 (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"94839dd464fbcaaa1c9408101b208f59d3b6e2c2a788f414a1e5ff78226cd56b"}},{"ruleId":"D2","level":"warning","message":{"text":"doEval (cognitive 81): doEval has cognitive complexity 81 (threshold 15). Drivers by points: if/else 24 (56 pts), boolean chains 18, ternaries 2 (4 pts), error handling 1 (3 pts) (nesting depth added 36). 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":"packages/less/lib/less/tree/import.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60baee6ad8ac66ad589bfdaafd0538c1f423967c24368ee1d7287cf6c88598e"}},{"ruleId":"D2","level":"warning","message":{"text":"joinSelector::replaceParentSelector (cognitive 63): joinSelector::replaceParentSelector has cognitive complexity 63 (threshold 15). Drivers by points: if/else 14 (39 pts), loops 6 (20 pts), boolean chains 4 (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63a2cd22863cbce8f6dafed0de5ab51d1bcaabad2e0ec331c9fc0a33c85944b"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::$parseUntil (cognitive 58): (anonymous)::$parseUntil has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (46 pts), boolean chains 6, match/switch 1 (3 pts), loops 2, ternaries 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser-input.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"8148466ad8fce1236cdf2daee2d5c12fbdefa780778bbcc7b272ebd62fe7626e"}},{"ruleId":"D2","level":"warning","message":{"text":"Definition.evalParams (cognitive 57): Definition.evalParams has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 5 (14 pts), boolean chains 6 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/mixin-definition.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9976d425d86248b3aaa6e3bd1cf5bf0c8435ae055a31087b95167f50801a4638"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 55): (anonymous) has cognitive complexity 55 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 10, loops 4, error handling 1 (nesting depth added 15). Most of this is not in the body itself: 2 of the 55 points are its own statements and the rest belongs to 21 function items inside it that branch (loadStyles::(anonymous), loadStyleSheet::loadInitialFileCallback, registerStylesheetsImmediately, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/index.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4ce30e8da426afe25b76776e147269d69c555a577eb676a5f71ade5314ca33"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::permissiveValue (cognitive 55): Parser::permissiveValue has cognitive complexity 55 (threshold 15). Drivers by points: if/else 21 (46 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c7b599e2fc310d275f79ad2783fc20b793205979e6af1fe18791304c7edf66"}},{"ruleId":"D2","level":"warning","message":{"text":"source-map-output.default (cognitive 54): source-map-output.default has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (36 pts), ternaries 2 (8 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/source-map-output.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d896d81e1b148dd7faf2b3fa2b468b840914ef49e9681cc236bce3d7c2f907"}},{"ruleId":"D2","level":"warning","message":{"text":"bump-and-publish.main (cognitive 53): bump-and-publish.main has cognitive complexity 53 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 11, error handling 4 (9 pts), loops 1, ternaries 1 (nesting depth added 12). 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":"scripts/bump-and-publish.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"952dbcd31804ac55dc439cc7c260b29c07719f73ad0e9592ea70ab03fcabb607"}},{"ruleId":"D2","level":"warning","message":{"text":"genCSS (cognitive 52): genCSS has cognitive complexity 52 (threshold 15). Drivers by points: if/else 18 (30 pts), ternaries 6 (11 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"4760ff92e4154c2f40285dc0e1d09b4347eb085e7848ddd5536296f469eafaa0"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 46): (anonymous) has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 4 (8 pts), boolean chains 5 (nesting depth added 25). Of this number, 41 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/transform-tree.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa28b6f37a0006528f61b914a45fdda9a7cb211d140f6ec84c4b4f8e767b80e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessExtendsVisitor.findMatch (cognitive 45): ProcessExtendsVisitor.findMatch has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (31 pts), boolean chains 8, loops 3 (6 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/visitors/extend-visitor.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3bc79ab45a973c8aa3398b7df5068565824e6ab2a062bb9401e3ec1d463f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTree.toCSS (cognitive 44): ParseTree.toCSS has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 6, loops 2 (3 pts), error handling 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (parse-tree.default) 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":"packages/less/lib/less/parse-tree.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e85bb71e58a23f6212a7068fbf989fb417cfcba6b37c5ff1cd01399a5d86fa8"}},{"ruleId":"D2","level":"warning","message":{"text":"parse-tree.default (cognitive 44): parse-tree.default has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 6, loops 2 (3 pts), error handling 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ParseTree.toCSS) 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":"packages/less/lib/less/parse-tree.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fa4af07e66c440c431f52a0fda50b37b70b1807eab5f141cb3a9397e3f4135"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::toCSS (cognitive 44): (anonymous)::toCSS has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 6, loops 2 (3 pts), error handling 2 (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":"packages/less/lib/less/parse-tree.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a58a91c1e80fe4efbfc8f1a4a738715f2080f549a81c081aee017dafb1b3023"}},{"ruleId":"D2","level":"warning","message":{"text":"import-manager.default (cognitive 42): import-manager.default has cognitive complexity 42 (threshold 15). Drivers by points: if/else 26 (34 pts), boolean chains 8 (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 26 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/import-manager.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f544503a0b0d103e5ceb722d9cb5d10cf5f400796c7e30deba35c0d4b58b1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"minMax (cognitive 42): minMax has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 8 (14 pts), boolean chains 12, loops 1, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/functions/number.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2b6cd878891dfd1f154d10293441d42dba76005f7f8e6230e14a2a863f7e41"}},{"ruleId":"D2","level":"warning","message":{"text":"transform-tree.default (cognitive 41): transform-tree.default has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 4 (8 pts), boolean chains 5 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/transform-tree.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d8f729806bfffb4788e79984a71a740f3974e45d29e75f7d58d493ecbf8c31"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportManager.push (cognitive 41): ImportManager.push has cognitive complexity 41 (threshold 15). Drivers by points: if/else 26 (34 pts), boolean chains 7 (nesting depth added 8). Most of this is not in the body itself: 15 of the 41 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 79, 45, 161). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/import-manager.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c05372acbf43e8b18bf7ed48ce7f9dd401d5fba14c44089a359e201bf80e1b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::atrule (cognitive 40): Parser::atrule has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 7, ternaries 2 (5 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4864e491185094e63cb2af457776e0bbd40a141844bb44c5c4f15d90140c67"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::declaration (cognitive 38): Parser::declaration has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 6 (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":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"2238175e630149605e949c92fc0f6b75d912e4f41a862ad604dd8158823f8b49"}},{"ruleId":"D2","level":"warning","message":{"text":"parser-input.default (cognitive 37): parser-input.default has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 17, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser-input.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3570ef4ccc631e2fad8283844b477e3e4f2b764dd3b47aec61d0b9031e713d73"}},{"ruleId":"D2","level":"warning","message":{"text":"constructor (cognitive 36): constructor has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (22 pts), ternaries 3 (6 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 15). Of this number, 32 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/atrule.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a566edcc6d052829ecaaf7aacc2ea862d2ea98331e552131ee578d777220970c"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractPluginLoader.evalPlugin (cognitive 35): AbstractPluginLoader.evalPlugin has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (26 pts), error handling 3 (6 pts), boolean chains 3 (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":"packages/less/lib/less/environment/abstract-plugin-loader.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0ddd39f66da1987dd8d7e5fd04eccfe5bdb560945f8aae8ebb77d7db75c6c3"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessExtendsVisitor.isElementValuesEqual (cognitive 34): ProcessExtendsVisitor.isElementValuesEqual has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 10, loops 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":"packages/less/lib/less/visitors/extend-visitor.js"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d288b58e9ff53941bd6fc30cec27a84ac1caf6fabebcca78456a859fc1182a7a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.default (cognitive 34): index.default has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 10, loops 3 (nesting depth added 8). Of this number, 23 points are the body\u0027s own statements and 11 belong to 9 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/index.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e77fffa356055ef8ee9ba3eac9c3ee9ab61d999460293f4b03e084f4fdf963"}},{"ruleId":"D2","level":"warning","message":{"text":"eval (cognitive 34): eval has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (29 pts), ternaries 1 (4 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/namespace-value.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdda87ed2d4f3510ee0130ae7f99d4719298843b318d6989a880ba3cd69af085"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::call (cognitive 34): Parser::call has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 6, loops 1 (3 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abcc71d483c57b3b42e2ec8cc627084857457fe14164b54e0d9d5f76ed4d110"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 33): (anonymous) has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 13 (nesting depth added 3). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 9 function items inside it that branch (errorHTML, errorConsole, errorHTML::(anonymous), \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/error-reporting.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e16bcd72a0b26ce674fd01821856e0c6dc4a1b6f0ac65b6fd049fa34405b610"}},{"ruleId":"D2","level":"warning","message":{"text":"each (cognitive 30): each has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 8). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/functions/list.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c645a08390ef944dce6efd76106521e76500ce61fb722567eeccf750cee606"}},{"ruleId":"D2","level":"warning","message":{"text":"parse.default (cognitive 29): parse.default has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 4 (nesting depth added 11). Most of this is not in the body itself: 0 of the 29 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 8, 64, 21, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parse.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2547cd5081ab28a0e8540ab38e013a7293b58017870580b8f569858a2442a48"}},{"ruleId":"D2","level":"warning","message":{"text":"error-reporting.default (cognitive 29): error-reporting.default has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 15, if/else 14. Of this number, 25 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/error-reporting.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"53abe4b76924e9d895ad8503c7aee64ceb63ae7621ec6bd0edb4270c272616b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::selector (cognitive 29): Parser::selector has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbde72ed95849d8544d6592acc0c743f32d9482c400c676c8f0c4a29aefcd436"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceMapOutput.add (cognitive 28): SourceMapOutput.add has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 2 (8 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/source-map-output.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f443ceaf04053a303244c5eff8edbc4e48402b687d9dade5544c05690e434d15"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::add (cognitive 28): (anonymous)::add has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 2 (8 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/source-map-output.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c4e86f9b6e42b1d0744cb21fa631702e13d4b0001f3cf18358b551085e977b"}},{"ruleId":"D2","level":"warning","message":{"text":"loadFile::getFileData::tryPathIndex::tryPrefix (cognitive 27): loadFile::getFileData::tryPathIndex::tryPrefix has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 2 (6 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-node/file-manager.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bf446e65e38fbd401bf07b9b7f6a2aba6fdac3926c517cce25c78cd1834b2f"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse (cognitive 27): Parser::parse has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, ternaries 3 (4 pts), loops 1 (2 pts), error handling 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":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a801ccf9580244223d93448954231897731dd955552edabd8724325138b21960"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::primary (cognitive 27): Parser::primary has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e0ecf2f687330bc518730043b42292bb5ed772ee52d25f3edc343b49e2f6cd"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::atomicCondition (cognitive 27): Parser::atomicCondition has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (27 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":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2791}}}],"partialFingerprints":{"codehealthFindingId/v1":"6052ce85cd423da46de1b6d20c7737d9b7046ffe8160420ee207849c7593aeb3"}},{"ruleId":"D2","level":"warning","message":{"text":"AtRule.evalRoot (cognitive 26): AtRule.evalRoot has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 11). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/atrule.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69cddc80c5a2bf7d5df1e42db731bc83e33ebaecf81ca4a12e501beb9afaa83"}},{"ruleId":"D2","level":"warning","message":{"text":"LessError (cognitive 26): LessError has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 5, ternaries 2 (4 pts), error handling 1 (3 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/less-error.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1c47c32ab0c15328a7cf4c7ff2ed9518faf76de8675913e541d52ec3ebf82e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::element (cognitive 26): Parser::element has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"6514f283bb4edbf0cd8a4ef85dc3be555510d0eb803d680b40f10d2d8320553b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::mediaFeatures (cognitive 26): Parser::mediaFeatures has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2, ternaries 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":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"991625e959c03b085826853839caeca656a01d271d180519c2af96b9ee6d1ad6"}},{"ruleId":"D2","level":"warning","message":{"text":"Visitor.visit (cognitive 25): Visitor.visit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/visitors/visitor.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04481ce06ec9a5950c6c55f021a8ad8fc175bb437934f791133c72a721dafe0"}},{"ruleId":"D2","level":"warning","message":{"text":"Ruleset.find (cognitive 25): Ruleset.find has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 15). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 518). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"418093842a19a21d0a1ebf36abf97ab51e78d0b801be8010f7ee1a29fba75bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"Definition.matchArgs (cognitive 25): Definition.matchArgs has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, loops 3 (nesting depth added 8). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/mixin-definition.js"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"6780457711f19fdbe0a9c83f73d5e329ab8ce960f009f670b6486ecd0fb436e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::extend (cognitive 25): Parser::extend has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b76040c54661efb7e1f02b251f573ca19f1a25a8042912ccb5c458bb88118df"}},{"ruleId":"D2","level":"warning","message":{"text":"Color.toCSS (cognitive 24): Color.toCSS has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/color.js"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a1d84b8166565c1e828c6873aa5c3d5589243f0e68da656be19a81b5d11ba2"}},{"ruleId":"D2","level":"warning","message":{"text":"Call.eval (cognitive 24): Call.eval has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 8). Of this number, 22 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/call.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"df78c4a447070cc1e3084131a58a259c8229be461a0e40cfc85310cc264758e3"}},{"ruleId":"D2","level":"warning","message":{"text":"toString (cognitive 24): toString has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5, ternaries 2, other 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":"packages/less/lib/less/less-error.js"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f8c4d13ac5bc0227e604f4ab87b3426e399270c996c04bc181b2584c4ea432"}},{"ruleId":"D2","level":"warning","message":{"text":"eval (cognitive 24): eval has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 1 (4 pts), boolean chains 3 (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":"packages/less/lib/less/tree/url.js"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"630b38aa1cf577842c4d25631c1296661c394585150b16a7b788abb3fe617621"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::arguments (cognitive 23): Parser::arguments has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, ternaries 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cfb91400e72d7f6bfc83d7d0645427d61bb3507dbaf83020e131889f9c9412"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::skipWhitespace (cognitive 23): (anonymous)::skipWhitespace has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser-input.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ab72778c8a2deccfa36ad28263eb8cd7ad518fd9fa9995cd2fb3ea82557597"}},{"ruleId":"D2","level":"warning","message":{"text":"onImported (cognitive 22): onImported has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 7). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/visitors/import-visitor.js"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6c6f332d4955a034a64a22294f4e377fee5d4e60c43d97fc93dd2f21011318"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::multiplication (cognitive 22): Parser::multiplication has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2586}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8962f7f87943df4b77c896844c4cf391c7a20d6a65d3f24ae409eed0d40cdf"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessExtendsVisitor.doExtendChaining (cognitive 21): ProcessExtendsVisitor.doExtendChaining has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/visitors/extend-visitor.js"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb29b793593e6d8df8cd2c2269b176a644ff366cb2f6c7e8877183b55c6d1070"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractFileManager.extractUrlParts (cognitive 20): AbstractFileManager.extractUrlParts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, 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":"packages/less/lib/less/environment/abstract-file-manager.js"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a123c890538b0beb25fb40e67a6be9790e346745ef3d143a79e72c37e4f5f5e"}},{"ruleId":"D2","level":"warning","message":{"text":"eval (cognitive 20): eval has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/operation.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a1751dd998147cdcd8f357f23848eac85acd4ae21dde95aeac62aa96860c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::svg-gradient (cognitive 20): (anonymous)::svg-gradient has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (6 pts), boolean chains 2, loops 1, 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":"packages/less/lib/less/functions/svg.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b533b1b607252d487b2871ca001678df9f14f52bd88bd1cfb1123e3da0bd987a"}},{"ruleId":"D2","level":"warning","message":{"text":"Unit.cancel (cognitive 19): Unit.cancel has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/unit.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5dcfaf3fd2df5e6e2f56cd12da8c964a8b635f1982af254d26042edff20c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessExtendsVisitor.visitRuleset (cognitive 18): ProcessExtendsVisitor.visitRuleset has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/visitors/extend-visitor.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c9ce2a84aaa788e4cf7f7d49f731b8bdc38f85abbae1255cd08a3edcc81c10"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 18): (anonymous) has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (5 pts), error handling 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (getCSS, setCSS). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/cache.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60d10103dbbb58aa164cbdda8f69797101695a86ee47fe47cb17ac5a2761954"}},{"ruleId":"D2","level":"warning","message":{"text":"eval::calcDefGroup (cognitive 18): eval::calcDefGroup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/mixin-call.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fd5bf9733b5d3ccee3ac6fe3b3b3985c4d783a238eb9296f4bdf4dedda75b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::expression (cognitive 18): Parser::expression has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2880}}}],"partialFingerprints":{"codehealthFindingId/v1":"d447161a27fc8493ec0282e5e57a312570f783d06ca6c4f51a33979ffeaea220"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::ruleProperty (cognitive 18): Parser::ruleProperty has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2919}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dac150c648b1ead512415e6fee28a3692031f8cc4ea26578ea912b82a9fe39b"}},{"ruleId":"D2","level":"warning","message":{"text":"Dimension.operate (cognitive 17): Dimension.operate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4 (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":"packages/less/lib/less/tree/dimension.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ccbb7bbf0dcfdb151e155931c1ef9d878d5665d96c12929509506f9498cebd"}},{"ruleId":"D2","level":"warning","message":{"text":"Ruleset.parseValue (cognitive 17): Ruleset.parseValue has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"26606936bb50e0f365c1ddcbd12305475b6f5640964089f800edf80954253531"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::push (cognitive 17): (anonymous)::push has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/import-manager.js"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8434c54b0be5e834df268fc6d1fcdb1292afe6c9695c88caccdecf660046f06d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::push::loadFileCallback (cognitive 17): (anonymous)::push::loadFileCallback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/import-manager.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c947aa7710521a3703d9ebe5bb446adff757afa773ff728678ce8205deea048"}},{"ruleId":"D2","level":"warning","message":{"text":"doXHR (cognitive 17): doXHR has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, ternaries 1 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/file-manager.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11318afd43dabe2c8d433c9ca8079ec4c26f88af99cd840fda6cf315caefaa6"}},{"ruleId":"D2","level":"warning","message":{"text":"createCSS (cognitive 17): createCSS has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 7, error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/browser.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1abbca40cb7e45108ebca88f4d949f27411bd57c9133434067d6d55d29cdeb"}},{"ruleId":"D2","level":"warning","message":{"text":"_removeDuplicateRules (cognitive 17): _removeDuplicateRules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/visitors/to-css-visitor.js"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a7cea976f48e400dc56217486e99fc0f83761bb8641abea03e3638058bb1ea"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::data-uri (cognitive 17): (anonymous)::data-uri has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, 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, 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":"packages/less/lib/less/functions/data-uri.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0800614b0352e090b95ab6be6e3214979942f106818ab1c97682e40905206d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"data-uri.default (cognitive 16): data-uri.default has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 0 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 10). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/functions/data-uri.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88460efa0afd15d109b02d9120e8d190530b63f4421ed9280a2e83ec19289e4"}},{"ruleId":"D2","level":"warning","message":{"text":"svg.default (cognitive 16): svg.default has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 3). Most of this is not in the body itself: 0 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 8). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/functions/svg.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3904d2f0f64705e08b53f5f41cb7dc339edb29a4b6328fa5796588e27ce7cfff"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::parse (cognitive 16): (anonymous)::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4 (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":"packages/less/lib/less/parse.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b8a154eae5e53dfdf08d4271dfe8827f2b7ef21efcbc78e84b12096df6ceb8"}},{"ruleId":"D2","level":"warning","message":{"text":"loadFile (cognitive 16): loadFile has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 5, ternaries 3 (4 pts), error handling 1 (2 pts) (nesting depth added 2). Most of this is not in the body itself: 0 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 38, 23). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-node/url-file-manager.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efc29018d514b59dd103b5d234dada1cf2ef87181f1a5659dc79644fd3a539d"}},{"ruleId":"D2","level":"warning","message":{"text":"visitRuleset (cognitive 16): visitRuleset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/visitors/to-css-visitor.js"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f18ea09799e5ffa44d6f2a8a03ef1bc25ae82e74f41321adade5e6027bfc48"}},{"ruleId":"D2","level":"warning","message":{"text":"processImportNode (cognitive 16): processImportNode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 1 (2 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/visitors/import-visitor.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd39194545fbe534f3f325739532749d05a11d5cefa6349ac3b1ced9cc6f6d9"}},{"ruleId":"D2","level":"warning","message":{"text":"variables (cognitive 16): variables has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 1 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 358). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"81603eabfd859f188ca44961721d5040a5cd9715851f7dc199e93d906fc098fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/parser.js: FileTooLong \u2014 1711 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 1500 significant lines; this is 211 over it, 1.14\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":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0df2efa536d2a3e595cabc0fe3c9f7ff39614c9fae32bff86b1f1a108039eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: parser-input.default: FunctionTooLong \u2014 default runs 273 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 173 over it, 2.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser-input.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b852a256670091abbcd8df1ee48d3a5a08a021f2bf08677e8dfc9906a7c78a1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.default: FunctionTooLong \u2014 default runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/index.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"065c648e0795cfa1f1eb5ece567bb20cb3fe45e3020c0da16d765c2a1a5cf313"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bump-and-publish.main: FunctionTooLong \u2014 main runs 147 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bump-and-publish.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e31eef6ac6cce36b023751ee95a0b4dbd14404445771f6385eea6a0c80af4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: error-reporting.default: FunctionTooLong \u2014 default runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/error-reporting.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b102dfb0339ffa887a249f57eab2f8c8faa843a95dd96177250b80178b9bc34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MixinCall.eval: MethodTooLong \u2014 eval runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/mixin-call.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b0894b89d77d45f46af368f641ea7677be7fbe6bcdc5fd2660717ebb7f7d97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree/ruleset.js: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9f39f803bb1d957b2e03f6fe23003bf68a3c3d75b1f4315acfd020b1ae7b35"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Node (LCOM4 5): Node\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":"packages/less/lib/less/tree/node.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1821034d127214ec13766d5d5a94379d192079735c0a9d3225f94d915b07aeb8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PluginManager (LCOM4 4): PluginManager\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":"packages/less/lib/less/plugin-manager.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"de48ea2dd083560a439a057078f79885f354465b5e9c4b49f966de1d2e357cdf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/less/lib/less/parser/parser.js: packages/less/lib/less/parser/parser.js changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 606 in parser.Parser at line 68. 3 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-06-04..2026-09-02, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-04 13:02:17 -07:00\u0027 --until=\u00272026-09-02 13:02:17 -07:00\u0027 --full-history --no-merges -- packages/less/lib/less/parser/parser.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37a19c4ca7f172a5799d1e3d224e0d6838a766dd9f8604e23bb30e3fbe63e8d"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 10 significant file(s) lose their only recent owner: packages/less/Gruntfile.cjs, packages/less/lib/less/visitors/to-css-visitor.js, packages/less/lib/less/tree/color.js, packages/less/lib/less-node/lessc-helper.js, packages/less/lib/less/tree/selector.js, packages/less/lib/less/contexts.js, packages/less/lib/less/tree/quoted.js, packages/less/lib/less/tree/media.js (\u002B2 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"78b50626857b92605ed4e40cfba35daae96ddf86f11e58250261f80c3ee796fd"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (12 single-owned of 65 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 65 of the 181 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 3 project(s) overshoot their size bounds, lowering Project Cohesion to 3.3/10. The most over is \u0060packages/less\u0060 (15433 LoC, 109 public types across 11 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":"2b50d6185f231a28fa9959e31861b0be76667502f1a2f794cc5c60d4fa797cb7"},"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"}}]},{"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":"5ba62e50cd9b85c8eebaf77a95e7f3795493feb661821f7951f3d27547627a1d"},"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"}}]},{"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":"b15e7c4516957eb0ce628a71875180462280b3da835590c3e3ea26dfe36c7cc0"},"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"}}]},{"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":"935f2f2145807af3dbbad84827e55ee29d5f2a02656e8850b93a73ff5162a18d"},"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"}}]},{"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":"a31989f40134ad9f3ebace1076bcb42c2dd44b71e8b4fa9409986e69a1f379c2"},"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"}}]},{"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":"89c234d8b24280f0d4ff41f0e12a425745ed25b8a26c58b6251b2d8975c69648"},"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"}}]},{"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":"0895a7cdda02bafccfece2ac626f0518d9ca385adca7d0cce77a13fe797d3878"},"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"}}]},{"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":"81f77b20e4b9d5d2038ead9e726101004c03b554a1a03c3ce901a50053dda6e3"},"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"}}]},{"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":"e1117bfb0d10ad203c65f2b3347895eaa76319dcc879fbba6a8d70c164038e39"},"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"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fbc6df3d72864219648f8a5e2a3fe4857d204776cc76785ab693bf45ade35c2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"08303728022f83e73efc210add81bd315c8a086c289b3d95ae5582b317b91d8b"},"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"}}]},{"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":"2c28a997322115941dbe650f87aa2e06d390648ffbdf1a61df828dd4fe301044"},"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"}}]},{"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":"909676c06f5afe994a246d7540d3084208f6e8a1996c1db90537a278b2175ed1"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"7cf8a78c4a993aecafcb4fe2b18ecb6ff3aced137586a07de2812771fcf18756"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1498825690ee691422757d83c6c8726aaf69040fa62a3b6b71a03075f0880320"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"85f99189d964cdde824a816d83f2290af0a3f7efe42feb1d6495743a90e33e22"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"95944c3938958e6815245224a106c97106955f5196953f8bf2bb44be881a4364"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"e40a70a8b4f0c62b9217050ca16b378bc6ff0fecc1d548b6b6379ff1002f1d96"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"703f05aa8bb04b78ced6695afa9312fc1ed23a4a23009c0952c48c85af7bf23f"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e78207729d6c5e0ea34c8e2717d8cb874480c333112d70b7cca0aa69242c9ae8"},"properties":{"dependency":{"package":"underscore","version":"1.4.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b8b982f108de182ba77397a9b0f27addd5c03ae6840736a528b48703d2791837"},"properties":{"dependency":{"package":"form-data","version":"0.0.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d60e94c772e19b5d3e6a67c6c044eb0c299ab654854a0fa48ece6abf03bf44bd"},"properties":{"dependency":{"package":"lodash","version":"2.4.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","SNYK-JS-LODASH-450202"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a281bb26d3fd984732b3d7f2fc02b3638c3730d405ca2c03039e9b86c7027ad4"},"properties":{"dependency":{"package":"shell-quote","version":"1.8.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e32a448cc007ced35f574ac851d62d56116470e427182b0cdc6268bd3dd0048"},"properties":{"dependency":{"package":"form-data","version":"2.3.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41fb9db9faaab772fe16bd132de2de977e522312ac67e83a5806a1fe9ee3c34f"},"properties":{"dependency":{"package":"lodash","version":"2.4.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","SNYK-JS-LODASH-450202"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"56d7c0542bcbbd8d8c61f07327aa2080292f8d213e8f982f1a0933ffecde0a9c"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1557c434bac796415d1c63a38d2aff0f2e24e3c0fb682f4374c76d710f9a650"},"properties":{"dependency":{"package":"hawk","version":"0.13.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c1b87bcad33669c45d0e050ade7407cc9ffb31250e8049677083a09b76b036c"},"properties":{"dependency":{"package":"playwright","version":"1.50.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"packages/less/test/mocha-playwright/runner.js","line":3}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"004214f8583c504872f9b358547a24c58ce39b8373c45516eb63e6ddb20f9afb"},"properties":{"dependency":{"package":"semver","version":"5.4.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"scripts/bump-and-publish.js","line":26}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb26baac35cec2372e4b44d575c776480efbf996d51f93583a07b71584dff94f"},"properties":{"dependency":{"package":"hoek","version":"0.8.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f98b93f8cad173f66fbc877ea9b477e3d3c01469e2538a357faedc8ade0b7d98"},"properties":{"dependency":{"package":"hoek","version":"0.9.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1df004b179a82ea85e26e15a1b894f9ed87b18614481cbf87848e7e54cbc91a"},"properties":{"dependency":{"package":"qs","version":"0.6.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02f809db19946ff68dac97234c12abfc27eedc356a81cfd3ee9e444a4053df19"},"properties":{"dependency":{"package":"tmp","version":"0.0.33","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79c1425a85aaf37d8d9582c149eb989e84a73dd91c1ce2a6105a30f0a44efb49"},"properties":{"dependency":{"package":"parse-link-header","version":"0.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce9074a8ca02728fcc1d03753ea9d91376f00dae795aa598fd65fddb2b7fb34d"},"properties":{"dependency":{"package":"lodash","version":"4.17.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90eec009643a19b88c0620b5e354df8b1b052d71e41cb4d74d18c0bcdffa0ed9"},"properties":{"dependency":{"package":"mime","version":"1.2.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"packages/less/lib/less-node/environment.js","line":21}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"635cde9860b68e56898d582225d882b3dab2d1ebe75d111465bf8a323e0e396b"},"properties":{"dependency":{"package":"minimatch","version":"3.0.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a30b01fa80ee47b0efd6c44bd6ac916f335403cf4ad922fbe5a028dca8852687"},"properties":{"dependency":{"package":"js-yaml","version":"3.13.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53201880c63bb76ac9ca3eb3f748888c5241b43e4c24480d4bfc480c4142fd4a"},"properties":{"dependency":{"package":"js-yaml","version":"3.14.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99a4ae43414f83f70514747d30037d71d195544a0935078e050da56a36598604"},"properties":{"dependency":{"package":"js-yaml","version":"4.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7198a4de66d7b359923e874a2cd4e435f42d55e093386c693934c7f83b73422"},"properties":{"dependency":{"package":"shell-quote","version":"1.8.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df21b8127d24aeed9579f3ce44f2f84d2d4f9ae41d6b03d4309b75c4781747cc"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6fde06abe7dac0b6bc6951df4e58a3dd77b634a2402a8ce8ec6bcc39669c05de"},"properties":{"dependency":{"package":"brace-expansion","version":"2.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13e2368a1bcfcb82c20fd17f2898ed4173b2bb51f2f855806668ab70b1536291"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06593c39ce911a216ed914a471d9cdd931bac450d9675076e44dd756bcb35a60"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bd55a47dee84d51461f4d7235c2f9c6c4d731816a3c86eb50aa0cf01ac3d52a"},"properties":{"dependency":{"package":"glob","version":"11.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"packages/less/test/less-test.js","line":7}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94c6ff14ea54b382a61d2f966f77a9032450e908372d7ab5d8acd1b161983573"},"properties":{"dependency":{"package":"postcss","version":"5.2.18","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"379d1398dd9426e2bb1c7af0931835c48d83c3809f85d0a33f1ca592ec34359b"},"properties":{"dependency":{"package":"browserslist","version":"1.7.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcfc91f7a7cccfa8489d3b5e1f6b21432cb76f25072798331369c1fd9106020a"},"properties":{"dependency":{"package":"browserslist","version":"4.28.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"537abc5f5366d088c30e217964002ce75347850045c6e7585a7bcd2886674f2d"},"properties":{"dependency":{"package":"requestretry","version":"1.9.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"addbeeceadb4c5bc8ee5caeb04de03ac44d22d147c99d7f88af5a778dea0b9c6"},"properties":{"dependency":{"package":"serialize-javascript","version":"4.0.0","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15a0f55bf98d45cec1e6067645c9a127cb539e6219bff589e0ceebe0057ab9e3"},"properties":{"dependency":{"package":"moment","version":"2.30.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6790d95ef4250a9ee017c5265a8bc843950da52c7e724496a0b71444dd614598"},"properties":{"dependency":{"package":"request","version":"2.22.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69b8436bc88809b9a8efea9c02bdbb9c506e3e87ef4fc05de064faa2c848a890"},"properties":{"dependency":{"package":"bl","version":"0.9.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5f4bda2ad74b334e327bb4a56825b67428d2cd73a8e6be2960e273f5c69c59e"},"properties":{"dependency":{"package":"moment-timezone","version":"0.5.5","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bfc89dc5e82affb0e5b8e7d18d95cdaf4fe320f98ff3f02c8b4bb68cc47eac31"},"properties":{"dependency":{"package":"tunnel-agent","version":"0.3.0","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee64125dd87bb102d7fa440a14cab98a531ffca165ddb0f5d092bd36fc9cc039"},"properties":{"dependency":{"package":"qs","version":"6.15.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab392710035c032433b5cbbaf6048ad9c2f444623720616239125f6a7941a549"},"properties":{"dependency":{"package":"qs","version":"6.5.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b5b392823fe38441da2092e714b8d973e2c00629222139b650b3361bc61fd30"},"properties":{"dependency":{"package":"tough-cookie","version":"2.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9501b23c07bcae601357e9f1ab27b801abb5ccd6478d943e4894382574f97fac"},"properties":{"dependency":{"package":"morgan","version":"1.11.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a1187aa88b5f103d60aad5310ba3f08326d5bc366c9bdf6b5ed532e5987856d"},"properties":{"dependency":{"package":"request","version":"2.88.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bcaff5d1e287866fb15ab08f33c0744f85cfc07f596d7af736c916f57cc95099"},"properties":{"dependency":{"package":"uuid","version":"3.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"16bc49aac72eafef4ac9a880a9755121d0367a6bdf3e48689c49c4d9d8c09a58"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.10.37","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8eba86c9792a138ace869e535ae4d0e1feb8eed6751d340789bf2c21812d884c"},"properties":{"dependency":{"package":"underscore.string","version":"2.3.3","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa0729795fa1b2f63355808279b9b783ab18c7e89b63a210dff92c8721ffeb61"},"properties":{"dependency":{"package":"phin","version":"2.9.3","advisory":"[GHSA redacted]","reachability":{"kind":"test-or-tooling","file":"packages/less/Gruntfile.cjs","line":147}}}},{"ruleId":"D30","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":"d8884977fb5db81074778c0c1d8e66cf2219fb89e44e4956024b365306db135d"},"properties":{"dependency":{"package":"diff","version":"3.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"1bc71fc3f5760e5781b5077956071b548853142b564c4fe32ff458dd99423ee3"},"properties":{"dependency":{"package":"debug","version":"3.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"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"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"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":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"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"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 18: .nvmrc declares Node.js 18 as this project\u0027s version file, and Node.js 18, support ended 2025-04-30. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-04-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f6648803ca1184d1b831cc0935c1131320f0ac2f71c390fad75199d5bf2e7db6"}},{"ruleId":"M1","level":"warning","message":{"text":"README may be stale: 24 code files changed in the last 6 months but the README was not touched \u2014 it may no longer reflect the system."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e973e7a8d5d866995cbf78b120250fe7f132bf928812d48ca62e69aba11b9910"}},{"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":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s javascript-typescript pack, \u0060semgrep --config=p/typescript\u0060, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 23780 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":[],"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":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060run\u0060 is async and calls existsSync \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/test/exports/webpack-browser.cjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6b1d2eb30730576e60e397b53bb3777d3a4c0517490216908e03fb1df8125e"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 2 typed \u00B7 179 plain JS \u2014 the untyped files are config/eslint/base.cjs, packages/less/index.cjs, packages/less/lib/less-browser/add-default-options.js, packages/less/lib/less-browser/browser.js, packages/less/lib/less-browser/cache.js, packages/less/lib/less-browser/error-reporting.js (\u002B173 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (47 matched lines \u00D7 2 locations): packages/less/lib/less/tree/property.js:7 \u00B7 packages/less/lib/less/tree/variable.js:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 286 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":"packages/less/lib/less/tree/property.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5099663a67e85254366a2cca6ab981024fd9922db975de4da9074783681eaf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (34 matched lines \u00D7 2 locations): packages/less/lib/less/tree/container.js:48 \u00B7 packages/less/lib/less/tree/media.js:38 \u2014 the two spans are one implementation copied and then locally edited \u2014 294 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":"packages/less/lib/less/tree/container.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8413f9fe2a73790eb369792fceb2800a834a6d1dbcd6e09d348368baf714989d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): scripts/test-release-automation.js:528 \u00B7 scripts/test-release-automation.js:571 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-release-automation.js"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf223434255fe07c53c7a7dcbb72c3f0d9c97f1c1fc781e500c1682dc713d55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): scripts/test-release-automation.js:915 \u00B7 scripts/test-release-automation.js:948 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-release-automation.js"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2148a5f703f7017717048a6ae1d788be06f60805f541bd039b1e90c29260c84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3 locations): packages/less/lib/less/functions/color.js:247 \u00B7 packages/less/lib/less/functions/color.js:271 \u00B7 packages/less/lib/less/functions/color.js:295 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/functions/color.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cc7d5ebafe9803298f66f24cc39fa07536042655e453964a1f1c1600f0ecbd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): packages/less/lib/less/parse.js:7 \u00B7 packages/less/lib/less/render.js:3 \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":"packages/less/lib/less/parse.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2424b417c1e90d2853359f1a826ac7557af9f4fdb34b5094f80db42b38aa1e3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): packages/less/lib/less/functions/color.js:60 \u00B7 packages/less/lib/less/functions/color.js:103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/functions/color.js"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ff2990a662cc10fbe83b0f54e371cf5d49f518aea6ac2c51fe3d6b939ea8b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): scripts/test-release-automation.js:769 \u00B7 scripts/test-release-automation.js:872 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-release-automation.js"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ca014ba674ff9d05edb1488f6aaccae5d1824b2847e4d7653c2f54c7455897"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/less/lib/less-browser/error-reporting.js:22 \u00B7 packages/less/lib/less-browser/error-reporting.js:136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-browser/error-reporting.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fef51758c799e442ed4dbab8a5f674190828f048431218bd36ce2888be89b37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/less/lib/less/tree/container.js:19 \u00B7 packages/less/lib/less/tree/media.js:12 \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":"packages/less/lib/less/tree/container.js"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf51b54fc85d2affc4965f7b9e8472a3bf4bc95dc9221438f93d22dc6cc834f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): scripts/test-release-automation.js:735 \u00B7 scripts/test-release-automation.js:751 \u00B7 scripts/test-release-automation.js:816 \u00B7 scripts/test-release-automation.js:832 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-release-automation.js"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3299f70a9542822219655ca09448c0371cc4e6d4946811c00ccc392d9d68e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): scripts/test-release-automation.js:816 \u00B7 scripts/test-release-automation.js:832 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-release-automation.js"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebc8b532fe225586ca3161b5679bf80ed21034243a89c05774adbbac91abbcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/less/lib/less/parser/parser.js:2111 \u00B7 packages/less/lib/less/parser/parser.js:2212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ad1dd955a4a8a46e964a44b139c53411e44eab4fbd391f1d550f01c31e111a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/less/lib/less/parser/parser.js:2684 \u00B7 packages/less/lib/less/parser/parser.js:2718 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"553c03848ffded066d7b0942ed205fd2be73507d34f133af3bb907d2eb3717ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/less/lib/less/environment/abstract-plugin-loader.js:32 \u00B7 packages/less/lib/less/environment/abstract-plugin-loader.js:94 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/environment/abstract-plugin-loader.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"594f4dc64b15f1ee4d7bd93463befa52878634589d0b9b8d024ced85dfb96d4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/less/lib/less/tree/import.js:260 \u00B7 packages/less/lib/less/tree/import.js:282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/import.js"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f9e1b3b22dfda0be25dd15305c1c753908e6c34e94a06a725c5a185c163aaf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/less/lib/less/parser/parser.js:2618 \u00B7 packages/less/lib/less/parser/parser.js:2645 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6848eff5c2716e1600d3e22256dd6f17a1314fb1743cf1abe3a64ad99f0e7431"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): packages/less/lib/less/tree/property.js:3 \u00B7 packages/less/lib/less/tree/variable-call.js:5 \u00B7 packages/less/lib/less/tree/variable.js:3 \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":"packages/less/lib/less/tree/property.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6759b76e9ba1775d9f9b47f86b099a6a1792020e9bdbb05f4307bb88978e88bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): packages/less/lib/less/tree/ruleset.js:221 \u00B7 packages/less/lib/less/tree/ruleset.js:235 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c20b1f35ee3e32b332e89552ab49e77c09df1a1ef081a7af778e18d7e16457"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/less/lib/less-node/image-size.js:12 \u00B7 packages/less/lib/less/functions/data-uri.js:18 \u2014 the two spans are one implementation copied and then locally edited \u2014 82 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less-node/image-size.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b625ef64f68c1d04b68c68108b80c23c1d596ff14b35a857bb800b00d22fed48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): packages/less/lib/less/tree/namespace-value.js:48 \u00B7 packages/less/lib/less/tree/namespace-value.js:63 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/namespace-value.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cecee6a36bdf5aefd49bb53858bdb8a4037109ddad49b8caf6cb6da71928b0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/bump-and-publish.js:203 \u00B7 scripts/bump-and-publish.js:217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bump-and-publish.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e97a1f929de214d83f3cf415829758f78ec7de1af15a269d0f8d3d437f149b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): packages/less/lib/less/functions/number.js:56 \u00B7 packages/less/lib/less/functions/style.js:13 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/functions/number.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd5c000722708fd73adf8f76a3b13a264a90325beacd3ef62158033d9cff1c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/less/lib/less/plugin-manager.js:66 \u00B7 packages/less/lib/less/plugin-manager.js:81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/plugin-manager.js"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0812be6539d05384fc88bec7474f0f17d2d77e1a916a9b9aca3e0998fc255f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/less/lib/less/tree/color.js:194 \u00B7 packages/less/lib/less/tree/color.js:224 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/color.js"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5ed31100d64dd4e46d29ae03975178870f4add86a45b99a7d8a83cc5cdd455"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): packages/less/lib/less/tree/container.js:6 \u00B7 packages/less/lib/less/tree/media.js:7 \u00B7 packages/less/lib/less/tree/mixin-call.js:4 \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":"packages/less/lib/less/tree/container.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"306c112bcc5507f1c8333c8700b6ebbeedd52f4164f5f78f8543a819aacd79e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): scripts/test-release-automation.js:715 \u00B7 scripts/test-release-automation.js:796 \u00B7 scripts/test-release-automation.js:849 \u00B7 scripts/test-release-automation.js:890 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-release-automation.js"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2659be9b8dd6cc4d14491f17fc449145fae1b44dbf3c95504f7e19fc74fa998"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/less/lib/less/tree/color.js:175 \u00B7 packages/less/lib/less/tree/color.js:200 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/color.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fdee3ef661fc46d1992e0d3a63b6b82d0c5c42261532fa2e5861f3f3a627a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/less/lib/less/tree/import.js:218 \u00B7 packages/less/lib/less/tree/import.js:256 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/import.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"541ad97b5ac6e57db26449b633c2e28911ed9d6b36f6dc28cd53d889e564936c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/less/lib/less/visitors/extend-visitor.js:483 \u00B7 packages/less/lib/less/visitors/extend-visitor.js:494 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/visitors/extend-visitor.js"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d3c1c2a288c3ab72648c84d011db0e961b0574cec53b9f67ded73def9d837d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/less/scripts/coverage-lines.js:138 \u00B7 packages/less/scripts/coverage-lines.js:188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/scripts/coverage-lines.js"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"15134216a789ec76e4373a643e0dc990688bf29c702e7134e7d032f14f913f0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/less/lib/less/parser/parser.js:2205 \u00B7 packages/less/lib/less/parser/parser.js:2223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"337b4bd68ec67635bba545d6b6b78709caa622e259f3fbb9b0970a0b1d41a6ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/less/scripts/coverage-lines.js:13 \u00B7 packages/less/scripts/coverage-report.js:11 \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":"packages/less/scripts/coverage-lines.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6785ae119004dd9d5a83c8ee11afa033399eb1774dc5e7307884b3b2646a6bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): packages/less/lib/less/transform-tree.js:61 \u00B7 packages/less/lib/less/transform-tree.js:85 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/transform-tree.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"417a903cfafba5b1a061bb669ab34e94595cbfa2387a356a1afbefcc87d4fb15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/less/lib/less/tree/quoted.js:61 \u00B7 packages/less/lib/less/tree/quoted.js:73 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/quoted.js"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98210b4a24d8c8c217c87ba98b03eb1c9326f433e3139416c49abdd3c65a2fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/less/scripts/coverage-report.js:135 \u00B7 packages/less/scripts/coverage-report.js:142 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/scripts/coverage-report.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90c9a5b0965093e2b75170ebd8ee16645da84a0662eac507b1cd9240e1a0f19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/post-merge-version-fix.js:88 \u00B7 scripts/publish-beta.js:43 \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":"scripts/post-merge-version-fix.js"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd01a7627933770e9e11d702501352ef7cc2de63ebe6129bed4e7bd6e26dcdeb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/publish-beta.js:25 \u00B7 scripts/release-metadata.js:127 \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":"scripts/publish-beta.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6b994d6a7f8487dc58207605b7fb1833ab37395799f95517d5246a45f412b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function doEval (cyclomatic 50, cognitive 81): doEval has cyclomatic complexity 50 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/import.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8055ceaf32d98de7bf9600441c68a3e220c3a1c20bfa5cd03b7702f0baccc89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eval (cyclomatic 41, cognitive 72): eval has cyclomatic complexity 41 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4431e7e8add07e8459af96127894d8f4e82605d9e30ee869dce9c57a92375c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function args (cyclomatic 40, cognitive 89): args has cyclomatic complexity 40 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d320eb57b4340190378ee28890e5b2add6187be0b316681dddd6995014c94c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mediaFeature (cyclomatic 39, cognitive 82): mediaFeature has cyclomatic complexity 39 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06dd6a163d0e1647744b5eebda801a36c500774e246bdc34d4488892870f226"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 39, cognitive 53): main has cyclomatic complexity 39 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bump-and-publish.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b599a69c012c4126fa1483734d4219a3865f638db9ee56813adcc2be357332"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function atrule (cyclomatic 37, cognitive 40): atrule has cyclomatic complexity 37 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66dd5ea6613278534671db9942c2acb2851cb77d44ad91244ea78640fb1affe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function $parseUntil (cyclomatic 34, cognitive 58): $parseUntil has cyclomatic complexity 34 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser-input.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7a2f637df937f128691dfe9d1949ef17edf41e407cd716ed59488445277003"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function genCSS (cyclomatic 32, cognitive 52): genCSS has cyclomatic complexity 32 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/ruleset.js"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a57ed63e3b5c8439e1cefec9be2bc30c52830d8ffcbeee24578505122c7657b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function minMax (cyclomatic 30, cognitive 42): minMax has cyclomatic complexity 30 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/functions/number.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d7037232cc58a9743388f2c709c359847b69bb8289fcb6ede03eb333cd1bd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eval (cyclomatic 29, cognitive 75): eval has cyclomatic complexity 29 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/mixin-call.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"154f1315c89a605c6e2c6ecd83c147cc559e5bfa506a116094bbb45401fc8776"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function permissiveValue (cyclomatic 27, cognitive 55): permissiveValue has cyclomatic complexity 27 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"683847ac21cbd42685242733691c67b1f42d50fe2218c1e6431131ec5ff54f5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toCSS (cyclomatic 27, cognitive 44): toCSS has cyclomatic complexity 27 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parse-tree.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b1c41005236045e5b78c3961b4a8250030d429ac16f9f0c463d71d8aade9d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evalParams (cyclomatic 25, cognitive 57): evalParams has cyclomatic complexity 25 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/mixin-definition.js"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bdfca6238bee63906328035c671a1eb7207cf47d47aa1a97bb805e2ed6fedc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function declaration (cyclomatic 22, cognitive 38): declaration has cyclomatic complexity 22 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3068caa76a86b7f5b66fbcd7091d8c623ec3bdc4ab9fe34a55dc3e3fb3bf6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isElementValuesEqual (cyclomatic 22, cognitive 32): isElementValuesEqual has cyclomatic complexity 22 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/visitors/extend-visitor.js"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e69cb46cf956dfec3216b83426ee34fba0efc039ae2f1b43dfd6f4c3097fb9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse (cyclomatic 22, cognitive 27): parse has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6740a4e81206e047328bdb3d2ac2c6a9fe7f4824591fba7882d96ca3f6b41d5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evalPlugin (cyclomatic 20, cognitive 35): evalPlugin has cyclomatic complexity 20 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/environment/abstract-plugin-loader.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"442d1a666deff157a55eefd16104b6bfbf840b966d77d9a61a9c743795c038c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function call (cyclomatic 20, cognitive 34): call has cyclomatic complexity 20 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5e11b7e64cb72111ce2e2a714202a3a27be62e77e1b914f1487c11e6062032"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 20, cognitive 32): constructor has cyclomatic complexity 20 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/tree/atrule.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b811aaa86ed580b9113ec91ee755ff7a2c8fd84c1953a326835a433f2f0684"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selector (cyclomatic 20, cognitive 29): selector has cyclomatic complexity 20 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cd4749a0e3f2651f8c5eecb77d779dd090e2bade980439671ca81f5bd97ea8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/test-release-automation.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52358f0610188d2371bd2a46e7c00a4c86f65a611ced3f26d097a81a07227855"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bump-and-publish.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e0df71bb6d9c7cf0e459c2ce6308de7882ef3a35d36d5798adcf00ec265168"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release-metadata.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f17477fb0aaf65b0bcf8ebf9b1ea7d455e1ae8f317d0fcebf95f3495e4d949"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/scripts/coverage-lines.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9524e2f2ae5d735e0dec551e1fa70b322464f18c73405c47fe8b6bdfd044cec6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/scripts/coverage-report.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a64f105c1d93e4f60ef889f99504d58a5e9cf49b5aa28793c11566a102a2ff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/post-merge-version-fix.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74f5800b7220baa78a2d1a48ae22c9a257855f88b006bb166ae4170887c40b1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish-beta.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adaf921f30e4dfa089b81da8bb9803e7c73bf8c3d7dc25a32bb39540c0cdcfed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/scripts/postinstall.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46664ede048a04d5d7a150c7b37ad27b6a4b24961571bd1b2b78e3d491cf03b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/index.cjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5f9d6f0d9ed5e594aa7125667c2d35ea05fffc7eb4fbec33159ab992b402e7"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027npm-run-all\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":"16ad841168067cc6a11855203219c5df3211dca55a04879c3dab6b70a3526eca"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027benny\u0027: Declared in packages/less/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":"a63da47c0589f913337e7c6c0a8236911c81e4db6128d9edba35ec93581f843c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027bootstrap-less-port\u0027: Declared in packages/less/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":"e62a789f0ec48b9817492cfd8dda5c86d1a7577b8120d6e9bd17c147d66c4833"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (5 files): packages/less/lib/less/parser/parser.js \u2192 packages/less/lib/less/tree/index.js \u2192 packages/less/lib/less/tree/atrule.js \u2192 packages/less/lib/less/tree/nested-at-rule.js \u2192 packages/less/lib/less/tree/ruleset.js \u2192 packages/less/lib/less/parser/parser.js (one verified cycle inside a mutually-dependent group of 26 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/less/lib/less/parser/parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"704e1161f7908ed33b561d0ed3edbfa374faab31ba3ef3a5b02e8e31e7ce46d8"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-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":"CWE-353","shortDescription":{"text":"CWE-353"},"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":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"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":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":74,"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."]}]}