{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"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":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"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":"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":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"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":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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":"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":"compost-0.0.11.requireDiff$1 (cyclomatic 80): compost-0.0.11.requireDiff$1 has cyclomatic complexity 80 (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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"a905f800024c88a3402d94d3f422073887767730947a501e684da6aeb50ae7b4"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.requireDiff$1 (cyclomatic 80): compost-0.0.12.requireDiff$1 has cyclomatic complexity 80 (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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0828ea65ed6f69b11334ff08eb577e913407033d1b815047b42ef041e795ba1"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.requireDiff$1 (cyclomatic 80): compost-0.0.5.requireDiff$1 has cyclomatic complexity 80 (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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e76ce8b900b42bdfb14d6fd8b7627ba038169c96de28c8cc93bd5854bb9da1"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.requireDiff$1 (cyclomatic 80): compost-0.0.8.requireDiff$1 has cyclomatic complexity 80 (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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38dc20da4c7ebc1a48530da9cfede48427c33c031f2c61b919396f3e1e2739e"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.requireDiff$1 (cyclomatic 80): compost-0.0.9.requireDiff$1 has cyclomatic complexity 80 (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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65e753fa663986ebcaa01c80c23fede99d84aed27803e96288ff371ca377fd6"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.requireDiff$1 (cyclomatic 80): compost-0.1.0.requireDiff$1 has cyclomatic complexity 80 (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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"230c1e3d3f55f1302b53e9bf30b8a9b8b2d4934786c201740ab858920ff4bf83"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.requireDiff$1 (cyclomatic 80): compost-0.2.0.requireDiff$1 has cyclomatic complexity 80 (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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da22abb2e936977a88ebfd98c14718299493fe225a88630c26cb49bf1da15be"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.requireDiff$1 (cyclomatic 80): compost-latest.requireDiff$1 has cyclomatic complexity 80 (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":"docs/releases/compost-latest.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"392738a4fef62084227b0ddeb05a771e7d31113c67fbfb564f192d604b33cb7a"}},{"ruleId":"D1","level":"warning","message":{"text":"Scales.calculateScales (cyclomatic 41): Scales.calculateScales has cyclomatic complexity 41 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/core.fs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de291a81bd3e5e15dd8955b69aa161939e42ed4c4dcbc8a80e1ed39dfe80a8c"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.11.Events_triggerEvent (cyclomatic 34): compost-0.0.11.Events_triggerEvent has cyclomatic complexity 34 (threshold 15). Of this number, 33 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"95213e7e07d9888c1a74bb93686a30d2b76f1c69b1ec40eb92b0d1797e0d3518"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.Events_triggerEvent (cyclomatic 34): compost-0.0.12.Events_triggerEvent has cyclomatic complexity 34 (threshold 15). Of this number, 33 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":4469}}}],"partialFingerprints":{"codehealthFindingId/v1":"3884a17d64b75d1974d4c1eee0331e4930d18ebcbd4d3618d702bd288e2e73fa"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.Events_triggerEvent (cyclomatic 34): compost-0.0.5.Events_triggerEvent has cyclomatic complexity 34 (threshold 15). Of this number, 33 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cf7c89e2d5ebd90d20eb655f5963f24dda08be25a82fda548fc30a2b3c264a"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.Events_triggerEvent (cyclomatic 34): compost-0.0.8.Events_triggerEvent has cyclomatic complexity 34 (threshold 15). Of this number, 33 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb83b429130675420b673c12199a4316521cb0dc02d406d2a4f8e2db196945ab"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.Events_triggerEvent (cyclomatic 34): compost-0.0.9.Events_triggerEvent has cyclomatic complexity 34 (threshold 15). Of this number, 33 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8747488b949bb3990e2dce6858168c0693a0de76aebaa3bfefb7a82edef4689"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.Events_triggerEvent (cyclomatic 34): compost-0.1.0.Events_triggerEvent has cyclomatic complexity 34 (threshold 15). Of this number, 33 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"86627bb6a9609fe48384e78306448c4e9046f89271d4e7f1f0e816fad2872330"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.Events_triggerEvent (cyclomatic 34): compost-0.2.0.Events_triggerEvent has cyclomatic complexity 34 (threshold 15). Of this number, 33 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"039fdd51fa18a34efef1c967911e0f254eb82a9e91939e6470729cac48859c20"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.Events_triggerEvent (cyclomatic 34): compost-latest.Events_triggerEvent has cyclomatic complexity 34 (threshold 15). Of this number, 33 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":"docs/releases/compost-latest.js"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"52151450f5e07add55594d8e3603d85d319a5968e04deec0824642f07074a12c"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.11.requirePatchOp (cyclomatic 32): compost-0.0.11.requirePatchOp has cyclomatic complexity 32 (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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb050c194e19d2d2046050f3baa35bd5442afd77d38b00456377a083855f31d6"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.11.requireVirtualHyperscript (cyclomatic 32): compost-0.0.11.requireVirtualHyperscript 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b3145eaf43c64f0d126b7247c0f6f7b6c13ab1e5fa2b7403bf11f761c5041d"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.requirePatchOp (cyclomatic 32): compost-0.0.12.requirePatchOp has cyclomatic complexity 32 (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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e27254c844866e5463fbc8b00ff47588a2feac846ad8a215290e710a7ddc3b"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.requireVirtualHyperscript (cyclomatic 32): compost-0.0.12.requireVirtualHyperscript 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81382553405175a11b4811025349a556f2abe591292fd9004ab5995817bc765"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.requirePatchOp (cyclomatic 32): compost-0.0.5.requirePatchOp has cyclomatic complexity 32 (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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d25374ebfb4881f37c3cb1603c3979b3c489372667a07242d9d49cf77baa42"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.requireVirtualHyperscript (cyclomatic 32): compost-0.0.5.requireVirtualHyperscript 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b861fe228504dc5ac6984ba2cf4182aa1affa9fddc5633d1205e74ba740337"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.requirePatchOp (cyclomatic 32): compost-0.0.8.requirePatchOp has cyclomatic complexity 32 (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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4eee21b0524ce15c2d3f9ebff3c7242f4dfa46e657199d2a40633a74cc0d1e"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.requireVirtualHyperscript (cyclomatic 32): compost-0.0.8.requireVirtualHyperscript 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8120027eed410dd0fdb00c9aba57e49f325684e068c21fd567ac27e91d9cc6d"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.requirePatchOp (cyclomatic 32): compost-0.0.9.requirePatchOp has cyclomatic complexity 32 (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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"38387cf0d1df1e1f78f4490fabe39b8a3a64b12005a7d4835e9f31134578b365"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.requireVirtualHyperscript (cyclomatic 32): compost-0.0.9.requireVirtualHyperscript 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df5747db4154151380db8987f67c689f2d66ab1aaf56f3ac3981814939a263c"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.requirePatchOp (cyclomatic 32): compost-0.1.0.requirePatchOp has cyclomatic complexity 32 (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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d340b390a5976f417f08b421bf68c05a14c1c5a6a1b8d73fe2314de727c854"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.requireVirtualHyperscript (cyclomatic 32): compost-0.1.0.requireVirtualHyperscript 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cb9cab2bfc94bf7d0731215d83a1298b6edf4a5574785aa96662e1eb292614"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.requirePatchOp (cyclomatic 32): compost-0.2.0.requirePatchOp has cyclomatic complexity 32 (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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c510c2069d8f7fd07f7053632078a1aca801c6b8684bdd4b975c0b67762f3cf8"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.requireVirtualHyperscript (cyclomatic 32): compost-0.2.0.requireVirtualHyperscript 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5aca29db78d1889b570a983dec6a28c824ac59df5a6bbefe7b97724965d94e5"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.requirePatchOp (cyclomatic 32): compost-latest.requirePatchOp has cyclomatic complexity 32 (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":"docs/releases/compost-latest.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64e3fd0a040b36087a99bafbd4c381cdf982a9e87e34f3202eb1e65739404fa"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.requireVirtualHyperscript (cyclomatic 32): compost-latest.requireVirtualHyperscript 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":"docs/releases/compost-latest.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9f4293c9cb5b5de2c3db7dc9c90bdf69cc6d7f2f320ea40c28b44028578301"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.11.requireApplyProperties (cyclomatic 30): compost-0.0.11.requireApplyProperties 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e644cd76fce4d402ff91d179aa826e09a964b8862fb47708757e24ccf5c3e09d"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.requireApplyProperties (cyclomatic 30): compost-0.0.12.requireApplyProperties 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a6e0ed83a0b1c410efa1a4139b6bf3b22d600864297e086023c87279029a18"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.Scales_calculateScales (cyclomatic 30): compost-0.0.12.Scales_calculateScales has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 7 belong to 7 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":4006}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd837e22bd158cf6e1b1d62685b4353ecd9625504eb8e6ad42a932f75a966ba1"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.requireApplyProperties (cyclomatic 30): compost-0.0.5.requireApplyProperties 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead0ff5bd977c08f13f44e1e44254bcf89affd0c2e7c3db3bde7dae7ff050267"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.requireApplyProperties (cyclomatic 30): compost-0.0.8.requireApplyProperties 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecfeef976ce193f95bbaa09eb9ee6666160061223bffe47a85a17f10527181b"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.requireApplyProperties (cyclomatic 30): compost-0.0.9.requireApplyProperties 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"45be25cc5926244618db1355603ac9171f8da114785ce3e32d6bc1cd16be5615"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.requireApplyProperties (cyclomatic 30): compost-0.1.0.requireApplyProperties 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"92aeacc05d45318b4c2754d18ad27f946eb180d31e00450b1fe2dd5ffe210fe4"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.Scales_calculateScales (cyclomatic 30): compost-0.1.0.Scales_calculateScales has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 7 belong to 7 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":4039}}}],"partialFingerprints":{"codehealthFindingId/v1":"33264d79924408f79b83e1033d19a4aabf34c016a20cc609b644d4d14ae9ac69"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.requireApplyProperties (cyclomatic 30): compost-0.2.0.requireApplyProperties 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"945757964ed27df99562b09ab31bb601fe840b8f19a621c92c35b8c3388eb88c"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.Scales_calculateScales (cyclomatic 30): compost-0.2.0.Scales_calculateScales has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 7 belong to 7 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":4039}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea5b0581db7f43a85069e43e7808e98f3e35fa65e78b6820a2a985436ac0049"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.requireApplyProperties (cyclomatic 30): compost-latest.requireApplyProperties 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":"docs/releases/compost-latest.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf2e7dbd689e6ad5ff12f7bb5c8df9bf6f50b3e35896f73f11de19ef289a985"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.Scales_calculateScales (cyclomatic 30): compost-latest.Scales_calculateScales has cyclomatic complexity 30 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 7 belong to 7 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":"docs/releases/compost-latest.js"},"region":{"startLine":4039}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bcb22e0f743decb767da0841b45fa97594e544488df0ca1e65e2e8f1ba63cc"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.11.Scales_calculateScales (cyclomatic 29): compost-0.0.11.Scales_calculateScales has cyclomatic complexity 29 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 7 belong to 7 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":4003}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b306c911efbe52612b21c7a6c71455c95e6373db524b75ee44e49873fac95b2"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.Scales_calculateScales (cyclomatic 29): compost-0.0.5.Scales_calculateScales has cyclomatic complexity 29 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 7 belong to 7 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":4003}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa0869286c97d613ca8876828151b109dc91c3b2e15b754f07f6e1641a3acd0"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.Scales_calculateScales (cyclomatic 29): compost-0.0.8.Scales_calculateScales has cyclomatic complexity 29 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 7 belong to 7 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":4003}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5cf0b12b40fb68df16fa643492186ec97c7f80b1c127b2e8955272c1bf0b29"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.Scales_calculateScales (cyclomatic 29): compost-0.0.9.Scales_calculateScales has cyclomatic complexity 29 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 7 belong to 7 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":4003}}}],"partialFingerprints":{"codehealthFindingId/v1":"08db7e7940e9a2a7deb209363e3e5056185c45eda0aaead8b42f068bd56531c2"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.11.requireVnode (cyclomatic 28): compost-0.0.11.requireVnode has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c6d4062d0a38084b7876a3a55d0cef5d04b0152511c9432e5ad64ff0dee14f"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.requireVnode (cyclomatic 28): compost-0.0.12.requireVnode has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c91bc0d179c46ba1cbef705a0b9f7393f281a71e96b2c1d4e724582601e4de"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.requireVnode (cyclomatic 28): compost-0.0.5.requireVnode has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c8207aee82bfa1810fccfe1c43e5cb18d8b03bcdec103926a5243e8b88cfd5"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.requireVnode (cyclomatic 28): compost-0.0.8.requireVnode has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1d4aebc60472c3afdc915497ce22daf634e8092ca19e4874ad2548e9600135"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.requireVnode (cyclomatic 28): compost-0.0.9.requireVnode has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"439fa6cd81b8680690a1b6cebc65ced83cd7014bfd5d558cfa65b90a28bafa33"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.requireVnode (cyclomatic 28): compost-0.1.0.requireVnode has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b96329ec3ab0b27951f6d334dfc7b8be1106503ff805e6b5d9f5ff66b43601e"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.requireVnode (cyclomatic 28): compost-0.2.0.requireVnode has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"9280dc7d9c17f63ad82a62d35002cc54aa19fbdb3621755b300ab59057820488"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.requireVnode (cyclomatic 28): compost-latest.requireVnode has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbefb6d53bac579a2ac1fbac45cccdb5cfad10a778427d9fa45ddde377b2ac7"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.11.formatReplacement (cyclomatic 26): compost-0.0.11.formatReplacement has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c5c25a670cbddc91f1c3c163e348f7fef2a08c2e5321c0af4185a9dae03705"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.formatReplacement (cyclomatic 26): compost-0.0.12.formatReplacement has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"431053f049e3f4e98c2df89518018706506d6e5018cd54eb43e1090f4d664515"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.formatReplacement (cyclomatic 26): compost-0.0.5.formatReplacement has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9562a7af5cf3fd26ff29af8bf69544df97c4aabc754decef374772473d1b2a"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.formatReplacement (cyclomatic 26): compost-0.0.8.formatReplacement has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c440b3b0efc5542d9e06ae6056a0c935969389e36d2626413ca5735cae510c8"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.formatReplacement (cyclomatic 26): compost-0.0.9.formatReplacement has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7a814ab33b87067ff1816979bf3eb61400a503ed48db561c30d7f67f47ed93"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.formatReplacement (cyclomatic 26): compost-0.1.0.formatReplacement has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e34ccd4ef59f5b5e0fe0e8fe5eee7db4e6b16f1f84f22f2c2a1d8b2b74be689"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.formatReplacement (cyclomatic 26): compost-0.2.0.formatReplacement has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f86812b1e0206aa41b4976642ec1083e8068333ff3efdbcb5d243629b1b78b6"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.formatReplacement (cyclomatic 26): compost-latest.formatReplacement has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf177b9a2ed37f815adffb23521a3f4eadd8663699f8eab759d056a6a84a8de"}},{"ruleId":"D1","level":"warning","message":{"text":"Serialization.serializeShape (cyclomatic 25): Serialization.serializeShape has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/compost.fs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"13497f7c1ae0009a3f7e6625420864552cd46456cf6fada8bcb8da079f833004"}},{"ruleId":"D1","level":"warning","message":{"text":"Drawing.drawShape (cyclomatic 23): Drawing.drawShape has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/core.fs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"275c5288313787de1d777165a33641936628cd8508e97cc38d17c6ce7e5d849c"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.11.requireDiffProps (cyclomatic 21): compost-0.0.11.requireDiffProps has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.11.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fe8bcd473fffa40204e9ae33dedf99a722f0eea1e4e2a933c64160a5157ffb"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.requireDiffProps (cyclomatic 21): compost-0.0.12.requireDiffProps has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.12.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7571c1b8d3b8e4c15e35f26d2e663004472a8ff9a44f3be3dacacd9c61709e"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.requireDiffProps (cyclomatic 21): compost-0.0.5.requireDiffProps has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.5.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"4261d600949a4beccf7a5ae1b5c1ed52ee2a0b04f74f0496dee60ac8cf19fe64"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.requireDiffProps (cyclomatic 21): compost-0.0.8.requireDiffProps has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.8.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"103ec0d8e6cb64b68af6c834bf587b7c866a2860d0a3ac3fda28e5a515d7422c"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.requireDiffProps (cyclomatic 21): compost-0.0.9.requireDiffProps has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.9.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b001c21e4979875baa4d17d9b8b8df75f34403528c85085619713f0a5022844"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.requireDiffProps (cyclomatic 21): compost-0.1.0.requireDiffProps has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.1.0.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8bbcfa15a696428cb86eb4d77e0f787e2bcc1971d3dd4f5409929e02386133"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.Serialization_serializeShape (cyclomatic 21): compost-0.1.0.Serialization_serializeShape has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.1.0.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":5005}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2ff786e2677f14d05ef5e88d1217a5bc6d8bdd5601f1bc153dfcdb11fb8f62"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.requireDiffProps (cyclomatic 21): compost-0.2.0.requireDiffProps has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.2.0.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b71eff6ae2350b42b6ace344be58ffb5dbfb081cf6c9e7201146125706ed20b"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.Serialization_serializeShape (cyclomatic 21): compost-0.2.0.Serialization_serializeShape has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.2.0.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":5005}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37799b92d9c139c235c3680d0da2cbd21db56a3abfb0cf364b36339b2aa0075"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.requireDiffProps (cyclomatic 21): compost-latest.requireDiffProps has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-latest.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e6a0771b0ab25e5f565858215c6c3c13936f7c14f87e28228ee31af635a15b"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.Serialization_serializeShape (cyclomatic 21): compost-latest.Serialization_serializeShape has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: compost-latest.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":5005}}}],"partialFingerprints":{"codehealthFindingId/v1":"644bc03c2235fde8f896f18557551ff08ab4f8fcbf791b1f31f44b24f4616813"}},{"ruleId":"D1","level":"warning","message":{"text":"Events.triggerEvent (cyclomatic 21): Events.triggerEvent has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/core.fs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"20898a6f88e871a8852f321a4799c9776efc50567678d0b319900b1ed5c29aa8"}},{"ruleId":"D1","level":"warning","message":{"text":"Serialization.deserializeShape (cyclomatic 20): Serialization.deserializeShape has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/compost.fs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5a81a6a1912a1c1ffb6963c1bf800999e85c849fe04387fdb47978d90b34bc"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.11.split (cyclomatic 19): compost-0.0.11.split has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.11.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"91245c1c3c3d6b1eb80d5903a545f271dc3ed9b62291a1e843b5f5bde559689e"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.11.requireDomIndex (cyclomatic 19): compost-0.0.11.requireDomIndex has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.11.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"41936a78eea6daee47b5c3a236f841e445b368817870d3eb561d2eba109b5b4f"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.split (cyclomatic 19): compost-0.0.12.split has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.12.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"0361d08a9be2b1c635541485f29354e6bba9809725d65cc5f1888874215b9684"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.requireDomIndex (cyclomatic 19): compost-0.0.12.requireDomIndex has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.12.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bea941d336abf0d9baca002dfee3e0020071a1c63349dcbf91204550700da0"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.split (cyclomatic 19): compost-0.0.5.split has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.5.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65009f080beef18f43051da1213874e874d5dbab76cf08c08cf57484dded637"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.requireDomIndex (cyclomatic 19): compost-0.0.5.requireDomIndex has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.5.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afb091ac108a572f84bec6696d8dc5459aec2ca1f1f3fa5474c4905d7a04679"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.split (cyclomatic 19): compost-0.0.8.split has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.8.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fabb4642f936f33901611945d1ae0e58a128f628d0d39f263c6297e875165c2"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.requireDomIndex (cyclomatic 19): compost-0.0.8.requireDomIndex has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.8.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66da35070d8958bf47f1c39af5ed21e4b20cc0232f9c8c495aec442e8273844"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.split (cyclomatic 19): compost-0.0.9.split has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.9.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"af22c273c3738c6887c45fc0f6897a114b7583333aa0df195bac12fa013b2b72"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.requireDomIndex (cyclomatic 19): compost-0.0.9.requireDomIndex has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.9.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f8cf88822dbea4c936ca00f4c727c7eb8d72b75c4644010908dc164ba4fb25"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.split (cyclomatic 19): compost-0.1.0.split has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.1.0.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5304636748157306a7011c57747b7a08b80510aea97e3e576c8befe4f9131a"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.requireDomIndex (cyclomatic 19): compost-0.1.0.requireDomIndex has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.1.0.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a157db0f967921e78bf2cd2af1d8dabffeca5baabbf9d80ca4a83abb67b71d"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.split (cyclomatic 19): compost-0.2.0.split has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.2.0.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"273cacfaac85c6c5de28be9cc168a8faff3acedaf7e595d415a7c0b09716a7d6"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.requireDomIndex (cyclomatic 19): compost-0.2.0.requireDomIndex has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.2.0.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"1126c70f29f62797a0f180e54a4ec97899cc6da4fee1735410e00341a05b379b"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.split (cyclomatic 19): compost-latest.split has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-latest.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ee10139f3be857539e06259d252675c1d1abc283a6cde4bbc3d10ea5358ce2"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.requireDomIndex (cyclomatic 19): compost-latest.requireDomIndex has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-latest.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dac502bcc19a49e709a3c0ea04cb1ad742ca2e8c4f72aa3e5fdccaca0d12b1d"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.Drawing_drawShape (cyclomatic 18): compost-0.0.12.Drawing_drawShape 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. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.12.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":4196}}}],"partialFingerprints":{"codehealthFindingId/v1":"802d9abc7f0632bd1c06c635cfacbd0160d78004c313dd48756cd442cf83e9c6"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.Drawing_drawShape (cyclomatic 18): compost-0.1.0.Drawing_drawShape 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. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.1.0.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":4229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ec0574e91bd087ceda1914f2afafd317b72207014dab3246190a756d29d559"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.Drawing_drawShape (cyclomatic 18): compost-0.2.0.Drawing_drawShape 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. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.2.0.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":4229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d07dc0da76bd6b39c671951c072c0e482aed1f9422d2f7ab6f19101c12da63f"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.Drawing_drawShape (cyclomatic 18): compost-latest.Drawing_drawShape 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. This is NOT this file\u0027s highest cyclomatic complexity: compost-latest.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":4229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda03d6365494cc194ecf8fff8e23d97ed56fcd7c141b71bc85c8a23759f3679"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.11.requirePatch$1 (cyclomatic 17): compost-0.0.11.requirePatch$1 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.11.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd2c6f779d23093644c930aabd58ed735a87e018c0b2ac2aa34313bd64a4d1f"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.11.Drawing_drawShape (cyclomatic 17): compost-0.0.11.Drawing_drawShape has cyclomatic complexity 17 (threshold 15). Of this number, 16 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. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.11.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"459931a5678ec4506e8dc2686bdef729557b59ce9ce172669322e417bc06fe3a"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.12.requirePatch$1 (cyclomatic 17): compost-0.0.12.requirePatch$1 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.12.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"8576a52f2a773a50b13fe27d19fddcc4423291c7f34b1d58d7e8f36b01757d60"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.requirePatch$1 (cyclomatic 17): compost-0.0.5.requirePatch$1 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.5.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12f90fc655cd87dbb6473b87e2725368bee5359c5eba03501118beec37f0604"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.5.Drawing_drawShape (cyclomatic 17): compost-0.0.5.Drawing_drawShape has cyclomatic complexity 17 (threshold 15). Of this number, 16 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. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.5.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"3700e31ed8e0585f0a4c2b7ecdfafed78a27acf409016b8189812f66d295ee83"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.requirePatch$1 (cyclomatic 17): compost-0.0.8.requirePatch$1 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.8.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"3944aeb76e7a719a6cb4ceb98b4a37946cec0da045519039f96657ec6056ae3d"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.8.Drawing_drawShape (cyclomatic 17): compost-0.0.8.Drawing_drawShape has cyclomatic complexity 17 (threshold 15). Of this number, 16 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. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.8.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a900e99e23b8bed5f8ab251afd5ef07031415afa4da2d83197a4dc4721866a"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.requirePatch$1 (cyclomatic 17): compost-0.0.9.requirePatch$1 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.9.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c32a486f6f87f438dd649ca2a1f4bdf94fa2b8aa42cfe3024f5b4d9a76e6ce"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.0.9.Drawing_drawShape (cyclomatic 17): compost-0.0.9.Drawing_drawShape has cyclomatic complexity 17 (threshold 15). Of this number, 16 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. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.0.9.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dc97ddb277c86e563190b0162b5fcf7007fe8d25f504b3c2603c0ac960f03b"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.1.0.requirePatch$1 (cyclomatic 17): compost-0.1.0.requirePatch$1 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.1.0.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b40ce359f16431289c86d82474edf06a68dc0c7ae081a66020145f616fbb9f"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-0.2.0.requirePatch$1 (cyclomatic 17): compost-0.2.0.requirePatch$1 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-0.2.0.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"3478bffbaa0844f48200ed50c3dcd60eae0ad61cb29b31156eb152f633a2628c"}},{"ruleId":"D1","level":"warning","message":{"text":"compost-latest.requirePatch$1 (cyclomatic 17): compost-latest.requirePatch$1 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: compost-latest.requireBrowserSplit (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"207a35c3089187c8de14862b3793e3a32917b51c50ecbd76b66fb23a913370e8"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.requireDiff$1 (cognitive 142): compost-0.0.11.requireDiff$1 has cognitive complexity 142 (threshold 15). Drivers by points: if/else 63 (110 pts), boolean chains 15, loops 11 (15 pts), ternaries 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7292ed663d3a2f770c69eae7f2e40e86f96eff0391a9b391f4077ccd3507cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.requireDiff$1 (cognitive 142): compost-0.0.12.requireDiff$1 has cognitive complexity 142 (threshold 15). Drivers by points: if/else 63 (110 pts), boolean chains 15, loops 11 (15 pts), ternaries 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"86701e0ff53aa6bd44b9161fbb978f17e8397344d4c468274b5450056ff4ab8d"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.requireDiff$1 (cognitive 142): compost-0.0.5.requireDiff$1 has cognitive complexity 142 (threshold 15). Drivers by points: if/else 63 (110 pts), boolean chains 15, loops 11 (15 pts), ternaries 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f183a2aa28739415389db71ef23baf1b3692c4897c1679058f6112f351a40d8"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.requireDiff$1 (cognitive 142): compost-0.0.8.requireDiff$1 has cognitive complexity 142 (threshold 15). Drivers by points: if/else 63 (110 pts), boolean chains 15, loops 11 (15 pts), ternaries 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b1124678399deef321db8041943add21219193da5d76e435f559133c3d4d0c"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.requireDiff$1 (cognitive 142): compost-0.0.9.requireDiff$1 has cognitive complexity 142 (threshold 15). Drivers by points: if/else 63 (110 pts), boolean chains 15, loops 11 (15 pts), ternaries 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"0313d48589841cb274de67b57a7eb024e866227354f859b8320d76aee64c0625"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.requireDiff$1 (cognitive 142): compost-0.1.0.requireDiff$1 has cognitive complexity 142 (threshold 15). Drivers by points: if/else 63 (110 pts), boolean chains 15, loops 11 (15 pts), ternaries 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90683cc82874a7d25a240633fc8ba30a012f0f429c1ca238c311c187422189b"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.requireDiff$1 (cognitive 142): compost-0.2.0.requireDiff$1 has cognitive complexity 142 (threshold 15). Drivers by points: if/else 63 (110 pts), boolean chains 15, loops 11 (15 pts), ternaries 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"debe64af42e84cd64b5a0b7ec845c41ff98ff64f450eefd2aafdedbce2b8c4c1"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.requireDiff$1 (cognitive 142): compost-latest.requireDiff$1 has cognitive complexity 142 (threshold 15). Drivers by points: if/else 63 (110 pts), boolean chains 15, loops 11 (15 pts), ternaries 2 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f294c23e07616d4255d1fc9ee3eebaad69bc06d3c35b52d64954f866c11b8bf"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.Events_triggerEvent (cognitive 107): compost-0.0.11.Events_triggerEvent has cognitive complexity 107 (threshold 15). Drivers by points: if/else 22 (81 pts), match/switch 4 (18 pts), loops 3 (8 pts) (nesting depth added 78). Of this number, 103 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b88aca81f25a50fe9c1d71a89e6b083fdbdc58574b55d67a742632f2e3ace3"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.Events_triggerEvent (cognitive 107): compost-0.0.12.Events_triggerEvent has cognitive complexity 107 (threshold 15). Drivers by points: if/else 22 (81 pts), match/switch 4 (18 pts), loops 3 (8 pts) (nesting depth added 78). Of this number, 103 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":4469}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1f18bc95a3b5ddd5f314a94da4491ab28d4e100c1279156c63d0244f102a35"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.Events_triggerEvent (cognitive 107): compost-0.0.5.Events_triggerEvent has cognitive complexity 107 (threshold 15). Drivers by points: if/else 22 (81 pts), match/switch 4 (18 pts), loops 3 (8 pts) (nesting depth added 78). Of this number, 103 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"492c03b9ad51934ec25d39db374f0d656e378041d4411de2a407e2442b8d10b4"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.Events_triggerEvent (cognitive 107): compost-0.0.8.Events_triggerEvent has cognitive complexity 107 (threshold 15). Drivers by points: if/else 22 (81 pts), match/switch 4 (18 pts), loops 3 (8 pts) (nesting depth added 78). Of this number, 103 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88cdf0f10c7aa69c023d1c4f6f2072a6149360f732b5ce0904ad7d932aa85d2"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.Events_triggerEvent (cognitive 107): compost-0.0.9.Events_triggerEvent has cognitive complexity 107 (threshold 15). Drivers by points: if/else 22 (81 pts), match/switch 4 (18 pts), loops 3 (8 pts) (nesting depth added 78). Of this number, 103 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fc3d4dfbeb58c010661250ce5ce4da55b756d4648872a9446c941ad00227c3"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.Events_triggerEvent (cognitive 107): compost-0.1.0.Events_triggerEvent has cognitive complexity 107 (threshold 15). Drivers by points: if/else 22 (81 pts), match/switch 4 (18 pts), loops 3 (8 pts) (nesting depth added 78). Of this number, 103 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b67d1219919fce75ca3550b876b9ff29d3320c1a0ac1333ab6487e232c1a54"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.Events_triggerEvent (cognitive 107): compost-0.2.0.Events_triggerEvent has cognitive complexity 107 (threshold 15). Drivers by points: if/else 22 (81 pts), match/switch 4 (18 pts), loops 3 (8 pts) (nesting depth added 78). Of this number, 103 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b012f31965f82fb92ba1f527e8e8767095e4986c45d749f820b617e0ed33c5"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.Events_triggerEvent (cognitive 107): compost-latest.Events_triggerEvent has cognitive complexity 107 (threshold 15). Drivers by points: if/else 22 (81 pts), match/switch 4 (18 pts), loops 3 (8 pts) (nesting depth added 78). Of this number, 103 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":"docs/releases/compost-latest.js"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"374a0696fff4f06dd978084c886178763e4e5ee5de62b0daf3204fea6c6be04d"}},{"ruleId":"D2","level":"warning","message":{"text":"Scales.calculateScales (cognitive 57): Scales.calculateScales has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 6 (16 pts), match/switch 8 (15 pts) (nesting depth added 27). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/core.fs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03ed79ae7e450b319b7748dd5e2c7fdccbf19bd65f0ef3061fa34450f2ec9db"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.requireApplyProperties (cognitive 51): compost-0.0.11.requireApplyProperties has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 5 (12 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"67361cb8a4ee1c639b2c07d8f1bf47e3770954d38388a001f2be43ea00e16085"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.requireApplyProperties (cognitive 51): compost-0.0.12.requireApplyProperties has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 5 (12 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e185649f36ed8b58a035ca1a53c26a16ce8b8619cd5903459e8190ea5bfdeb5d"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.requireApplyProperties (cognitive 51): compost-0.0.5.requireApplyProperties has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 5 (12 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6713d5bd18c3ea34c50044fee3c88fbb8d8d13dd73f61c14fda2633ee7603b20"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.requireApplyProperties (cognitive 51): compost-0.0.8.requireApplyProperties has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 5 (12 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc94fbe913603d071115839e883ec5012efd2ecfc8f4571bc5d4867641219c6a"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.requireApplyProperties (cognitive 51): compost-0.0.9.requireApplyProperties has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 5 (12 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e1e5011fa87c0027832a15abac2ae24ea3f2ea99a41573dd1a98222f379ab9"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.requireApplyProperties (cognitive 51): compost-0.1.0.requireApplyProperties has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 5 (12 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"443e1172ac879b33d36b73152de3036d9f3481665a73fdbef7815507a7631c6b"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.requireApplyProperties (cognitive 51): compost-0.2.0.requireApplyProperties has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 5 (12 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8c84d1a167c71002c30ff011c2e16166e417ac71ff6bcc5ee4c8483e26819f"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.requireApplyProperties (cognitive 51): compost-latest.requireApplyProperties has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 5 (12 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e848338d22c1abb167e1e5c241faeda117e3378d8dd06452cfacf93d28bc152f"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.requireVnode (cognitive 40): compost-0.0.11.requireVnode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 12, loops 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba452110689a502c3c50eba98d5b94f34efd5eab967dda5a3ee2e0c0c0f16a7"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.requireVnode (cognitive 40): compost-0.0.12.requireVnode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 12, loops 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5dad4dc17c89fd2b21c4563f5873e6770e8cd01c0c9edb702352ae84057aa02"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.requireVnode (cognitive 40): compost-0.0.5.requireVnode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 12, loops 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2278397e5e3bac0fbd84b40e71afdf177a98472ee05e8e1a0fdedff79866f8"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.requireVnode (cognitive 40): compost-0.0.8.requireVnode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 12, loops 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"1988d8000911034fb9c9fbc8a418766fe28fc3dba42598cb938fc1eca9f0cfb8"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.requireVnode (cognitive 40): compost-0.0.9.requireVnode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 12, loops 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"55883ba538c9081a98b4b35dcb055fa40b6e5baf8fee3e341522771b0db91e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.requireVnode (cognitive 40): compost-0.1.0.requireVnode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 12, loops 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2e2d2e67f1d6e663a8bf0c8c4df0931b04dd06c59e2eff32d10fd459e61f17"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.requireVnode (cognitive 40): compost-0.2.0.requireVnode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 12, loops 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69bb041dd31b89e68c7f260b5ed7d47580bda956e06c2550d670fec476778b7"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.requireVnode (cognitive 40): compost-latest.requireVnode has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 12, loops 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":"docs/releases/compost-latest.js"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"3212e28562073514a9b2b40aae0ea1bfa68bb8927b929bc7c735c4b720b23ed7"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.Scales_calculateScales (cognitive 34): compost-0.0.11.Scales_calculateScales has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 12 (24 pts), if/else 6 (9 pts), match/switch 1 (nesting depth added 15). Of this number, 17 points are the body\u0027s own statements and 17 belong to 7 function literals inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":4003}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75db76406b49d27a1f41be612aa905167bc94bf5d8161f5ea0908141dcd2664"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.Scales_calculateScales (cognitive 34): compost-0.0.12.Scales_calculateScales has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 12 (24 pts), if/else 6 (9 pts), match/switch 1 (nesting depth added 15). Of this number, 17 points are the body\u0027s own statements and 17 belong to 7 function literals inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":4006}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1a72e1f375b5bcfb984148d5fdeb5e1dacc17ae9058206218235c890f66c0c"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.Scales_calculateScales (cognitive 34): compost-0.0.5.Scales_calculateScales has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 12 (24 pts), if/else 6 (9 pts), match/switch 1 (nesting depth added 15). Of this number, 17 points are the body\u0027s own statements and 17 belong to 7 function literals inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":4003}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ee21cce8732a65f8163d0cf3c0302d04ba9904586e5a10b97bdab1a3a560b2"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.Scales_calculateScales (cognitive 34): compost-0.0.8.Scales_calculateScales has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 12 (24 pts), if/else 6 (9 pts), match/switch 1 (nesting depth added 15). Of this number, 17 points are the body\u0027s own statements and 17 belong to 7 function literals inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":4003}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4e21a673a88d506a044b8b537074d8133af8ce6d231299436e7e4813b00dae"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.Scales_calculateScales (cognitive 34): compost-0.0.9.Scales_calculateScales has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 12 (24 pts), if/else 6 (9 pts), match/switch 1 (nesting depth added 15). Of this number, 17 points are the body\u0027s own statements and 17 belong to 7 function literals inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":4003}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4a38316abc137535ab5241fd7f9df1ec743b795278667e7ca6aa22c9b1008d"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.Scales_calculateScales (cognitive 34): compost-0.1.0.Scales_calculateScales has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 12 (24 pts), if/else 6 (9 pts), match/switch 1 (nesting depth added 15). Of this number, 17 points are the body\u0027s own statements and 17 belong to 7 function literals inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":4039}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e645237bdc469e442bdbcbe2a4513238752a883fcc0252d9a4be2b328f1bca7"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.Scales_calculateScales (cognitive 34): compost-0.2.0.Scales_calculateScales has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 12 (24 pts), if/else 6 (9 pts), match/switch 1 (nesting depth added 15). Of this number, 17 points are the body\u0027s own statements and 17 belong to 7 function literals inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":4039}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3409b51c696d5db29d5086c2dafc692d876ed2ae127f48503086fb3ec73003"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.Scales_calculateScales (cognitive 34): compost-latest.Scales_calculateScales has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 12 (24 pts), if/else 6 (9 pts), match/switch 1 (nesting depth added 15). Of this number, 17 points are the body\u0027s own statements and 17 belong to 7 function literals inside it that branch. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":4039}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51ba40485d532ce8be953600d05faad4f71b220010ca53ef53ed0cc8daab9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.split (cognitive 33): compost-0.0.11.split has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (11 pts), boolean chains 5, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a0c99b5495ec62c55ba62ec3d3fbadef5704801fe34ff1e903f93e79a7218c"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.Enumerator_concat (cognitive 33): compost-0.0.11.Enumerator_concat has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 1 (2 pts) (nesting depth added 14). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1350, 1339, 1320, \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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ce44f4524d4c5fe319576f0aa456419e8ca0f4af30167fb9f4ebd87023e994"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.split (cognitive 33): compost-0.0.12.split has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (11 pts), boolean chains 5, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"9475efff204bfb79d307eb4815de76f2777985129f673ed6373f7809935090e2"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.Enumerator_concat (cognitive 33): compost-0.0.12.Enumerator_concat has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 1 (2 pts) (nesting depth added 14). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1350, 1339, 1320, \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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8532a3b8bde298b01a01aa1fd91744e17be93efae0b875074411766e0459c2"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.split (cognitive 33): compost-0.0.5.split has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (11 pts), boolean chains 5, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b27002728570d9f465cdfa2fd0af181157bb27979bf83f820808ec3fe35a139"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.Enumerator_concat (cognitive 33): compost-0.0.5.Enumerator_concat has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 1 (2 pts) (nesting depth added 14). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1350, 1339, 1320, \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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1d624291f6f56f90326752309b217f1a9c1f357d43e1d1e5afe1348e980414"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.split (cognitive 33): compost-0.0.8.split has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (11 pts), boolean chains 5, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac4c1abe7a4917819857419a6d0a029d70fd57c931af92050b88b4f631105c2"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.Enumerator_concat (cognitive 33): compost-0.0.8.Enumerator_concat has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 1 (2 pts) (nesting depth added 14). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1350, 1339, 1320, \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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"29aa3077bde4b8b88fe58ef96951c43ce46f316b82a0851e4d229037d4b2f452"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.split (cognitive 33): compost-0.0.9.split has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (11 pts), boolean chains 5, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e384ed600993eaf7f75bc01b636ee7b3d6057245ea9d983c41d8d469f168d0"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.Enumerator_concat (cognitive 33): compost-0.0.9.Enumerator_concat has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 1 (2 pts) (nesting depth added 14). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1350, 1339, 1320, \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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fb84e4d0032ab8c7f30d70986f06dbf4b84d2172d4d237f62d01a8128913a9"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.split (cognitive 33): compost-0.1.0.split has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (11 pts), boolean chains 5, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"d515cbfe3d53934928725f4bec013dd76c44bc115736850538d15d4027cc9137"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.Enumerator_concat (cognitive 33): compost-0.1.0.Enumerator_concat has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 1 (2 pts) (nesting depth added 14). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1350, 1339, 1320, \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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f8e8013a65de134ebddcbc981dabe1d1ae5ffa07819465927f8bbe9e86d16e"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.split (cognitive 33): compost-0.2.0.split has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (11 pts), boolean chains 5, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fba94eeb968d6c980c2636901f6683aa75b0a924fa92a7113fa4c40f38f6767"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.Enumerator_concat (cognitive 33): compost-0.2.0.Enumerator_concat has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 1 (2 pts) (nesting depth added 14). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1350, 1339, 1320, \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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"10621c26a84ed70df2f9bfcbca0c20e54a4f7b87c4dfc9e2f4dd18845c7b70f8"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.split (cognitive 33): compost-latest.split has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (11 pts), boolean chains 5, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3133b3a4b635fcaed327470a490c17a52e812fa79f9f21ba386968c49da32b"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.Enumerator_concat (cognitive 33): compost-latest.Enumerator_concat has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 1 (2 pts) (nesting depth added 14). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1350, 1339, 1320, \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":"docs/releases/compost-latest.js"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65b6565ce8b1e67cf3bd2f8168e9eebd3ce64b8c848e716e879c3334a97792a"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.requireVirtualHyperscript (cognitive 31): compost-0.0.11.requireVirtualHyperscript has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 2 (3 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a42d93518b18391cb357763e6fa3f03913588cbaf7deb74be520247a8fbfe6"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.requireVirtualHyperscript (cognitive 31): compost-0.0.12.requireVirtualHyperscript has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 2 (3 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"21154fdbee2d92a0aa45a926a6a2a3865fc245b058a38bcdcb075b80ae700774"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.requireVirtualHyperscript (cognitive 31): compost-0.0.5.requireVirtualHyperscript has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 2 (3 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3536369c106f76ee4a443841752ed923f220f07b7c06fef2c43f47f5ff118e"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.requireVirtualHyperscript (cognitive 31): compost-0.0.8.requireVirtualHyperscript has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 2 (3 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbfe7f5a02370196ff4b687a72d3c4d81794d5995594bc71efbde8f99a7e5fc"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.requireVirtualHyperscript (cognitive 31): compost-0.0.9.requireVirtualHyperscript has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 2 (3 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e86f32cf880e61356a675e4ef818629c98505bd1b674bf41931f282d3e7797"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.requireVirtualHyperscript (cognitive 31): compost-0.1.0.requireVirtualHyperscript has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 2 (3 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f34c6bd11e155e151792d6bcb919297c152aac428dc69ae02b436c6bbfd3048"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.requireVirtualHyperscript (cognitive 31): compost-0.2.0.requireVirtualHyperscript has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 2 (3 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"d448ede9d5a5daf09ef53d42127ce5e831fb58a1b8b88da809cb2924f042d03b"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.requireVirtualHyperscript (cognitive 31): compost-latest.requireVirtualHyperscript has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 2 (3 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":"docs/releases/compost-latest.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c3139c4f63fe3ee6d91db83ea605d6b4293ec7ad90e8929e336988cab29737"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.requireDiffProps (cognitive 30): compost-0.0.11.requireDiffProps has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"0082fd445239796f2dd7cf157f13dbdf3b4dcb27c08f8e7f6d3d48920bec6360"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.requireDiffProps (cognitive 30): compost-0.0.12.requireDiffProps has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7c44c2863d34858e36a8834f926e6de04e1419ad0868104f133025421a6812"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.requireDiffProps (cognitive 30): compost-0.0.5.requireDiffProps has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"598743b97c4520b9d6cd1b83f152b48f0294de5e10aaf6d062d26332e7b8eeaa"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.requireDiffProps (cognitive 30): compost-0.0.8.requireDiffProps has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"0797aca4b5be0da652e25b2e22ecb2f50785ca1572bdd555bb6d9c89b9819d16"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.requireDiffProps (cognitive 30): compost-0.0.9.requireDiffProps has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df1258985a3473617a5b484d84e7f0a0260754d4687b74f2b242eba04905518"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.requireDiffProps (cognitive 30): compost-0.1.0.requireDiffProps has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"177792b890f8047b551c0e255bc9060d91ac9f902c1de06bd0afc1d4f367db41"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.requireDiffProps (cognitive 30): compost-0.2.0.requireDiffProps has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37f435a5ce4c0ae641ae68ba21537ecd1b8e53a46cf06e9ffc2998171bd8e9e"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.requireDiffProps (cognitive 30): compost-latest.requireDiffProps has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, 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":"docs/releases/compost-latest.js"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"8146ff19f34040db03dce09e03e28772c4eb276840542debe8ac3adb969c5591"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.requireDomIndex (cognitive 28): compost-0.0.11.requireDomIndex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4e717d46458cdbe8b7d33c4302d729833e979cea3a5565a6472d5be0411797"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.requireDomIndex (cognitive 28): compost-0.0.12.requireDomIndex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dc4a91d6810a30e192f51ea810a6f7457d62eed815add9207c108d1e1b3fe7"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.requireDomIndex (cognitive 28): compost-0.0.5.requireDomIndex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f5146f955ffbacb7a7b10e1f7561e914d7dad4ac7e83c00655627b212b646b"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.requireDomIndex (cognitive 28): compost-0.0.8.requireDomIndex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7211d7b8a9c1581d2ca7e5c1b23958da055d18d55d2fa1c0b64d32dc6f3c84f"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.requireDomIndex (cognitive 28): compost-0.0.9.requireDomIndex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"867b89af6800aa034299bc499784080e319e4ab4bcd6c6eb93d99d6ea05ed971"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.requireDomIndex (cognitive 28): compost-0.1.0.requireDomIndex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cb07e6675b0b6d2031b7a3f56e8b7a25647f574fa0e5ac843bf4d2866a9467"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.requireDomIndex (cognitive 28): compost-0.2.0.requireDomIndex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcde263d391e7773431cb21c7aea2aae61741f62e096fab2cce5f5d324673543"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.requireDomIndex (cognitive 28): compost-latest.requireDomIndex has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"docs/releases/compost-latest.js"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"181b9e832448c4801f8d96bd955421c1efb00515e8597eaea7e0e1e8d4aac938"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.requirePatchOp (cognitive 27): compost-0.0.11.requirePatchOp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 6, loops 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c82145cbc9714d86bfe952a53e730d8b015b228792e722d2422c66dca7527ac"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.requirePatchOp (cognitive 27): compost-0.0.12.requirePatchOp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 6, loops 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"9901fc63d79e9ce4802f8e2bb2468e2a74420da79b0a000297688f78eac23e96"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.requirePatchOp (cognitive 27): compost-0.0.5.requirePatchOp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 6, loops 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95617a68cf54cbcd1d2bacf19a2b12211c6d8f113e3bb4f412efc76e3ce9f71"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.requirePatchOp (cognitive 27): compost-0.0.8.requirePatchOp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 6, loops 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6f1b9b0194ced93136f30fd3ac66eb73d5e0063811e9f86d43b85b93158a12"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.requirePatchOp (cognitive 27): compost-0.0.9.requirePatchOp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 6, loops 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"764ae771543bade0c6f95ed6ec7039a7d7b930abc6caecb077cf8cb8f65e1d2e"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.requirePatchOp (cognitive 27): compost-0.1.0.requirePatchOp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 6, loops 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58869bf1a4cce7a4d9fefa2ab8a36daf7617b86ed87563563b23ca8522147c4"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.requirePatchOp (cognitive 27): compost-0.2.0.requirePatchOp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 6, loops 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb557ca9ad506fa14d9aaadf50de37a1769929ae9cf58e1602920da5972b15c"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.requirePatchOp (cognitive 27): compost-latest.requirePatchOp has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 6, loops 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ebbd5d2432aa1edd8b0e7e129995bccea1ac0d33cfb3167cceee04e198517e"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.formatReplacement (cognitive 26): compost-0.0.11.formatReplacement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c09757cb4544a9870bdf4366e54ea00ed343836feacc6be9198ffd9e45b3c93"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.formatReplacement (cognitive 26): compost-0.0.12.formatReplacement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3388f927acb47253d4075e96851800df679ba7616c71da9d11d29e15e4f0ec"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.formatReplacement (cognitive 26): compost-0.0.5.formatReplacement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"653d139b7b6db896fad016e85e6e82f22cf3a4775c539c9aa85124e819d79104"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.formatReplacement (cognitive 26): compost-0.0.8.formatReplacement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0488d55bb2a61571a6e156c567929af2f5e498b99799852b7ea56e262cc69e0"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.formatReplacement (cognitive 26): compost-0.0.9.formatReplacement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1b1df2a06557ab21b6518d54a012d64a12103f0e1e92de34958089643f1008"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.formatReplacement (cognitive 26): compost-0.1.0.formatReplacement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"50040e2a285e7598dd908ccd73dd4d51030860b9d030fe61c229bb1588a0d97e"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.formatReplacement (cognitive 26): compost-0.2.0.formatReplacement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b1e9e6eda5445d7e8702384f0c45a2e6c97f3382f494bc4269a98607999791"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.formatReplacement (cognitive 26): compost-latest.formatReplacement has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d5b4aa904c5b8f1288cd3738576511d6c3f88fdfe135626e6dffebdc097328"}},{"ruleId":"D2","level":"warning","message":{"text":"Events.triggerEvent (cognitive 24): Events.triggerEvent has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 3 (7 pts), loops 2 (5 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/core.fs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e6e629932ce8ce9b7d5ba3ead99c4058dd24ebf95e7de4e8d84cc1a2f03e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.requirePatch$1 (cognitive 21): compost-0.0.11.requirePatch$1 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 3 (4 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fd33727478285d9dc769fc4a147e291b3eda9b40032dee909c92c319cc38d2"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.Drawing_drawShape (cognitive 21): compost-0.0.11.Drawing_drawShape has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 2 (4 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e784ecfe1e600d72a5eab371381b700e6434d9e6e7128c1211ccd3d3fb0216"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.requirePatch$1 (cognitive 21): compost-0.0.12.requirePatch$1 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 3 (4 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"49359cf16978ba30c88a73dc7545fc42a36fc33b9e8429a9c75da8e9b92c6a84"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.Drawing_drawShape (cognitive 21): compost-0.0.12.Drawing_drawShape has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 2 (4 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":4196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9757e825986adcdfd68ce1fcf4f90b2484559c27f6201f611789d72fd01fd13c"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.requirePatch$1 (cognitive 21): compost-0.0.5.requirePatch$1 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 3 (4 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"e504185a79318829e0bebd03521f2608f859e5750d680743b01ffb85ba75cb95"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.Drawing_drawShape (cognitive 21): compost-0.0.5.Drawing_drawShape has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 2 (4 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9274cfa1e78d8ee8cc3bb8d4942a511890b32bb6db823266523c7e8ea9ff652d"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.requirePatch$1 (cognitive 21): compost-0.0.8.requirePatch$1 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 3 (4 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ae3a5ce74de43b9b40c25400645fd2d6d9d80145979dc7884d5ae07cf2d363"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.Drawing_drawShape (cognitive 21): compost-0.0.8.Drawing_drawShape has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 2 (4 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ffc7890e7ff14af8944241967a6d1f50f80a0844e03f526df1399c22155209"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.requirePatch$1 (cognitive 21): compost-0.0.9.requirePatch$1 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 3 (4 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"7821192679bc82ad6672f682128cf4e7532323872c058bb943cbe08c2dbd92c5"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.Drawing_drawShape (cognitive 21): compost-0.0.9.Drawing_drawShape has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 2 (4 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e1d4541aaa3461ed2f1002c93d90dc07e51381b16963818a622a2ab43c1b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.requirePatch$1 (cognitive 21): compost-0.1.0.requirePatch$1 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 3 (4 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cf37578bf801281192bbfb0b0049a1085738757470632054456511074c73ee"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.Drawing_drawShape (cognitive 21): compost-0.1.0.Drawing_drawShape has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 2 (4 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":4229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0d5d70375c6c4186f75c5fe39a625c133ec49bb3193cb5d7d175447f85ee04"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.requirePatch$1 (cognitive 21): compost-0.2.0.requirePatch$1 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 3 (4 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29ef5c5c810c0e08c38329b3bf1eb759f326f55a3471aab325edb7695dec0bb"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.Drawing_drawShape (cognitive 21): compost-0.2.0.Drawing_drawShape has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 2 (4 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":4229}}}],"partialFingerprints":{"codehealthFindingId/v1":"85667bebc56085234cbfe4a0be282d1935cab212f2e813e20fdcf73bf21cd738"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.requirePatch$1 (cognitive 21): compost-latest.requirePatch$1 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 3 (4 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":"docs/releases/compost-latest.js"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd8ad09b74d156658ee576beaa05d376b4c0758465c621d38bac9eb748b654b"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.Drawing_drawShape (cognitive 21): compost-latest.Drawing_drawShape has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 2 (4 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). 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":"docs/releases/compost-latest.js"},"region":{"startLine":4229}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa14d1d44cb2bd3aab627be6a2b20e25343ac7f0a66620cd11e6141bef1cc7b"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpList.Equals (cognitive 20): FSharpList.Equals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 946). 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"324dea4375df2d74a07962e019c7de06dee00ae1ca8d58aebe38c82c98c95e15"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpList.Equals (cognitive 20): FSharpList.Equals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 946). 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"edec92706e50710bb1482edadf8af511808118f3242b29526b1ee66d46d3c478"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpList.Equals (cognitive 20): FSharpList.Equals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 946). 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f126501c4e247651fcbebcdf1f467391bce066c470245fefcd78de7fde653e9"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpList.Equals (cognitive 20): FSharpList.Equals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 946). 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc11a10330f54918bc6b2065e1b89d8e2b1fffb8e5bd9d317ea657055b2c1a6"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpList.Equals (cognitive 20): FSharpList.Equals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 946). 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"826a2eda6595c0575e647fff0df8a3b839aa071cab1ff67f0535ce41256959a8"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpList.Equals (cognitive 20): FSharpList.Equals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 946). 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f6f9d5b7106f687b55b20fa92393072bb936e73980ebf76a8294b798a5a495"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpList.Equals (cognitive 20): FSharpList.Equals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 946). 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b887b2f7285f9f175eab12748cb9e7fb65f15ccc2780a88d9e219ec1cc42941"}},{"ruleId":"D2","level":"warning","message":{"text":"FSharpList.Equals (cognitive 20): FSharpList.Equals has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 946). 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":"docs/releases/compost-latest.js"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f26d329e8d08dbf621449ffdc5c80f4664cf9e4c80766795d1f6679f94475e"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.compare$1 (cognitive 18): compost-0.0.11.compare$1 has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 8 (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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b129ef7d40c729b6a106b3a26c84aefd03ee87c4fe9f4636b550f4916b3eb09"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.compare$1 (cognitive 18): compost-0.0.12.compare$1 has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 8 (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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b55fee12cb95addbe121f7e241bbe77c2ab0c2c33d4a199832921a4f3902738"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.compare$1 (cognitive 18): compost-0.0.5.compare$1 has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 8 (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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"83039dc26b9a542571c9f43dc04ee2fccc62dcd05c8654478fc44a05d1ad5915"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.compare$1 (cognitive 18): compost-0.0.8.compare$1 has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 8 (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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c641958bc05909e57f0d2366e2b5b3d5b4e46cbf6338a975c0c50a015a7e89b3"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.compare$1 (cognitive 18): compost-0.0.9.compare$1 has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 8 (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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbeccc61696a6164bb3d0e17de868e854dbfdb2368b01f6fda3dd543b5ca80b"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.compare$1 (cognitive 18): compost-0.1.0.compare$1 has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 8 (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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb0eca8c996ac135e221d95cded6ff4c5e8e18c781e91ad06cffaa1bc1b77e2"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.compare$1 (cognitive 18): compost-0.2.0.compare$1 has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 8 (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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8658164de8fcb7c6f93bb502e74add118b8a825cb8d7bf687aabccda4d0846"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.compare$1 (cognitive 18): compost-latest.compare$1 has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 8 (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":"docs/releases/compost-latest.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfe0cb9662c5af412f90717917a86a4e5c0d2034f4fe52b5ce77e39ac7778c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Projections.projectInvOne (cognitive 17): Projections.projectInvOne has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/core.fs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f9d398f90ba8c2c116ea463011d4641bc81d8a0d1a1d8dde44e98a054d0ae5"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.requireParseTag (cognitive 16): compost-0.0.11.requireParseTag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f849d66ef0f117d8d79af96741026a512fa20d5a6f8962e0b46ce5cf79e328"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.11.Events_projectEvent (cognitive 16): compost-0.0.11.Events_projectEvent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":4347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b80e4cca4af3dafd82826c909d7984ce1c365d23c530aeb35dc39679432a18b"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.requireParseTag (cognitive 16): compost-0.0.12.requireParseTag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"208bead1e6162e7e63ce09fc99b2fb10d2a843cd4b288a7f04d1d4a0b062da56"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.12.Events_projectEvent (cognitive 16): compost-0.0.12.Events_projectEvent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":4364}}}],"partialFingerprints":{"codehealthFindingId/v1":"f956fb05b7b241af35a8b64ab2961713ca222dc94a23455f38fd0623fb744b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.requireParseTag (cognitive 16): compost-0.0.5.requireParseTag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3308db07f94e8caf7d272a589b24b9bc8539b6a8995a355adbeadae7dfe5bae"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.5.Events_projectEvent (cognitive 16): compost-0.0.5.Events_projectEvent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":4347}}}],"partialFingerprints":{"codehealthFindingId/v1":"a228c6795b59598f8dfa9dd0f7e85571363c7d1273835f0f7fc892d6bedbb4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.requireParseTag (cognitive 16): compost-0.0.8.requireParseTag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"de842044ed8dcacffede9b767fc6c903db0cf6f9c8d8d2558215f5ab54dd0793"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.8.Events_projectEvent (cognitive 16): compost-0.0.8.Events_projectEvent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":4347}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd56699484f7a3ae9c320fc91b6f750b62672646bd1a80c8f8ffa7e2fd1cdeb"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.requireParseTag (cognitive 16): compost-0.0.9.requireParseTag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60e44713ce73d817098348c4c793c840477a6c7cf7acce9e266d54a5ac9c30c"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.0.9.Events_projectEvent (cognitive 16): compost-0.0.9.Events_projectEvent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":4347}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e02e39fd4c2b40b70e032ca0c94b27cb224a512f2a57ae448c7020c7c93520"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.requireParseTag (cognitive 16): compost-0.1.0.requireParseTag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4f0ade67f3f3ce482b031de2e72cd0606b9f8f8bf6ef78c2ee43c095d4ee56"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.1.0.Events_projectEvent (cognitive 16): compost-0.1.0.Events_projectEvent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":4397}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d598a3793a1de331f64550d48f18e2d59b6a4544cc5d5acaad67e8810f34a4"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.requireParseTag (cognitive 16): compost-0.2.0.requireParseTag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c04ed2aeef508c1ae5dc77d2042c514b8bbb2e83c4c6f569cdc855d92376167"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-0.2.0.Events_projectEvent (cognitive 16): compost-0.2.0.Events_projectEvent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":4397}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad087cff96f036ff867ce64f70dbdffe1ec082fba726c8d2fac609ee94ff039"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.requireParseTag (cognitive 16): compost-latest.requireParseTag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"6378b960f47caab721fb7721a11adeb40158497eaa9622e6d0eb6b529542023d"}},{"ruleId":"D2","level":"warning","message":{"text":"compost-latest.Events_projectEvent (cognitive 16): compost-latest.Events_projectEvent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":4397}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38c21a19f410cf47241e20e8d23e731f9a92661451dff5475ea1524531dd89a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: releases/compost-0.1.0.js: FileTooLong \u2014 4120 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3620 over it, 8.24\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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d618aec2f6dea0a801b6d419b7adffa44c5e44d023c9e948e55a887ebf48f293"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: releases/compost-0.2.0.js: FileTooLong \u2014 4120 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3620 over it, 8.24\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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff75667a7862790d85ced91a489344023bacf6e16b50976e769673de06cec6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: releases/compost-latest.js: FileTooLong \u2014 4120 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3620 over it, 8.24\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":"docs/releases/compost-latest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6542bc5a3468e9bd5db756a5e394ca782969f145652eb3a0605fc0773dd36cc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: releases/compost-0.0.12.js: FileTooLong \u2014 3867 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3367 over it, 7.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaf04d30d3c7b518e9399d4a874640536cafb192599018145f91a25806b320f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: releases/compost-0.0.11.js: FileTooLong \u2014 3846 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3346 over it, 7.69\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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cb634cff78236564a6d68959ad6ea1e4056bf37d08428a55aa7865ece09009"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: releases/compost-0.0.5.js: FileTooLong \u2014 3846 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3346 over it, 7.69\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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae70c9a469e2e6844dcc71fcd627b3ffff244310ba8266887307c8fe732852cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: releases/compost-0.0.8.js: FileTooLong \u2014 3846 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3346 over it, 7.69\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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"092687a945fbe96146f9e429d1484475fa30dbf14272421566ef5db45693f4f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: releases/compost-0.0.9.js: FileTooLong \u2014 3846 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3346 over it, 7.69\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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c17a362e102b43781aa02e3dde7c9143ee2827d036f9f17919eb8c294c6067"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.11.requireDiff$1: FunctionTooLong \u2014 requireDiff$1 runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"7836b92d19c7140126c0a12f99da9ebc8a61745683f8e985e96b82ebfae30b21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.12.requireDiff$1: FunctionTooLong \u2014 requireDiff$1 runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"6313e7d1dcb32a17b7eca660261198be1d8629319d5d70c5e8792744f64675b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.5.requireDiff$1: FunctionTooLong \u2014 requireDiff$1 runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"0648b9220d0e7b8b0da9bb08bc7d03b9beb014726ebc7dbd35163258de8af16b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.8.requireDiff$1: FunctionTooLong \u2014 requireDiff$1 runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"617065957dacb95e4d87e71423ffd4c6c9fe2e76e794d92249d237e39b073169"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.9.requireDiff$1: FunctionTooLong \u2014 requireDiff$1 runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"7393f7f1adb256ff75a10d5836fbaaab8dbecff658c485e8ee7bc6d8688aaf4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.1.0.requireDiff$1: FunctionTooLong \u2014 requireDiff$1 runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"40457216e807cd945817003460e76646fc7f1b90380b806973eb8759d25ef09f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.2.0.requireDiff$1: FunctionTooLong \u2014 requireDiff$1 runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"1708f038538cdf13c4b0095b65434203e8491e26885db08e9268a499a02d7caa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-latest.requireDiff$1: FunctionTooLong \u2014 requireDiff$1 runs 253 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\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":"docs/releases/compost-latest.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"852f1f5a7064518a3171f36ae8cb2bb6abec1cf39d5e57704259752432dc86ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.11.Events_triggerEvent: FunctionTooLong \u2014 Events_triggerEvent runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"8126e8695e6aff2084f094393f4420c50136c9795f20e2d5965ba7b78d7d8225"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.12.Events_triggerEvent: FunctionTooLong \u2014 Events_triggerEvent runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":4469}}}],"partialFingerprints":{"codehealthFindingId/v1":"26161a95a4caa0ee1e81bb2abab6923b20b2676ed65028e50d58b035a1088e7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.5.Events_triggerEvent: FunctionTooLong \u2014 Events_triggerEvent runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1774d99200aa8a000b5aa8b17a1b375dd266668ee7d7f0511510c5948d26230"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.8.Events_triggerEvent: FunctionTooLong \u2014 Events_triggerEvent runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d419a4afc0953c90da8261b73341cd302344a87f128f0ac18a9ac121a61c498c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.9.Events_triggerEvent: FunctionTooLong \u2014 Events_triggerEvent runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":4452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45e0ba93c8c4c4ca0320dc17e68bf0afbb5221c25ed1821fcaf014a5cf7f341"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.1.0.Events_triggerEvent: FunctionTooLong \u2014 Events_triggerEvent runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90fd136eb345a01a5055e685d85b457cc635fa7a129226fd0336f210912c819"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.2.0.Events_triggerEvent: FunctionTooLong \u2014 Events_triggerEvent runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"55599c248cc43b8c63115dbdcf009db0e5060b75fc8cb0cff2816eac7a6362eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-latest.Events_triggerEvent: FunctionTooLong \u2014 Events_triggerEvent runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"docs/releases/compost-latest.js"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a7cda31fda22be0cb0ac14f65c10e46948f4649bb4adaf8962736643492e97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compost/core.fs: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 154 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/core.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9e91c8cd5f1251d32d9bda108647969b3edee6e6842280a3456f6cbcd793f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.12.Drawing_drawShape: FunctionTooLong \u2014 Drawing_drawShape runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":4196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9279fd5809bcf5ae38dddebcb90a6b2dbc624d4b54214dd5ce0350f848822a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.1.0.Drawing_drawShape: FunctionTooLong \u2014 Drawing_drawShape runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":4229}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd8f566453c6d00f7c492a88a084b421190cf3db29e81c5a2067a4cdb8c28e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.2.0.Drawing_drawShape: FunctionTooLong \u2014 Drawing_drawShape runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":4229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc783e43a7cfd5031b120c18709aa1aa58b25c755bc5658140253aa083e7f1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-latest.Drawing_drawShape: FunctionTooLong \u2014 Drawing_drawShape runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":4229}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca5b54822de9cc8c67dcda63f90b7ae52f1363626f0e468c3702ca48e3c62cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.11.Drawing_drawShape: FunctionTooLong \u2014 Drawing_drawShape runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f6eedcf92dd8ed71f55a393e1ab31a89ce88d292535227c2195bba151f1e6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.5.Drawing_drawShape: FunctionTooLong \u2014 Drawing_drawShape runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a74d7ff70c206508484f062448e23b7ec4766ddc9d45107bc273cb71b5ba85"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.8.Drawing_drawShape: FunctionTooLong \u2014 Drawing_drawShape runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17596036b9434e0e2e48fcf2112a7bfc5bb6ae7012e3608a63cf4abd2756097"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.9.Drawing_drawShape: FunctionTooLong \u2014 Drawing_drawShape runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":4188}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ec79884445ed371621893cc80670d8623c73aec79b562b773e490aaa367b52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.11.requirePatchOp: FunctionTooLong \u2014 requirePatchOp runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.11.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5d5251716b1e4c99009f22b3ed12289c811d9301dde3c72a81f280519b9c7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.12.requirePatchOp: FunctionTooLong \u2014 requirePatchOp runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.12.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c321fb7dbdd061bd675159c5f416e6161b800b847a07c515796bd56091f76338"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.5.requirePatchOp: FunctionTooLong \u2014 requirePatchOp runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.5.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46f30bef4bd2faa2198a371fbeef741cf4b7880e0e32c208fb656095ac8aef5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.8.requirePatchOp: FunctionTooLong \u2014 requirePatchOp runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.8.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17000403d4010133bcfc0545dfb5c563a237c1623937513cb4e50d29fdfefce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.0.9.requirePatchOp: FunctionTooLong \u2014 requirePatchOp runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.0.9.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96aee396f07f24f0803e6bd3ba42e5403d87b18b7140ae83a188f539f8712f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.1.0.requirePatchOp: FunctionTooLong \u2014 requirePatchOp runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.1.0.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a803800f8a2023bc1497b79f385ebe463f32e5ad8d3f2f73f2b2bcff9f1770b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-0.2.0.requirePatchOp: FunctionTooLong \u2014 requirePatchOp runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-0.2.0.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"6369f090cd8b0a4f545f7008c192fac637f9daf7bf66d15b758c6e53ab792e32"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: compost-latest.requirePatchOp: FunctionTooLong \u2014 requirePatchOp runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/releases/compost-latest.js"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e8fc1de125914b190969e606acf2641cef59a669c3ae2657132a92ae6b2ac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/compost/core.fs:531-547 | src/compost/core.fs:634-650 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/core.fs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79d87488fbce8b791959e5632c2892b9eeedb189b68d3611d8485c65e3862f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/compost/html.fs:163-170 | src/compost/html.fs:186-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/html.fs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"850909b5a70209486d7e4e807aaa0cd5807a97a991b94685c5ac3cc1ecdf5ae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/compost/core.fs:741-747 | src/compost/html.fs:81-87 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/core.fs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb9080f2f2180496f7436e0877537ec545202197ce45acd950b5832daebe6b9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HashSet (LCOM4 17): HashSet\u0027s methods fall into 17 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 17 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":"docs/releases/compost-0.0.11.js"},"region":{"startLine":3396}}}],"partialFingerprints":{"codehealthFindingId/v1":"0add8e252a93f6af6ade4cb5ec3ad6dd509727f5feb9078771aa52e1532acf54"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HashSet (LCOM4 17): HashSet\u0027s methods fall into 17 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 17 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":"docs/releases/compost-0.0.12.js"},"region":{"startLine":3396}}}],"partialFingerprints":{"codehealthFindingId/v1":"728ab45b5a39a066d9c24105f727c2c4baa6c800193a4bff11cc5e36fe16fee3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HashSet (LCOM4 17): HashSet\u0027s methods fall into 17 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 17 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":"docs/releases/compost-0.0.5.js"},"region":{"startLine":3396}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee1546014832ba586dc2e2e59a1eb93471758e222d532710eb8a2a9f0e5621e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HashSet (LCOM4 17): HashSet\u0027s methods fall into 17 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 17 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":"docs/releases/compost-0.0.8.js"},"region":{"startLine":3396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2979ed04720030e25ab56f047565511352b439de6d11fca28185abec9b7dcb6b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HashSet (LCOM4 17): HashSet\u0027s methods fall into 17 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 17 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":"docs/releases/compost-0.0.9.js"},"region":{"startLine":3396}}}],"partialFingerprints":{"codehealthFindingId/v1":"58648b00218f818377ce76c5417d760809b65818026fc9cd3165066be05a2fb5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HashSet (LCOM4 17): HashSet\u0027s methods fall into 17 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 17 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":"docs/releases/compost-0.1.0.js"},"region":{"startLine":3403}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd77df566f9b7022245e10cb08f8ddd8ba14b77250fe5ac4b9f4981b36ae8dd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HashSet (LCOM4 17): HashSet\u0027s methods fall into 17 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 17 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":"docs/releases/compost-0.2.0.js"},"region":{"startLine":3403}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9a908af7d76775deb641ac631e7393ef23169234e07af1959e137d1f3b4bb8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HashSet (LCOM4 17): HashSet\u0027s methods fall into 17 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 17 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":"docs/releases/compost-latest.js"},"region":{"startLine":3403}}}],"partialFingerprints":{"codehealthFindingId/v1":"634fe7e902feba33bd35898762bb464d94cd9a84c9ec38450d28f04eab642808"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the repository root runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/releases/compost-latest.js: docs/releases/compost-latest.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in compost-latest.Events_triggerEvent at line 4502. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2025-12-18..2026-03-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272025-12-18 23:59:32 \u002B01:00\u0027 --until=\u00272026-03-18 23:59:32 \u002B01:00\u0027 --full-history --no-merges -- docs/releases/compost-latest.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":"docs/releases/compost-latest.js"},"region":{"startLine":4502}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5780cd6bbb55d487c32240f31b514f618bb2a0d30d9f26669062184b1670df3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/compost/compost.fs: src/compost/compost.fs changed 4 times in last 90 days, max cyclomatic complexity 25 in Serialization.serializeShape at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2025-12-18..2026-03-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272025-12-18 23:59:32 \u002B01:00\u0027 --until=\u00272026-03-18 23:59:32 \u002B01:00\u0027 --full-history --no-merges -- src/compost/compost.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/compost.fs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a653d16c4c2c672db8812ece90b6f44ab41adbf47872bf6bb53e4943a5a57fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/compost/core.fs: src/compost/core.fs changed 2 times in last 90 days, max cyclomatic complexity 41 in Scales.calculateScales at line 317. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2025-12-18..2026-03-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272025-12-18 23:59:32 \u002B01:00\u0027 --until=\u00272026-03-18 23:59:32 \u002B01:00\u0027 --full-history --no-merges -- src/compost/core.fs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compost/core.fs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"27878410390ef41d8b30630bae5fd7809075c72e2b7d286bc0489252083a7739"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (44775 LoC, 373 module-visible types across 5 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":"b923d2a6d4bf9f3d17a069114b8d29dce8e6bc49ce4ae2931de0efd9a515de40"},"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":"35a1ff207129179ed16391b17da2aac2c13e6230d8ec78d33a35b415fc4e244f"},"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":"12457d83dafe7797f63429e65d46438243fefd6e566f0e7068ad839750f52a5c"},"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":"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":"d3882d8f5ede49b4559d7821267f317a4d93792aa6769c400b1a3b03bef6989f"},"properties":{"dependency":{"package":"vitest","version":"4.0.18","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"test/compost.test.js","line":1}}}},{"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":"a39a021ec66f5261d0cb19f88ef354f73bd671d730442cfbdc62290469f6eece"},"properties":{"dependency":{"package":"minimatch","version":"10.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[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":"5a31a0b5364830f542d37385755d27dd90f97746286a80cb6c17836bc6e14179"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","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":"a2e781aeeb54d3ae845ae518d9f9b4fabc9ce4afb31ec2d5eceab2c30473e850"},"properties":{"dependency":{"package":"nanoid","version":"3.3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[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":"817e529e23b3ec1d8c906c054e519b06f7636dc642a17c715e350e917222174d"},"properties":{"dependency":{"package":"lodash","version":"4.17.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":"a1e03b14734319d875bd0dac1f97ef300c97b23c9a470ff6af28213112e543c4"},"properties":{"dependency":{"package":"postcss","version":"8.5.6","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":"77bfb0c3bbbdb1bc1801064f6b0e6247063a846f7d74e7ade8312f0d2eab9055"},"properties":{"dependency":{"package":"ansi-regex","version":"3.0.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":"38308ad9567d8e341670856609598db5e8aff1ac165d030e1ee411b5a1fded4b"},"properties":{"dependency":{"package":"ansi-regex","version":"4.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":"4c3013fd54f8d3b956274842936cf9a9f2caf172c2e610d10ef7fb3be926ee00"},"properties":{"dependency":{"package":"ansi-regex","version":"5.0.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":"8a3ed1507b8ff23e74ae9234c00b2c40cd19291b56f6f6d1967e5de2237ed8d5"},"properties":{"dependency":{"package":"picomatch","version":"2.3.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":"a4aab4796dac60ba3a1100dd7b89c6fc5cc569be6eea7d6975a06ca4b375842b"},"properties":{"dependency":{"package":"picomatch","version":"4.0.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":"6938b174663ea9622818abd4e2c439d5ee9201adfe9f888506c6daf0e8ecae62"},"properties":{"dependency":{"package":"vite","version":"6.4.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"vite.config.js","line":1}}}},{"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":"2a97b7f163f2008119363b8420b4cfa12eea98423470b15ce1ecb79adbbd8728"},"properties":{"dependency":{"package":"rollup","version":"4.57.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":"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":"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":"ecb1107154e802ec55ca85cdbe70d70a0d97d489f92c05a139296378c387cde9"},"properties":{"dependency":{"package":"yaml","version":"2.8.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":"0a4dc13babfb2382446738b7540a2c2019b1f55765a2673688297cc2c443d2bc"},"properties":{"dependency":{"package":"@vitest/mocker","version":"4.0.18","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":"489042e8b28eefef3157ce42bc285cf3896c5462fef88063313d58332f4ee390"},"properties":{"dependency":{"package":"min-document","version":"2.19.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"69a115ceae9b824becd13280b353d09967ea287b4fd3c73d2774b400a9974864"}},{"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":"9658270ba49f37ed04e99ab1263b6393cd42aed8bdfb7aafd9fa1070f5491895"}},{"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":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c03112092084821eb10323780c41f92cd64c7f4713debc46d9031ab90eaa76"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca8b3b55f9d138b8c9f0577d35d661cb89cee34244279316ffaeaec346fd011"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"732c4587b5831e9d9da4b05f6bb12d9a8a817ddcc0ff07809f91bca0b3a52697"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no a11y linter (an accessibility check that can read your UI \u2014 no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have) and no axe/pa11y/Lighthouse in tests or CI. Start by running that check over your rendered pages in CI. What was searched, so you can tell an absence from a miss: the 13 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"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 \u0060semgrep --config=auto\u0060 plus gitleaks for committed secrets (F# is not a CodeQL language and has no language-specific SAST engine) as a CI step. What was searched, so you can tell an absence from a miss: the 422 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":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"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-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":23,"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."]}]}