{"$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":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"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":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"BumpFormulaPr.run (cyclomatic 112): BumpFormulaPr.run has cyclomatic complexity 112 (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":"Library/Homebrew/dev-cmd/bump-formula-pr.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"699c3950098e8fb4ae0bb9ac6728fe50e7ba56f933b025d774a675123ad7b2d6"}},{"ruleId":"D1","level":"warning","message":{"text":"Livecheck.latest_version (cyclomatic 112): Livecheck.latest_version has cyclomatic complexity 112 (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":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"061e2898e55e9ea30416b26aa8d2fb03ce3d31ffae8713a5c91a6d7df2003ef9"}},{"ruleId":"D1","level":"warning","message":{"text":"List.run (cyclomatic 93): List.run has cyclomatic complexity 93 (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":"Library/Homebrew/cmd/list.rb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bede14c02a796a833516250a2aa051c7a15c4ec3c987ab3d682dd6af6b52ba"}},{"ruleId":"D1","level":"warning","message":{"text":"Livecheck.run_checks (cyclomatic 90): Livecheck.run_checks has cyclomatic complexity 90 (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":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98dc34e2b1626d02bd94bd7f92ecf52415ade7569335cee0b2683426d72b7f3"}},{"ruleId":"D1","level":"warning","message":{"text":"AdvisoryMatch.run (cyclomatic 88): AdvisoryMatch.run has cyclomatic complexity 88 (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":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d2856dc45af4070491b1e1bd7a1b2fe8d85ae32d8f9772d71c041b6b37e3b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Livecheck.resource_version (cyclomatic 86): Livecheck.resource_version has cyclomatic complexity 86 (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":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c718db1cbf8f1adb0b4b74c67bb19753b40df2c8cddd3339aa2c1aa3fc5534d"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.run_install_step (cyclomatic 84): Runner.run_install_step has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/install_steps.rb"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1f3a52a99bdf3cc6b5d438eedad740530cd8c01577aac6c53600aa488ce775"}},{"ruleId":"D1","level":"warning","message":{"text":"Bump.retrieve_versions_by_arch (cyclomatic 82): Bump.retrieve_versions_by_arch has cyclomatic complexity 82 (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":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ae5f0e664b57942a20df1140f6370a0ff0e8612660f34e22ba82adea10f81f"}},{"ruleId":"D1","level":"warning","message":{"text":"PyPI.update_python_resources! (cyclomatic 77): PyPI.update_python_resources! has cyclomatic complexity 77 (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":"Library/Homebrew/utils/pypi.rb"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e70aa50fb48495af1e40cca2149c99d0839b33d8249058cd54c3bd8237717a"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateReport.output_update_report (cyclomatic 75): UpdateReport.output_update_report has cyclomatic complexity 75 (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":"Library/Homebrew/cmd/update-report.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7760f1d75e10b1f7c556f584dc552a03e5cf3b919b689de07ef4795f63ce67f8"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaAuditor.audit_deps (cyclomatic 72): FormulaAuditor.audit_deps has cyclomatic complexity 72 (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":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c880b5f6e43ae018237f8f4f941f8990cc8e91351a5dba0a093bfa6a7fc6e6a"}},{"ruleId":"D1","level":"warning","message":{"text":"Bump.retrieve_and_display_info_and_open_pr (cyclomatic 71): Bump.retrieve_and_display_info_and_open_pr has cyclomatic complexity 71 (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":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfecdb2b27c654be037e413ab426d12bcf12e41429a685b063c3126e9a77c687"}},{"ruleId":"D1","level":"warning","message":{"text":"Bottle.bottle_formula (cyclomatic 67): Bottle.bottle_formula has cyclomatic complexity 67 (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":"Library/Homebrew/dev-cmd/bottle.rb"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc6fd49550e49c659296472a4b6e27b5d386893e618642fa8243956eaa4499e"}},{"ruleId":"D1","level":"warning","message":{"text":"Audit.run (cyclomatic 66): Audit.run has cyclomatic complexity 66 (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":"Library/Homebrew/dev-cmd/audit.rb"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae289586510a7f962c1871aa92cd6aee15878ed1e0d3de9181ca23ec76cd248c"}},{"ruleId":"D1","level":"warning","message":{"text":"Info.info_formula (cyclomatic 65): Info.info_formula has cyclomatic complexity 65 (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":"Library/Homebrew/cmd/info.rb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f96cad264f6e75052520f2cde67f7275994f9c19a332ec9a8a310fe1fb7814"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallCmd.run (cyclomatic 64): InstallCmd.run has cyclomatic complexity 64 (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":"Library/Homebrew/cmd/install.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8781acc61510822167a2a0e85c7d0c13de9a15e90784ea3da9d912e0c3a85b29"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaAuditor.audit_specs (cyclomatic 64): FormulaAuditor.audit_specs has cyclomatic complexity 64 (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":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"d265aa492dbcf69227c4c43ae94da520d73f49f0461cd6d19967073b83ffae50"}},{"ruleId":"D1","level":"warning","message":{"text":"Influx.query (cyclomatic 64): Influx.query has cyclomatic complexity 64 (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":"Library/Homebrew/utils/analytics/influx.rb"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe17ec44b5f2e2fd8f559cefa3df38a3aa4160d82b432af1e0ae821b73bc350"}},{"ruleId":"D1","level":"warning","message":{"text":"Repository.rows (cyclomatic 64): Repository.rows has cyclomatic complexity 64 (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":"Library/Homebrew/utils/analytics/repository.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bf13c000f393a7b21c814ed40d55e71ed82c32b155303353e1d52107eaa515"}},{"ruleId":"D1","level":"warning","message":{"text":"Audit.audit_signing (cyclomatic 61): Audit.audit_signing has cyclomatic complexity 61 (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":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ee48fa444ea60d98850c5acc07b3ec615bccf517a43ca8ea5ba35a38f034aa"}},{"ruleId":"D1","level":"warning","message":{"text":"Bump.version_with_cooldown (cyclomatic 60): Bump.version_with_cooldown has cyclomatic complexity 60 (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":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88784650236df2e32cfe9d3345c918f458572064cd89023b330670c4fdfe203"}},{"ruleId":"D1","level":"warning","message":{"text":"Contributions.run (cyclomatic 60): Contributions.run has cyclomatic complexity 60 (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":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbffffb3502ccc540a7cf952c0095e99cb79e92c171d3e60ae2845d83b0ade5f"}},{"ruleId":"D1","level":"warning","message":{"text":"Install.install_formula? (cyclomatic 59): Install.install_formula? has cyclomatic complexity 59 (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":"Library/Homebrew/install/check.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"090569722b3494ef43447db95fcc8f33981971bab2e7c881e747c6ded14a90fd"}},{"ruleId":"D1","level":"warning","message":{"text":"API.fetch_json_api_file (cyclomatic 58): API.fetch_json_api_file has cyclomatic complexity 58 (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":"Library/Homebrew/api.rb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6d39b566f3345cbc400978ef4107d77d51bd37ae4d74fa057f16ae365f75bb"}},{"ruleId":"D1","level":"warning","message":{"text":"Tap.install (cyclomatic 58): Tap.install has cyclomatic complexity 58 (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":"Library/Homebrew/tap.rb"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"202759491dd6033ec4a78c5084bf4bb8b2c6958c989d1f5a7655565b7d121c4b"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedArgs.load_formula_or_cask (cyclomatic 55): NamedArgs.load_formula_or_cask has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/named_args.rb"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"83367dccf4e18d82dc93cac6c119bd1daa96ff93a71538c00943026c4597f9e0"}},{"ruleId":"D1","level":"warning","message":{"text":"StaleLeadMaintainerPrApproval.evaluate (cyclomatic 49): StaleLeadMaintainerPrApproval.evaluate has cyclomatic complexity 49 (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":".github/scripts/approve_stale_lead_maintainer_prs.rb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f202db1d3374e961bea9f10f061a3daae136fa0503cb0a227bf7b70903be24e1"}},{"ruleId":"D1","level":"warning","message":{"text":"UpgradeCmd.run (cyclomatic 47): UpgradeCmd.run has cyclomatic complexity 47 (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":"Library/Homebrew/cmd/upgrade.rb"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f543c2e1e290a087c911593fb1d670054420c09880e1f98fd51d4084538ec30"}},{"ruleId":"D1","level":"warning","message":{"text":"Curl.curl_check_http_content (cyclomatic 47): Curl.curl_check_http_content has cyclomatic complexity 47 (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":"Library/Homebrew/utils/curl.rb"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2480312bf2d57b2c4488022c9053ff725d8f7bbb65458a65cf9a7829e6df77"}},{"ruleId":"D1","level":"warning","message":{"text":"BumpCaskPr.replace_version_and_checksum (cyclomatic 46): BumpCaskPr.replace_version_and_checksum has cyclomatic complexity 46 (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":"Library/Homebrew/dev-cmd/bump-cask-pr.rb"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfedcc5f98db40220f56f97cc80d1316a70c31e0796078a7f3c67b9bbf0c185"}},{"ruleId":"D1","level":"warning","message":{"text":"OsvExport.merge_range_transitions (cyclomatic 46): OsvExport.merge_range_transitions has cyclomatic complexity 46 (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":"Library/Homebrew/vulns/osv_export.rb"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"be283b0012c64710afb09b6701c01f34b10b3cc3e6be5c946ea61ba034bfaeeb"}},{"ruleId":"D1","level":"warning","message":{"text":"Release.run (cyclomatic 44): Release.run has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/release.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bef0744c4e4d25816e677035ef161524b925b6f503726a55f59e231fc8680b"}},{"ruleId":"D1","level":"warning","message":{"text":"DownloadQueue.fetch (cyclomatic 44): DownloadQueue.fetch has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/download_queue.rb"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"920957124141f3febf51dcee211178732bba3d8106492d91ba614ffb56238185"}},{"ruleId":"D1","level":"warning","message":{"text":"Miscellaneous.audit_formula (cyclomatic 44): Miscellaneous.audit_formula has cyclomatic complexity 44 (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":"Library/Homebrew/rubocops/lines.rb"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a77820c3409bcbd3088ce5430692616aeac30be4bbc881ca03b8f9803b2ce63"}},{"ruleId":"D1","level":"warning","message":{"text":"Bottle.merge (cyclomatic 43): Bottle.merge has cyclomatic complexity 43 (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":"Library/Homebrew/dev-cmd/bottle.rb"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"585b4ca3217785232ff77e9a8da30321a55c86ca5d11c9fdb962e6af31992788"}},{"ruleId":"D1","level":"warning","message":{"text":"BumpCaskPr.run (cyclomatic 43): BumpCaskPr.run has cyclomatic complexity 43 (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":"Library/Homebrew/dev-cmd/bump-cask-pr.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"752dfc0c416e1753f3588746d0a37a7e7af7b80ef7da2ef3a6c84a8efae24829"}},{"ruleId":"D1","level":"warning","message":{"text":"Upgrade.upgrade_casks! (cyclomatic 42): Upgrade.upgrade_casks! has cyclomatic complexity 42 (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":"Library/Homebrew/cask/upgrade.rb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c701874091a561d5c2b27d08011151a8c6d4a13dc1127f34468b9cbca0f25a6"}},{"ruleId":"D1","level":"warning","message":{"text":"PlatformIndependence.body? (cyclomatic 42): PlatformIndependence.body? has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/platform_independence.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5784049e444ad01e4a3528f9374c995510ce6e694724af4c9e58a19af590c6a9"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecSubcommand.run_external_command (cyclomatic 41): ExecSubcommand.run_external_command has cyclomatic complexity 41 (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":"Library/Homebrew/bundle/subcommand/exec.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a637571b683be2e3e8dbb1c6ebe0470747c397fa147abfcf645e75f5af97ea"}},{"ruleId":"D1","level":"warning","message":{"text":"UninstallCmd.run (cyclomatic 40): UninstallCmd.run has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/uninstall.rb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ecb214d864e93fd00c47be788e35379961ffe88e310501bd6acf28c29dabb0"}},{"ruleId":"D1","level":"warning","message":{"text":"PrPull.run (cyclomatic 40): PrPull.run has cyclomatic complexity 40 (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":"Library/Homebrew/dev-cmd/pr-pull.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"48208111185453308a7dc49295669b0dc9eaf6db5937c16100bb1e9f6739921a"}},{"ruleId":"D1","level":"warning","message":{"text":"Cleanup.stale_formula? (cyclomatic 39): Cleanup.stale_formula? has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cleanup.rb"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"552f8d73d6ff60f27a2ad3544f41164b7ee7fdbaf2edabf8a7f0ba5c84af8e63"}},{"ruleId":"D1","level":"warning","message":{"text":"Cli.stop (cyclomatic 39): Cli.stop has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/services/cli.rb"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"083ead8eaefaa175655cc35327e33332f01dcf1403cd0e925cc01491ebc5ca99"}},{"ruleId":"D1","level":"warning","message":{"text":"OnSystemConditionals.simplify_os_sha256_stanzas (cyclomatic 38): OnSystemConditionals.simplify_os_sha256_stanzas has cyclomatic complexity 38 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/on_system_conditionals.rb"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b18003f26ff5eef058bc460d8ff0acf4611e19b1ed3bea4b07bdaa95f7341b"}},{"ruleId":"D1","level":"warning","message":{"text":"DocstringParser.parse_content (cyclomatic 38): DocstringParser.parse_content has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/yard/docstring_parser.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"896e5beb5ff0e00718247ddfaad8803e8d34c99eb4c1d1fad0d16da8167f2079"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaHistory.report (cyclomatic 36): FormulaHistory.report has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/formula_history.rb"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9331f0d7374e76b0575a7c6304572af1dace3ff0f040de49cfff9d5d4e3da773"}},{"ruleId":"D1","level":"warning","message":{"text":"App.install_phase (cyclomatic 35): App.install_phase has cyclomatic complexity 35 (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":"Library/Homebrew/cask/artifact/app.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4d4d9e3980e7f4a636aea8d6fe5c6417f0e872d0e1aacedd9a7b3beb2b7809"}},{"ruleId":"D1","level":"warning","message":{"text":"Caskroom.migrate_caskfile_to_json (cyclomatic 34): Caskroom.migrate_caskfile_to_json has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/caskroom.rb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4a8b7433d04fc0b2b01c3016b23b73761e12c1465e49e3659af51a5ff8ae64"}},{"ruleId":"D1","level":"warning","message":{"text":"Reporter.report (cyclomatic 34): Reporter.report has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/update_report/reporter.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"309fa6f5319d39e6f215dbfdeaf6d214ffbdbd777209ef581e67fb158c8f6058"}},{"ruleId":"D1","level":"warning","message":{"text":"Extract.run (cyclomatic 34): Extract.run has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/extract.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f480a3df697ad6f765c90bb128f880bf979e7d375853c3a86c5c091fed934b31"}},{"ruleId":"D1","level":"warning","message":{"text":"Tap.apply_redirected_remote! (cyclomatic 34): Tap.apply_redirected_remote! has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap.rb"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05a3a591dd523955370ba39a99b7d7ee395a8381ba8e69e196f7932839c0812"}},{"ruleId":"D1","level":"warning","message":{"text":"Link.run (cyclomatic 33): Link.run has cyclomatic complexity 33 (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":"Library/Homebrew/cmd/link.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"251c1c293b4b210b0ef3fec276e734b7795bd8c1626bed218a4a7258557c2971"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaCellarChecks.check_prebuilt_npm_binaries (cyclomatic 33): FormulaCellarChecks.check_prebuilt_npm_binaries has cyclomatic complexity 33 (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":"Library/Homebrew/formula_cellar_checks.rb"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f3aa885632a4fac6df26d7f9d25877f4d18761bfe8701b1dadd226459fdc6e"}},{"ruleId":"D1","level":"warning","message":{"text":"Bump.run (cyclomatic 31): Bump.run has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7c8fb4629e410a60222eb1fea855c5834986770e6fc1b454166b883cb65a80"}},{"ruleId":"D1","level":"warning","message":{"text":"Contributions.scan_maintainer_contributions (cyclomatic 31): Contributions.scan_maintainer_contributions has cyclomatic complexity 31 (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":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4666b632ce996bc113a622ae862b7c87c576d7211fc3d0eb8cf66de4b9ca73a"}},{"ruleId":"D1","level":"warning","message":{"text":"Version.\u003C=\u003E (cyclomatic 31): Version.\u003C=\u003E has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/version.rb"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8c6853f7c8d57619de82643a936e30423990e56b347c5a852af69136c40d2f"}},{"ruleId":"D1","level":"warning","message":{"text":"Deps.run (cyclomatic 30): Deps.run has cyclomatic complexity 30 (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":"Library/Homebrew/cmd/deps.rb"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"48720ca2a2451e2c4b67460c362ef3d15c8f62bd41817d059b0b4efd2ce4181d"}},{"ruleId":"D1","level":"warning","message":{"text":"BumpFormulaPr.patches_for_removal (cyclomatic 30): BumpFormulaPr.patches_for_removal 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":"Library/Homebrew/dev-cmd/bump-formula-pr.rb"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7415b63e0ec2925fc2bb1fd3c330dbe867ec049c0d2a12c82ca004a67dd22cff"}},{"ruleId":"D1","level":"warning","message":{"text":"GitHubPackages.upload_bottle (cyclomatic 30): GitHubPackages.upload_bottle has cyclomatic complexity 30 (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":"Library/Homebrew/github_packages.rb"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b476c18129f088595bf750e9845d4c28506eb9a8b6347b9ee455620e8e1201b"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkageChecker.check_dylibs (cyclomatic 30): LinkageChecker.check_dylibs 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":"Library/Homebrew/linkage_checker.rb"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9991f5cf9f49f04e68ae16aa14c5b207936cb72685a8567c2e5177b282112e94"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallStepsHelper.simple_install_step_line (cyclomatic 30): InstallStepsHelper.simple_install_step_line 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":"Library/Homebrew/rubocops/shared/install_steps_helper.rb"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6cf02e02645b37bb5b9092827ba195b9474c360c7fed5ed4e01bef79b3cbf1"}},{"ruleId":"D1","level":"warning","message":{"text":"Style.check_style_impl (cyclomatic 30): Style.check_style_impl has cyclomatic complexity 30 (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":"Library/Homebrew/style.rb"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc40b42c2eb9b4c562b9f8b3cabac2c71c15217ec7d333b4b27ada81f6ca07f4"}},{"ruleId":"D1","level":"warning","message":{"text":"AdvisoryOverrides.initialize (cyclomatic 30): AdvisoryOverrides.initialize has cyclomatic complexity 30 (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":"Library/Homebrew/vulns/advisory_overrides.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f161f183002c0d76330311b2fcc0a0d1737ca25a3af21b6f9b4e9a73bdbb4f0"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaStructGenerator.generate_formula_struct_hash (cyclomatic 29): FormulaStructGenerator.generate_formula_struct_hash has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/api/formula/formula_struct_generator.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f02d7be743de6b04f8e2c0d3846d880c0382e72d9621dcc66fb8d0503d0841"}},{"ruleId":"D1","level":"warning","message":{"text":"Audit.audit_min_os (cyclomatic 29): Audit.audit_min_os has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"112b5b037c92140cc162b3754387f710cb086d7d7c4b431efb00f9a133f2be17"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaAuditor.audit_revision (cyclomatic 29): FormulaAuditor.audit_revision has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59814815a4642fea8cce576b7c9424952ac09afc8efed2541896d754b8c56f9"}},{"ruleId":"D1","level":"warning","message":{"text":"StaleLeadMaintainerPrApproval.finish (cyclomatic 28): StaleLeadMaintainerPrApproval.finish has cyclomatic complexity 28 (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":".github/scripts/approve_stale_lead_maintainer_prs.rb"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e743528c5a23e0b8515e8a0b72925da0c15061067a7f363a3736aa609f1987"}},{"ruleId":"D1","level":"warning","message":{"text":"Cask.install! (cyclomatic 28): Cask.install! 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":"Library/Homebrew/bundle/cask.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5954573e490592972c410bd942e40bf3766198020c983c69a3de1d2908df3489"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaInstaller.finish (cyclomatic 28): FormulaInstaller.finish 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":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"7481941e7e4b6409254ddc844b8caedfe4ac415fb61700f631578a8457cec602"}},{"ruleId":"D1","level":"warning","message":{"text":"Metadata.read_directly (cyclomatic 28): Metadata.read_directly has cyclomatic complexity 28 (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":"Library/Homebrew/os/linux/elf.rb"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4379696b5809bb0220f6b40b9159444e2c6a6af4a97311800273e0b40eee3d"}},{"ruleId":"D1","level":"warning","message":{"text":"TestResource.audit_formula (cyclomatic 28): TestResource.audit_formula has cyclomatic complexity 28 (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":"Library/Homebrew/rubocops/class.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"270a6985fbda310bb1479f138961834c39c6bfd8ed25af84030856bf938d02c1"}},{"ruleId":"D1","level":"warning","message":{"text":"JavaVersions.audit_formula (cyclomatic 28): JavaVersions.audit_formula has cyclomatic complexity 28 (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":"Library/Homebrew/rubocops/lines.rb"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9d4c84fe3df1e29cf09cdb25470894fae651714fe13edc200a61ac9e89ac08"}},{"ruleId":"D1","level":"warning","message":{"text":"Upgrade.upgrade_dependents (cyclomatic 28): Upgrade.upgrade_dependents has cyclomatic complexity 28 (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":"Library/Homebrew/upgrade.rb"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc57b848e8958109c92cd71527657fcea342eece1d3770784b5502787d6cbf0"}},{"ruleId":"D1","level":"warning","message":{"text":"CPAN.update_perl_resources! (cyclomatic 28): CPAN.update_perl_resources! 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":"Library/Homebrew/utils/cpan.rb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ec1b994c29849e86cde1753fe3d40cd4be2c4d2627b1e8f21d733abc3cffd2"}},{"ruleId":"D1","level":"warning","message":{"text":"SharedAudits.new_domain_problem (cyclomatic 28): SharedAudits.new_domain_problem 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":"Library/Homebrew/utils/shared_audits.rb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8b38805f54f88629682443530f6d0d4a5b86452458820e06b88e0dea67573f"}},{"ruleId":"D1","level":"warning","message":{"text":"Identify.registry_purl (cyclomatic 28): Identify.registry_purl 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":"Library/Homebrew/vulns/identify.rb"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1e2e1de68b14eb4f9b1fc627c344777338d883e46368d9db74a4405ef046c0"}},{"ruleId":"D1","level":"warning","message":{"text":"CleanupSubcommand.cleanup (cyclomatic 27): CleanupSubcommand.cleanup has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/subcommand/cleanup.rb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e12cd021d3bdbebb28d94bc697660a4ecfc59a19aa247697f97f68405ac02c"}},{"ruleId":"D1","level":"warning","message":{"text":"FetchCmd.run (cyclomatic 27): FetchCmd.run has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/fetch.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d2ce72ac82bb375282fb3cb61a11a56754939e9a4c390c914be4fe957453b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Reporter.migrate_tap_migration (cyclomatic 27): Reporter.migrate_tap_migration has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/update_report/reporter.rb"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"18434162a3b3bca35717f8406d4a0da3af6b1a59ba7b9b7c2672d580724a534a"}},{"ruleId":"D1","level":"warning","message":{"text":"CurlDownloadStrategy.fetch (cyclomatic 27): CurlDownloadStrategy.fetch has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/download_strategy/curl_download_strategy.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1ca85e44f2950b633e8a72b64646b2e2cf1dabd4c1e6a7142ae0b6caf4d178"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaInstaller.check_install_sanity (cyclomatic 27): FormulaInstaller.check_install_sanity has cyclomatic complexity 27 (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":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20d76e668180894bb17c049869451643bcf8ded4212f2ac97f5b6fc4d54e82c"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaInstaller.expand_dependencies_for_formula_once (cyclomatic 27): FormulaInstaller.expand_dependencies_for_formula_once has cyclomatic complexity 27 (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":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5678ebadcf820f53b8c3bb900401240d17fedcc780b118427b02b46c6ea145"}},{"ruleId":"D1","level":"warning","message":{"text":"Text.audit_formula (cyclomatic 27): Text.audit_formula has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/text.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2122e7ac1fc1f34b9ea6f5e04e1b57b43a5c719b10d56ec7873a2b5ad91d69ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Style.run_rubocop (cyclomatic 27): Style.run_rubocop has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/style.rb"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bf37f95b9e5633bce9b2ebf647b15263ce9da00bf9c1cd83333ef5fc03f968"}},{"ruleId":"D1","level":"warning","message":{"text":"Match.reconcile_history (cyclomatic 27): Match.reconcile_history has cyclomatic complexity 27 (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":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b52db0faed1a21bdafb0884a4ef7a0330d1c696fa75d4c7dea485dba79dba8"}},{"ruleId":"D1","level":"warning","message":{"text":"AppImage.install_phase (cyclomatic 26): AppImage.install_phase has cyclomatic complexity 26 (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":"Library/Homebrew/cask/artifact/appimage.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ede0eb3d8b9b54c72b0dc47635a61659fe7a0bab60327fb07ce5c11db1258e7"}},{"ruleId":"D1","level":"warning","message":{"text":"Audit.extract_artifacts (cyclomatic 26): Audit.extract_artifacts has cyclomatic complexity 26 (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":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4ccdbd2f7c67d14c1e618a8aff1f1ba36136e0c27a00c2729ee2191414d925"}},{"ruleId":"D1","level":"warning","message":{"text":"Audit.audit_rosetta (cyclomatic 26): Audit.audit_rosetta has cyclomatic complexity 26 (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":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6b29c11ec74247577e735588ca46720b6d289fdbcccf58903391a7d206f20e"}},{"ruleId":"D1","level":"warning","message":{"text":"Cask.auto_updates_bundle_outdated? (cyclomatic 26): Cask.auto_updates_bundle_outdated? has cyclomatic complexity 26 (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":"Library/Homebrew/cask/cask.rb"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24af7fb37e7154e1fcfa495d2df27e948996daafe78148346d8353720c6a597"}},{"ruleId":"D1","level":"warning","message":{"text":"Upgrade.outdated_casks (cyclomatic 26): Upgrade.outdated_casks 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":"Library/Homebrew/cask/upgrade.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb0919659a5727b916663c0440a5b8fd65b0d986660ceb020c23878150bec5e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.parse (cyclomatic 26): Parser.parse 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":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70793e1a63f86f758c723885e6bf13ba489507439547fab12227113d69edf35"}},{"ruleId":"D1","level":"warning","message":{"text":"Contributions.scan_contributions (cyclomatic 26): Contributions.scan_contributions has cyclomatic complexity 26 (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":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eeec6a5ae7ee4ad7ef5ec961833081aaedacd0806b36674ab19f476d743f676"}},{"ruleId":"D1","level":"warning","message":{"text":"Contributions.parse_git_log (cyclomatic 26): Contributions.parse_git_log has cyclomatic complexity 26 (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":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb67937e8e8e5a7d141693bd743026c96f4481ccf213bb8b798ba33b1d4f885"}},{"ruleId":"D1","level":"warning","message":{"text":"LivecheckCmd.run (cyclomatic 26): LivecheckCmd.run 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":"Library/Homebrew/dev-cmd/livecheck.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c3d2133a8a9975c6acec9e874293189e09cb60ac5dfb05d83d6a82851c7a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Typecheck.run (cyclomatic 26): Typecheck.run 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":"Library/Homebrew/dev-cmd/typecheck.rb"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efb5dd15fd3456b7daf82e5a8c2ee2c1cf57dc81e9dc9edd77da82c6201f1ad"}},{"ruleId":"D1","level":"warning","message":{"text":"Unbottled.output_unbottled (cyclomatic 26): Unbottled.output_unbottled 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":"Library/Homebrew/dev-cmd/unbottled.rb"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"11befc155ac9b83c61d78193e8d5a5ebb1ec3f2f063c1f34b1d6be6fd880c952"}},{"ruleId":"D1","level":"warning","message":{"text":"Moved.move (cyclomatic 25): Moved.move has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/artifact/moved.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbca499601c51f90e7747ba90e4d2b914e23ead69642590ef1ffed6bd9658378"}},{"ruleId":"D1","level":"warning","message":{"text":"Audit.cask_bundle_min_os (cyclomatic 25): Audit.cask_bundle_min_os has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8817298259282df858ba1970cd399c163792cca9e441b5a1a955c23d2999bf6"}},{"ruleId":"D1","level":"warning","message":{"text":"UpgradeCmd.formulae_upgrade_context (cyclomatic 25): UpgradeCmd.formulae_upgrade_context has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/upgrade.rb"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"45aaaeee6076be5d2511d9f929b276808105ee1c2a1d24aaebcf4c403f7bf9a4"}},{"ruleId":"D1","level":"warning","message":{"text":"Lgtm.run (cyclomatic 25): Lgtm.run has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/lgtm.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"919ef7ec3eec4a2c8aff46ca116c5cbd8f07d15afdf302fa3afd91c22a9c6679"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaCellarChecks.check_binary_arches (cyclomatic 25): FormulaCellarChecks.check_binary_arches has cyclomatic complexity 25 (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":"Library/Homebrew/formula_cellar_checks.rb"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdad117e7350f4a40fbfb86aeb68911ff74a089629bd0d4eb5b83d4d21c6f1db"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaInstaller.install (cyclomatic 25): FormulaInstaller.install has cyclomatic complexity 25 (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":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce5000452e4710a0e0502a529a1b60e7c7e13c0ee15ed4d2a01500d03a5dd83"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.to_plist (cyclomatic 25): Service.to_plist has cyclomatic complexity 25 (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":"Library/Homebrew/service.rb"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"af29e45b8e63a029ac9f099e68a1c8679181764992299af316b1b453687481ec"}},{"ruleId":"D1","level":"warning","message":{"text":"Utils.safe_fork (cyclomatic 25): Utils.safe_fork has cyclomatic complexity 25 (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":"Library/Homebrew/utils/fork.rb"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"68051dfde9cd458d294de8cb75236ac425215f910af528f6e410539b3184b280"}},{"ruleId":"D1","level":"warning","message":{"text":"Match.subject_version_at (cyclomatic 25): Match.subject_version_at has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"812100da87644c1b2b0dca27f75c1b5299ca5f3620637ac087b9aa9e0ce02b83"}},{"ruleId":"D1","level":"warning","message":{"text":"OnSystemConditionals.audit_identical_sha256_across_architectures (cyclomatic 24): OnSystemConditionals.audit_identical_sha256_across_architectures has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/on_system_conditionals.rb"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb8a8db88261dceb1e437a0a1d3932dd7bdfa14d83b995d1da7f2e6b825e50f"}},{"ruleId":"D1","level":"warning","message":{"text":"OSDependsOn.on_send (cyclomatic 24): OSDependsOn.on_send has cyclomatic complexity 24 (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":"Library/Homebrew/rubocops/os_depends_on.rb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3b36bb2f17e2154a942d226dffa2af9ff6b996b3d63180972c82d091fca2c4"}},{"ruleId":"D1","level":"warning","message":{"text":"Releases.report (cyclomatic 24): Releases.report has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/releases.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"df255f7382e60c3165f0537320701dfce39091d265d556439c6ec35019217505"}},{"ruleId":"D1","level":"warning","message":{"text":"PatchInclusion.removal_reason (cyclomatic 24): PatchInclusion.removal_reason has cyclomatic complexity 24 (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":"Library/Homebrew/utils/github/patch_inclusion.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e100750cf4c2c8dac97171b49082ff2dd2663b1abf57617e525d50ee03e9a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Mixin.odeprecated (cyclomatic 24): Mixin.odeprecated has cyclomatic complexity 24 (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":"Library/Homebrew/utils/output.rb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"09650cdae6e18890c207b7a46bcf37514e859b81df74532ce5399d8b01d67d75"}},{"ruleId":"D1","level":"warning","message":{"text":"Reinstall.run (cyclomatic 23): Reinstall.run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/reinstall.rb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f3ebc3ae4df9a33e57f946e4167ce89a7d128e4e6eea3de4453090ed5b2146"}},{"ruleId":"D1","level":"warning","message":{"text":"Untrust.run (cyclomatic 23): Untrust.run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/untrust.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90ff9bad1728c5fff69f8d929e37f5e98588eaf9ed6b09e29d053b557c86c38"}},{"ruleId":"D1","level":"warning","message":{"text":"VersionInstall.run (cyclomatic 23): VersionInstall.run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/version-install.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c62a4f2ec9a6fb80d6f06a471a7ef9fd55ad9f843e7cdf90fe50f7841b5dd55"}},{"ruleId":"D1","level":"warning","message":{"text":"Contributions.generate_maintainer_report_csv (cyclomatic 23): Contributions.generate_maintainer_report_csv has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7941490a8da06c366d72c067637d6c20c93d74ead6501599e119f5fa724fd9d6"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaAuditor.audit_license (cyclomatic 23): FormulaAuditor.audit_license has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3814c1ed9094857edb0a8b28d2e1793006e4ebf8cf9c109e201a2c06a0ef72a"}},{"ruleId":"D1","level":"warning","message":{"text":"ResourceAuditor.audit_urls (cyclomatic 23): ResourceAuditor.audit_urls has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/resource_auditor.rb"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"26afcf68009e47e38d594474d4b87a484d765872e5983466cc020e9b4d54e11f"}},{"ruleId":"D1","level":"warning","message":{"text":"Uninstall.uninstall_kegs (cyclomatic 23): Uninstall.uninstall_kegs has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/uninstall.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a3c3f0344610609b4e5717737e88959f6dc87b9428ca2012bc92b0e480ad49"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaHistory.apply (cyclomatic 23): FormulaHistory.apply has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/formula_history.rb"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ea76a99ece70586b53bf04d33cb1b52ab8d14579b0d4630e6234ac80f46e90"}},{"ruleId":"D1","level":"warning","message":{"text":"Curl.curl_args (cyclomatic 23): Curl.curl_args has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/curl.rb"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa181f3f7afe2ca74acc1a50b3d30a71decde195aa463c6cc757e7abe0f2723"}},{"ruleId":"D1","level":"warning","message":{"text":"Sponsors.open_collective (cyclomatic 23): Sponsors.open_collective has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/sponsors.rb"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9720bfbad3ecefca947efae1acfa7a33a4c8a594bc5b8c963bf46d344ce58a"}},{"ruleId":"D1","level":"warning","message":{"text":"Edit.run (cyclomatic 22): Edit.run has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/edit.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9276a09f58aa5936a2692d55a16a435156bfec9cf1a01ed22c0a929578a5dd3"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerateCaskCiMatrix.run (cyclomatic 22): GenerateCaskCiMatrix.run has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/generate-cask-ci-matrix.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b775b71892b92c99f29fb7d0baf9bb42a8c5bd10a8e7525e331e684fe58b0d76"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaInstaller.install_dependency (cyclomatic 22): FormulaInstaller.install_dependency has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8774fa9747bfbaa56f9a8b3e5be163555fe428d65c8449d41b9382c062cc09"}},{"ruleId":"D1","level":"warning","message":{"text":"Formulary.load_formula_from_struct! (cyclomatic 22): Formulary.load_formula_from_struct! has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formulary.rb"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8938162303e69acaf75576f1771a189d50354f4c6ebf71b20d92a05f75f704f"}},{"ruleId":"D1","level":"warning","message":{"text":"ComponentsRedundancy.audit_formula (cyclomatic 22): ComponentsRedundancy.audit_formula has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/components_redundancy.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f94246f13b3105a192afc724333379d41f6c7ff0502f21b27c535039c49744a"}},{"ruleId":"D1","level":"warning","message":{"text":"UrlHelper.audit_url (cyclomatic 22): UrlHelper.audit_url has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/shared/url_helper.rb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cfd2dbc390f6941b7f5883675915f06aa7d802e0029498ba7c5d5cf9f6c42e"}},{"ruleId":"D1","level":"warning","message":{"text":"Caveats.keg_only_text (cyclomatic 21): Caveats.keg_only_text has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/caveats.rb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1d070769da3983131962160765e86fb5ff98a693eedb8d3e7eae93ad38d2f9"}},{"ruleId":"D1","level":"warning","message":{"text":"Cleanup.prune_prefix_symlinks_and_directories (cyclomatic 21): Cleanup.prune_prefix_symlinks_and_directories has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cleanup.rb"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfffd5ba4bdf6672322074983d78be62c093d8989b221bbda072c4c801ea24f9"}},{"ruleId":"D1","level":"warning","message":{"text":"Untap.run (cyclomatic 21): Untap.run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/untap.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de93816dc1b1549b072471686fec1ad5e9b228f1c8108bf382ded6cb67945a4"}},{"ruleId":"D1","level":"warning","message":{"text":"UpgradeCmd.show_final_upgrade_summary (cyclomatic 21): UpgradeCmd.show_final_upgrade_summary has cyclomatic complexity 21 (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":"Library/Homebrew/cmd/upgrade.rb"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa59f9934affe2a846bf13e7ccf76de4741f077f9f77a134694946100323d55"}},{"ruleId":"D1","level":"warning","message":{"text":"UpgradeCmd.upgrade_outdated_formulae! (cyclomatic 21): UpgradeCmd.upgrade_outdated_formulae! has cyclomatic complexity 21 (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":"Library/Homebrew/cmd/upgrade.rb"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ecd967db8eb3c98511dab3b4c75dfce353c92c2fe07806078004b49a0bb447"}},{"ruleId":"D1","level":"warning","message":{"text":"BumpUnversionedCasks.bump_unversioned_cask (cyclomatic 21): BumpUnversionedCasks.bump_unversioned_cask has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump-unversioned-casks.rb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"610de0884c9db42c12e28e86ef665a363b4f4e5a548bcee74bb03cf3f33f7ac9"}},{"ruleId":"D1","level":"warning","message":{"text":"GitDownloadStrategy.env (cyclomatic 21): GitDownloadStrategy.env has cyclomatic complexity 21 (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":"Library/Homebrew/download_strategy/git_download_strategy.rb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef88496553db4e3d0d7ce5c2566dafd5ad7d6abc85eea5d77e10d9eaca6f22d"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaInstaller.forbidden_tap_check (cyclomatic 21): FormulaInstaller.forbidden_tap_check has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"c486f31a3f9e6caf00a01e0c13cea400675088edecb7c9d13846342b55877adb"}},{"ruleId":"D1","level":"warning","message":{"text":"Formulary.tap_formula_name_type (cyclomatic 21): Formulary.tap_formula_name_type has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formulary.rb"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"603390898572a2c22d73d612b947c2dc233fa383c05c64f1d2c961a917402870"}},{"ruleId":"D1","level":"warning","message":{"text":"Keg.link_dir (cyclomatic 21): Keg.link_dir has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/keg.rb"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4704117ae06f5865fe7dd22ddf6654ff75160aaef749fc04c6d6cec5615e00"}},{"ruleId":"D1","level":"warning","message":{"text":"TernaryToIf.before_declaring_variable (cyclomatic 21): TernaryToIf.before_declaring_variable has cyclomatic complexity 21 (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":"Library/Homebrew/rubocops/ternary_to_if.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf8f104582ae560c58383fc5e3210f74a5f82a9bde3846eb30656f58684442c"}},{"ruleId":"D1","level":"warning","message":{"text":"API.generate_repositories (cyclomatic 21): API.generate_repositories has cyclomatic complexity 21 (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":"Library/Homebrew/utils/analytics/api.rb"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"296c016d90da9f8f8e423706692383929ecb41db2f163799404051a82ee046dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Match.range_status (cyclomatic 21): Match.range_status has cyclomatic complexity 21 (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":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ec198f4b7d0d427de20e04d3dfa4aff539b78d31925351d04c0c09c74688df"}},{"ruleId":"D1","level":"warning","message":{"text":"Match.to_brew_record (cyclomatic 21): Match.to_brew_record has cyclomatic complexity 21 (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":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54ad8e53517441ee6307ce1de267e93211fbb69f94573560b138ce67d2f4e86"}},{"ruleId":"D1","level":"warning","message":{"text":"Build.install (cyclomatic 20): Build.install has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/build.rb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe6d094ea32dd7068c601dac54d36110b1000eadaf793cb9bdb18a1f4b9c9b4"}},{"ruleId":"D1","level":"warning","message":{"text":"Installer.homebrew_batchable? (cyclomatic 20): Installer.homebrew_batchable? has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/installer.rb"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd65b095c38df7794f1441a182c9c0b8eef41bb8146d76cb305757dbe4f97cf"}},{"ruleId":"D1","level":"warning","message":{"text":"Installer.forbidden_cask_and_formula_check (cyclomatic 20): Installer.forbidden_cask_and_formula_check has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a7d98738b39b4c5b3983f217de8b6fb82149dc799bc83acc86adca301268ba"}},{"ruleId":"D1","level":"warning","message":{"text":"Installer.load_installed_caskfile! (cyclomatic 20): Installer.load_installed_caskfile! has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddb6f104371e5c682b491785a124fe3a5a26213b31f9d892a1f8e09613dcc5d"}},{"ruleId":"D1","level":"warning","message":{"text":"Upgrade.upgrade_cask (cyclomatic 20): Upgrade.upgrade_cask has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/upgrade.rb"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a28228fafc977d44a8f234ae9697406aadb0b2fa7850991a40ea034cfb85fec"}},{"ruleId":"D1","level":"warning","message":{"text":"DirEmitter.reconcile (cyclomatic 20): DirEmitter.reconcile has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e59665c3b5b03b76d52114794766f7bcac46bec0b1188ccdf72cf352b4727f"}},{"ruleId":"D1","level":"warning","message":{"text":"Contributions.approved_pull_request? (cyclomatic 20): Contributions.approved_pull_request? has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"6553e802a7f3e28780a51955e795b14c8492b94531f674db17a7e192ba076d67"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaCreator.initialize (cyclomatic 20): FormulaCreator.initialize has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_creator.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c80920b50cd1086ae870b344bd79e1524f934c6d0d7d25a869541e1e3125917"}},{"ruleId":"D1","level":"warning","message":{"text":"InstalledDependents.find_some_installed_dependents (cyclomatic 20): InstalledDependents.find_some_installed_dependents has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/installed_dependents.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eea0de8da34ececf7243a1c47437385e29d21e85005fc76edd28a746908c893"}},{"ruleId":"D1","level":"warning","message":{"text":"Livecheck.url (cyclomatic 20): Livecheck.url has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck.rb"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc16b426d4aa94427656ffe721737daefaa24f74e72d84119c414091f501e7a5"}},{"ruleId":"D1","level":"warning","message":{"text":"OnSystemConditionals.sha256_pairs (cyclomatic 20): OnSystemConditionals.sha256_pairs has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/on_system_conditionals.rb"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfdc1c13cd20e7951b6af9da23c33935e0e2a5881f4924c8d87cb2db70fed5a"}},{"ruleId":"D1","level":"warning","message":{"text":"GemSetup.install_bundler_gems! (cyclomatic 20): GemSetup.install_bundler_gems! has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/gem_setup.rb"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9597b2999a5d37e147493e1d6c5df7dde289077889ef0b4caa7694e8d999397"}},{"ruleId":"D1","level":"warning","message":{"text":"Match.reconciliation_observation (cyclomatic 20): Match.reconciliation_observation has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba124f40490a72974b7fa16a473a6d06b504171e13c8f357c41778b7f300ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"OsvExport.merge_existing (cyclomatic 20): OsvExport.merge_existing has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/osv_export.rb"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a192e3a16150a882732fc7595e59d239c0d08019118fcabab6974b2cb34b6862"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.build_target (cyclomatic 20): Scanner.build_target has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/scanner.rb"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db229b33c76ce66ac230e1dfc3f4992ef922b19b8bff97b3a890744c2c0666d"}},{"ruleId":"D1","level":"warning","message":{"text":"Attestation.check_attestation (cyclomatic 19): Attestation.check_attestation has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/attestation.rb"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32eed38167f71124c5c4ac227234e150d37bd1d29db3e0f88311f57c825737d"}},{"ruleId":"D1","level":"warning","message":{"text":"Cargo.package_outdated? (cyclomatic 19): Cargo.package_outdated? has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/cargo.rb"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"43873e76d03eccc82d8a2b711759b2b08f82102c8b417c11551c2fedbd7350f7"}},{"ruleId":"D1","level":"warning","message":{"text":"CaskLoader.tap_cask_token_type (cyclomatic 19): CaskLoader.tap_cask_token_type has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7b2d21b29787d17e9fe2e5da8ce083a71a55dca3183b741d2d3d9d372f469a"}},{"ruleId":"D1","level":"warning","message":{"text":"Installer.forbidden_tap_check (cyclomatic 19): Installer.forbidden_tap_check has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cf7c7f4e820f218e487c835d31cad4370165d2b03347a707c81c2a2d0b96da"}},{"ruleId":"D1","level":"warning","message":{"text":"Caveats.service_caveats (cyclomatic 19): Caveats.service_caveats has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/caveats.rb"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"863f9c93a738805c76cb53742ec1e4f68cbdbed7c13c6030981d82d7d5e55d2f"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedArgs.to_paths (cyclomatic 19): NamedArgs.to_paths has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/named_args.rb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d64639ba0cd35041ee987cde20a4306a28b72c28e31d82775eb6fab792b020"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.generate_usage_banner (cyclomatic 19): Parser.generate_usage_banner has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a001940309bcab11bde942977665bd675df387b1abcce0e44f7bfdeb97dc082"}},{"ruleId":"D1","level":"warning","message":{"text":"Info.run (cyclomatic 19): Info.run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/info.rb"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0779c149baf19901b0b804b6aea3857087182e91ced8d3a076469aa868ab9c5"}},{"ruleId":"D1","level":"warning","message":{"text":"DirEmitter.terminal_intervals (cyclomatic 19): DirEmitter.terminal_intervals has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ee43bed265e2103503a01abd2aee1cf2b8af250f84e4e62045349eeb79404d"}},{"ruleId":"D1","level":"warning","message":{"text":"AdvisoryMatch.reconcile_formula (cyclomatic 19): AdvisoryMatch.reconcile_formula has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"079e3a264fbf86f0e9044e3c4eb0ea9a9e7be86c439fea351a68cef85abcd0ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Create.create_formula (cyclomatic 19): Create.create_formula has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/create.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2c26f228dad84be49919b258f73fdfb9b59fdfde0184465af43ec4ba59c0d7"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerateCaskCiMatrix.generate_matrix (cyclomatic 19): GenerateCaskCiMatrix.generate_matrix has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/generate-cask-ci-matrix.rb"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1327b2ea17337147105b8c84b2d95bbfd7194a77597ddf611f85adcf00d4d99"}},{"ruleId":"D1","level":"warning","message":{"text":"PrUpload.run (cyclomatic 19): PrUpload.run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/pr-upload.rb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"624e6f67b2cce8539c79aff4d8e62537bc05daef1a057fa2e227ee728ce0185a"}},{"ruleId":"D1","level":"warning","message":{"text":"Checks.check_untrusted_taps (cyclomatic 19): Checks.check_untrusted_taps has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/diagnostic.rb"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf309f7e2583da3cfb9aa0a558e263908ead7a45cb086e5f2fe01bcdb214c25d"}},{"ruleId":"D1","level":"warning","message":{"text":"Formula.system (cyclomatic 19): Formula.system has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula.rb"},"region":{"startLine":3743}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d52cd5818e29e29ca4d3f8a8b66cd5019c05a3c25e56f8851919584577baa2"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaAuditor.audit_compatibility_version (cyclomatic 19): FormulaAuditor.audit_compatibility_version has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"26262cdae1f7af25a721789464e6afd3d008c231fe98e6fb6a2e12e16993d641"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaInstaller.pour (cyclomatic 19): FormulaInstaller.pour has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"97812b5fad0ca1ca97ae67a73be97faaed773dc10701ce499fe0dad8c43bd129"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner.sandbox_write_paths (cyclomatic 19): Runner.sandbox_write_paths has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/install_steps.rb"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a2a4fa5f268adf23abc0d0681f51d008398f61486c00df4c310e5faf32aa43"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallSteps.keychain_find_certificate_name (cyclomatic 19): InstallSteps.keychain_find_certificate_name has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/install_steps.rb"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ecdf88a7374abc0db18550d097c99ba6835ac66acab8fe544aa812c9e1eec2"}},{"ruleId":"D1","level":"warning","message":{"text":"NoOverrides.on_system_stanzas (cyclomatic 19): NoOverrides.on_system_stanzas has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/no_overrides.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"25523599ecffbd91eae387cfa607d22e391f9c02c5afd4f3eca4bdd11ff2da70"}},{"ruleId":"D1","level":"warning","message":{"text":"ComponentsOrder.audit_formula (cyclomatic 19): ComponentsOrder.audit_formula has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/components_order.rb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a96502674ffa1f7b06640ce8ebc122e269431e7c0ad4c6e9395b953271d3ad"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaFeeds.changes (cyclomatic 19): FormulaFeeds.changes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/formula_feeds.rb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c676aac6c1854d0b037a4b91eb68dc94bc5c80902f04dd15be73652bac05bd"}},{"ruleId":"D1","level":"warning","message":{"text":"API.raise_error (cyclomatic 19): API.raise_error has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/github/api.rb"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b64cc7c66c844de2b8618054d6ecb314de9469ea227d7a0d4defa4a7089c102"}},{"ruleId":"D1","level":"warning","message":{"text":"History.walk (cyclomatic 19): History.walk has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/history.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24ffe785706cca3b3252694a98520c8e2fa044462799e1533b3e4878f059b64"}},{"ruleId":"D1","level":"warning","message":{"text":"Bump.create_pr (cyclomatic 18): Bump.create_pr has cyclomatic complexity 18 (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":"Library/Homebrew/bump.rb"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1888be0929a575f6b119df61260f53f6d00802f3d2bbd574c9c3c777c255435c"}},{"ruleId":"D1","level":"warning","message":{"text":"Brew.formula_to_hash (cyclomatic 18): Brew.formula_to_hash has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/brew.rb"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"1015aee1207e665648c392fd96274a9580c267852dfe505a73777c1336f5ff9b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.named_args (cyclomatic 18): Parser.named_args has cyclomatic complexity 18 (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":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"9151d0c187a661e0c9b6c9edf3d2da19ba9399bbaaaf2593df0b17a6ddd31f70"}},{"ruleId":"D1","level":"warning","message":{"text":"DirEmitter.prepare_aliases (cyclomatic 18): DirEmitter.prepare_aliases has cyclomatic complexity 18 (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":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"420abcc9035a1595db93f2ea60bc75ff7b315253b333d91cbf071091a7b4891b"}},{"ruleId":"D1","level":"warning","message":{"text":"BumpFormulaPr.update_resource_block! (cyclomatic 18): BumpFormulaPr.update_resource_block! has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump-formula-pr.rb"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd803ed91a44fec21423bf538d6e53b254afee7118836aadd1308dd378e4add"}},{"ruleId":"D1","level":"warning","message":{"text":"Contributions.maintainer_activity_summary (cyclomatic 18): Contributions.maintainer_activity_summary has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6cb8ad4686300c2711c6f5141d96246d56a95d1cbfca45fad1abb16163f782"}},{"ruleId":"D1","level":"warning","message":{"text":"DispatchBuildBottle.run (cyclomatic 18): DispatchBuildBottle.run has cyclomatic complexity 18 (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":"Library/Homebrew/dev-cmd/dispatch-build-bottle.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"748b2ed485f174e7f4e848cdcebeda9f382fe22886af152ed85c3fbc771b49fe"}},{"ruleId":"D1","level":"warning","message":{"text":"Unbottled.run (cyclomatic 18): Unbottled.run has cyclomatic complexity 18 (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":"Library/Homebrew/dev-cmd/unbottled.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"975cc96ee7dab188f055ecc9b1e17902bdc25a7105c940df75b93535ee7480f3"}},{"ruleId":"D1","level":"warning","message":{"text":"CurlDownloadStrategy.resolve_url_basename_time_file_size (cyclomatic 18): CurlDownloadStrategy.resolve_url_basename_time_file_size has cyclomatic complexity 18 (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":"Library/Homebrew/download_strategy/curl_download_strategy.rb"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fec6ba9c0fdae3c158c4eb989531cb7f764b9f3fe0e64cb8dc8b2909182eca"}},{"ruleId":"D1","level":"warning","message":{"text":"Formula.eligible_kegs_for_cleanup (cyclomatic 18): Formula.eligible_kegs_for_cleanup has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula.rb"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd44377d03a8bec492f3cae6a6a1af460620afd24d37ccd4bdc39c8c77b7e59"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaAuditor.audit_file (cyclomatic 18): FormulaAuditor.audit_file has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0d49d71a3bbe39916ec2c0d69fd9a2d1064219a6dc6d2c35a1b70df9240bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaInstaller.enqueue_fetch (cyclomatic 18): FormulaInstaller.enqueue_fetch has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e10f0e31bb61a30899919f2255cf93ee43f03f1bcd6dc32b06272e72e162e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"Keg.make_relative_symlink (cyclomatic 18): Keg.make_relative_symlink has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/keg.rb"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"044949e938c27f68310c11b7ca6219cac8723e897a0a7cf71b8d2d0c619a1664"}},{"ruleId":"D1","level":"warning","message":{"text":"McpServer.respond_to_tools_call (cyclomatic 18): McpServer.respond_to_tools_call has cyclomatic complexity 18 (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":"Library/Homebrew/mcp_server.rb"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f14bc43f67d0998883a3c0b6717b30d598ef7a3ccd872976569e609902d1319"}},{"ruleId":"D1","level":"warning","message":{"text":"Patches.patch_problems (cyclomatic 18): Patches.patch_problems has cyclomatic complexity 18 (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":"Library/Homebrew/rubocops/patches.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8c70374d7998405902b9e83400a0058da0b8fd6447991e550f49d57a2ef004"}},{"ruleId":"D1","level":"warning","message":{"text":"DescHelper.audit_desc (cyclomatic 18): DescHelper.audit_desc has cyclomatic complexity 18 (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":"Library/Homebrew/rubocops/shared/desc_helper.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"059356bf6cd1d591e2ee09f8f42c02109876ae5c6fbf80c2d4b47d607ba0e864"}},{"ruleId":"D1","level":"warning","message":{"text":"Cli.service_load (cyclomatic 18): Cli.service_load has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/services/cli.rb"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e983e8147d1e0169c2e775cc053657a3f2f0aee83697bd84ba533ccf85829d1"}},{"ruleId":"D1","level":"warning","message":{"text":"API.open_rest (cyclomatic 18): API.open_rest has cyclomatic complexity 18 (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":"Library/Homebrew/utils/github/api.rb"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85fb06daf662b3e6e05c4c4800d5fd7ff31835fbd2aca51c6b65b804f6807e9"}},{"ruleId":"D1","level":"warning","message":{"text":"Trust.entries (cyclomatic 17): Trust.entries has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/trust.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59b06979de34b32870bae3c5f8f464e2de6515744e136d76644fe3f09522064"}},{"ruleId":"D1","level":"warning","message":{"text":"FromAPILoader.load_from_struct (cyclomatic 17): FromAPILoader.load_from_struct has cyclomatic complexity 17 (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":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78f23eef44be35a1dd77ce04915508e86dc93b410ed55c50bbb6f6284ba8e2b"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedArgs.warn_if_cask_conflicts (cyclomatic 17): NamedArgs.warn_if_cask_conflicts has cyclomatic complexity 17 (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":"Library/Homebrew/cli/named_args.rb"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4efe882ba97256cc0b579734515ee6fd2384f383a6897eaf18a5e9fe41d0dfb"}},{"ruleId":"D1","level":"warning","message":{"text":"Info.print_json (cyclomatic 17): Info.print_json has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/info.rb"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"de620ac30766e7d89a00c71e6e5143939c364b5951773695e6b2d18335827972"}},{"ruleId":"D1","level":"warning","message":{"text":"DeprecateDisable.message (cyclomatic 17): DeprecateDisable.message has cyclomatic complexity 17 (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":"Library/Homebrew/deprecate_disable.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb79179dfa048fc44c17b569cd349f051e32ae8e1581d408f7f0e492ca8e639"}},{"ruleId":"D1","level":"warning","message":{"text":"Bump.handle_formulae_and_casks (cyclomatic 17): Bump.handle_formulae_and_casks has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed5b683a537328cb0bedd3f0b1a449c0fc173d6b613424cf221d8641e211e7f"}},{"ruleId":"D1","level":"warning","message":{"text":"Bump.livecheck_result (cyclomatic 17): Bump.livecheck_result has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c9780cf50271d4f4a513c91b93231c705e1a56b9b4c379310eb76276e25df2"}},{"ruleId":"D1","level":"warning","message":{"text":"Create.create_cask (cyclomatic 17): Create.create_cask has cyclomatic complexity 17 (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":"Library/Homebrew/dev-cmd/create.rb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"190ed1c74b009328c80c19d0cfc071fca0763e373d8da8dd12fe7122b8a7fe84"}},{"ruleId":"D1","level":"warning","message":{"text":"Extract.with_monkey_patch (cyclomatic 17): Extract.with_monkey_patch has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/extract.rb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4b34536ede092b0a0af894587014e88390802565b0b49066dce807fb307e00"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaInstaller.pour_bottle? (cyclomatic 17): FormulaInstaller.pour_bottle? has cyclomatic complexity 17 (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":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0155c36374d5040cdd9ce5563fe6993a63e65c8ad481e285e13915657fba11be"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaInstaller.build (cyclomatic 17): FormulaInstaller.build has cyclomatic complexity 17 (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":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f01975871cdd0211d8cd6de417eeecf0bdcbb57b471994e513a77cd167b6a5"}},{"ruleId":"D1","level":"warning","message":{"text":"FromNameLoader.try_new (cyclomatic 17): FromNameLoader.try_new has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formulary.rb"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"b670fa3440fa51f87e101094ca13c4faf2d9fe8bcce3c46f38fdcef0417bfcdd"}},{"ruleId":"D1","level":"warning","message":{"text":"Keg.relocate_build_prefix (cyclomatic 17): Keg.relocate_build_prefix has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/keg_relocate.rb"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adf12580d2133fe7ba800e1b9418323dfdf17f4e9e73c0cd18706dca986ead8"}},{"ruleId":"D1","level":"warning","message":{"text":"Readall.valid_casks? (cyclomatic 17): Readall.valid_casks? has cyclomatic complexity 17 (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":"Library/Homebrew/readall.rb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07a02e0bdf32ecb318e44594e20186b89e7844a326f7bff51c5e27517eac234"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallSteps.keychain_certificate_step_lines (cyclomatic 17): InstallSteps.keychain_certificate_step_lines has cyclomatic complexity 17 (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":"Library/Homebrew/rubocops/cask/install_steps.rb"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88d158fb30f626372f650aafb6f73b3e9d29e56aeb9c7fe121703a54b89ae31"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonVersions.audit_formula (cyclomatic 17): PythonVersions.audit_formula has cyclomatic complexity 17 (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":"Library/Homebrew/rubocops/lines.rb"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c8fc09f1366396e64e97e06f4b4b7188a93d313222feb7b20a10b4df8842bf"}},{"ruleId":"D1","level":"warning","message":{"text":"ShellCommands.on_send (cyclomatic 17): ShellCommands.on_send has cyclomatic complexity 17 (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":"Library/Homebrew/rubocops/shell_commands.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7802c672488985216cba8af2a61079ba67d8a3425954542aa5acd0219d5d382a"}},{"ruleId":"D1","level":"warning","message":{"text":"Curl.curl_http_content_headers_and_checksum (cyclomatic 17): Curl.curl_http_content_headers_and_checksum has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/curl.rb"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffb27cb506642c2141b83ae6102bdac2725ae652cccfa2a2ab3d3bacc62d5e8"}},{"ruleId":"D1","level":"warning","message":{"text":"Identify.registry_package_for (cyclomatic 17): Identify.registry_package_for has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/identify.rb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4753a36f5dd02de7295d7b7db7a55b505545bd3121e89d0617eb2901407dfe7f"}},{"ruleId":"D1","level":"warning","message":{"text":"Vulnerability.non_semver_fix_available_of_type? (cyclomatic 17): Vulnerability.non_semver_fix_available_of_type? has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/vulnerability.rb"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e383e0eb0c9421bfc249539799db0ff753763d8206d4a754a40a38353b6567"}},{"ruleId":"D1","level":"warning","message":{"text":"FromPathLoader.load (cyclomatic 16): FromPathLoader.load has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"19798a704db0190c1347b413936c99cac0c4a4e6ed142ab85ef8f41ca8b68eb1"}},{"ruleId":"D1","level":"warning","message":{"text":"FromNameLoader.try_new (cyclomatic 16): FromNameLoader.try_new has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"93efa81c4b98022cdc858b66fe133b8e94a83bcd79a4b0b79ef196709633ce08"}},{"ruleId":"D1","level":"warning","message":{"text":"DSL.sha256 (cyclomatic 16): DSL.sha256 has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/dsl.rb"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f409bf8b889889e724d505c85f3256e9e06812167c091cd183804501b0d13bed"}},{"ruleId":"D1","level":"warning","message":{"text":"Cleanup.cleanup_cache (cyclomatic 16): Cleanup.cleanup_cache has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cleanup.rb"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f38250ce39053fab12f57d1da22647313de8618560edfbe45da2dd6482fb25"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.switch (cyclomatic 16): Parser.switch has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"56850790b820a0e407c07f2988a0d4bf64d5ca3cf17d3c8091aaa26b6d0e11ff"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser.formulae (cyclomatic 16): Parser.formulae has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e647a705b2decd3d95a6cf70ec4d587c23567d55c7964e069a49ba5d9c512cbb"}},{"ruleId":"D1","level":"warning","message":{"text":"FetchCmd.cask_downloads (cyclomatic 16): FetchCmd.cask_downloads has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/fetch.rb"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d534b9a45b871e3ebea084b8f85a06ed167a632b1a93a5bbb38aa45547f3f908"}},{"ruleId":"D1","level":"warning","message":{"text":"FetchCmd.enqueue_api_formula_bottles? (cyclomatic 16): FetchCmd.enqueue_api_formula_bottles? has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/fetch.rb"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17c0b3f5d9808d02b05612f5256a671d9b33bff0faa2f7c8f9a644ee555fe63"}},{"ruleId":"D1","level":"warning","message":{"text":"Info.github_info (cyclomatic 16): Info.github_info has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/info.rb"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e966d5e6f7692bf5b843ada774657235d15c95bd1d9cd03d491bed2f14e71e"}},{"ruleId":"D1","level":"warning","message":{"text":"Dependency.installed? (cyclomatic 16): Dependency.installed? has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dependency.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d831d8bfb23acc447b96ca519fb693ed76b129692fc8ec46790f45a5fb34c1f1"}},{"ruleId":"D1","level":"warning","message":{"text":"DirEmitter.reconciliation_resource_records (cyclomatic 16): DirEmitter.reconciliation_resource_records has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c0b4b87c9242f5aee393c829d615d6da6ca51d630004ce584ca593749767b1"}},{"ruleId":"D1","level":"warning","message":{"text":"Bottle.keg_contain? (cyclomatic 16): Bottle.keg_contain? has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bottle.rb"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e007563c702807bdbfece4e792bc67fc8f8b364c3954ba212d94c6bf868fc86"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaAnalytics.run (cyclomatic 16): FormulaAnalytics.run has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/formula-analytics.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0543dfe64a5b7127c020cd168a294cd36181e513ec477237e48177ba55776efb"}},{"ruleId":"D1","level":"warning","message":{"text":"Unbottled.output_lost_bottles (cyclomatic 16): Unbottled.output_lost_bottles has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/unbottled.rb"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5791cd531be32fe008638b05f2dae93f540da03ada4893221d7dc2f29a69188"}},{"ruleId":"D1","level":"warning","message":{"text":"WhichUpdate.update_and_save! (cyclomatic 16): WhichUpdate.update_and_save! has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/which-update.rb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed08623d1ab72528086592fbb201d46a7274561016a42e354a707e5a2dbcdf8"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaCellarChecks.check_cpuid_instruction (cyclomatic 16): FormulaCellarChecks.check_cpuid_instruction has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_cellar_checks.rb"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"263b0168e520c5f95b7fef726d5667b230ccbca6abd4152c7fb5785d0433116f"}},{"ruleId":"D1","level":"warning","message":{"text":"Keg.elf_relocation_strings (cyclomatic 16): Keg.elf_relocation_strings has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/keg_relocate.rb"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"a853eb4849c9946a86b9a3f79ed9f27830d6c2a4661b48827ba12942f00c3ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"LinkageChecker.check_formula_deps (cyclomatic 16): LinkageChecker.check_formula_deps has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/linkage_checker.rb"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec2f2b27231951eb92599ab8cef7a1fda0550073e3fc34c8dff9cf40a7c7f6b"}},{"ruleId":"D1","level":"warning","message":{"text":"Livecheck.livecheck_url_to_string (cyclomatic 16): Livecheck.livecheck_url_to_string has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c32d085a5c3a4e33294d2a271593fe9883a3dbe7015e5bea77d2610dbb8c13"}},{"ruleId":"D1","level":"warning","message":{"text":"McpServer.handle_request (cyclomatic 16): McpServer.handle_request has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/mcp_server.rb"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a944d2d120714fcca6b52a7febcc1295b15c62bc51165e0d3f44e7ccc8fc063e"}},{"ruleId":"D1","level":"warning","message":{"text":"MissingFormula.tap_migration_reason (cyclomatic 16): MissingFormula.tap_migration_reason has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/missing_formula.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f2890aa6d1b3a13b1b392253109c0ecadd7e8ecd19dcb5d8e7851763844b6c"}},{"ruleId":"D1","level":"warning","message":{"text":"AssertStatements.audit_formula (cyclomatic 16): AssertStatements.audit_formula has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/lines.rb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e241855d5cc19d765afd2d16f8365e0d2386f651a11febcad547e766cf833f7e"}},{"ruleId":"D1","level":"warning","message":{"text":"RedundantGenerateCompletionsShells.audit_formula (cyclomatic 16): RedundantGenerateCompletionsShells.audit_formula has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/lines.rb"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"b059bd58dd23ceb9154f683365054a4406fe8e65c0c828ebad393a68321a80b6"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallStepsHelper.brew_ruby_step_node (cyclomatic 16): InstallStepsHelper.brew_ruby_step_node has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/shared/install_steps_helper.rb"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"82df80ee438b0b006aaaf8c058a987a790bc6b23d515ed81c4fb39d5074da0f6"}},{"ruleId":"D1","level":"warning","message":{"text":"Service.to_systemd_unit (cyclomatic 16): Service.to_systemd_unit has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/service.rb"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f92e0b3d82f12ebc806587351828d25d57be57c747aea770d59a9baba59c3e3"}},{"ruleId":"D1","level":"warning","message":{"text":"Cli.start (cyclomatic 16): Cli.start has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/services/cli.rb"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"462770b547c5ad988c1e73a06f419abd95d558129a72dd179bf78977fa65a79a"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemCommand.each_output_line (cyclomatic 16): SystemCommand.each_output_line has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/system_command.rb"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"54238b89eb5e0bae5c423d7986cb25d8c2433a9ec1ee99bf0cb2bdde7dcf4849"}},{"ruleId":"D1","level":"warning","message":{"text":"TapAuditor.check_renames (cyclomatic 16): TapAuditor.check_renames has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap_auditor.rb"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2961538ce126545e297d679e8d908ce22d7b483b76e441fe23a4730d0de43c9"}},{"ruleId":"D1","level":"warning","message":{"text":"UnversionedCaskChecker.guess_cask_version (cyclomatic 16): UnversionedCaskChecker.guess_cask_version has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unversioned_cask_checker.rb"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5018affa41fcfdd82750b185313b1add7ce693deb30f55e76b3cfbcbcf016c05"}},{"ruleId":"D1","level":"warning","message":{"text":"API.github_activity (cyclomatic 16): API.github_activity has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/api.rb"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"216dce24a2f41118f1a28c9df2b7947c486e1129b139d4cd42457a4ddf1a83d3"}},{"ruleId":"D1","level":"warning","message":{"text":"FormulaFeeds.generate (cyclomatic 16): FormulaFeeds.generate has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/formula_feeds.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"74022cae20c387b145617086822499fbd402228da64ed7069eeb12c8f9d22f01"}},{"ruleId":"D1","level":"warning","message":{"text":"Curl.curl_with_workarounds (cyclomatic 16): Curl.curl_with_workarounds has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/curl.rb"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7cf2991618fcc8032537c9d09a6577812a302df181fba119a821aa6e6d7446"}},{"ruleId":"D1","level":"warning","message":{"text":"Utils.popen (cyclomatic 16): Utils.popen has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/popen.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c8b3fb3880e203b9aa1be3e6168b8ef468cb665e98cbfdb326eef0f6b3da7b"}},{"ruleId":"D1","level":"warning","message":{"text":"Vulnerability.range_status_for_entries (cyclomatic 16): Vulnerability.range_status_for_entries has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/vulnerability.rb"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"822fad833d96ee693b0ad115d94e4fda06ca8d4282eeb2886be55ee7bc47d834"}},{"ruleId":"D2","level":"warning","message":{"text":"List.run (cognitive 184): List.run has cognitive complexity 184 (threshold 15). Drivers by points: if/else 66 (146 pts), boolean chains 28, ternaries 2 (6 pts), error handling 1 (4 pts) (nesting depth added 87). 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":"Library/Homebrew/cmd/list.rb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27410ffaf831c72128514366c004d766e407c99db618c605b31b7623602504b"}},{"ruleId":"D2","level":"warning","message":{"text":"Livecheck.latest_version (cognitive 162): Livecheck.latest_version has cognitive complexity 162 (threshold 15). Drivers by points: if/else 75 (126 pts), boolean chains 25, match/switch 3 (7 pts), ternaries 2 (4 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced243270aadc7b7495dbe4101555e63b8a2b556f596cec3f95ecb721f63fad4"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateReport.output_update_report (cognitive 150): UpdateReport.output_update_report has cognitive complexity 150 (threshold 15). Drivers by points: if/else 57 (124 pts), boolean chains 17, error handling 3 (9 pts) (nesting depth added 73). 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":"Library/Homebrew/cmd/update-report.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7faae13538a79c759d2d149ced29e07f289eabf342cbc78eceb821bb96659bd"}},{"ruleId":"D2","level":"warning","message":{"text":"BumpFormulaPr.run (cognitive 145): BumpFormulaPr.run has cognitive complexity 145 (threshold 15). Drivers by points: if/else 86 (113 pts), boolean chains 25, ternaries 2 (4 pts), error handling 2 (3 pts) (nesting depth added 30). 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":"Library/Homebrew/dev-cmd/bump-formula-pr.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"71df7a2cff3cf7d76ac0d790130e2c5eaba8f1adfe29cc9f377cf051dda7cc24"}},{"ruleId":"D2","level":"warning","message":{"text":"Livecheck.resource_version (cognitive 119): Livecheck.resource_version has cognitive complexity 119 (threshold 15). Drivers by points: if/else 65 (98 pts), boolean chains 16, ternaries 2 (4 pts), error handling 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80efb1b04c88d1597417cb4a38880af8f2745e4fe4b827289f39b8dfeff2ad9"}},{"ruleId":"D2","level":"warning","message":{"text":"Livecheck.run_checks (cognitive 112): Livecheck.run_checks has cognitive complexity 112 (threshold 15). Drivers by points: if/else 57 (87 pts), boolean chains 23, error handling 1, match/switch 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3611b6e6822f0bc188c16634894a6247962d09b78f99a1f185a485518ce400d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Bump.retrieve_versions_by_arch (cognitive 103): Bump.retrieve_versions_by_arch has cognitive complexity 103 (threshold 15). Drivers by points: if/else 40 (59 pts), boolean chains 40, ternaries 3, error handling 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b7cf1b3c887bbc2d32740b733242720b6b124e403d805a8edf0321a2cbfe90"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedArgs.load_formula_or_cask (cognitive 102): NamedArgs.load_formula_or_cask has cognitive complexity 102 (threshold 15). Drivers by points: if/else 33 (73 pts), error handling 5 (14 pts), boolean chains 13, match/switch 1 (2 pts) (nesting depth added 50). 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":"Library/Homebrew/cli/named_args.rb"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"145bf072908469fe18ade221605d168809b1f24ace758ff25d471f027721b7f3"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallCmd.run (cognitive 102): InstallCmd.run has cognitive complexity 102 (threshold 15). Drivers by points: if/else 41 (75 pts), boolean chains 15, error handling 5 (9 pts), match/switch 1 (3 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/install.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b134aae525fdd206a6a2da428b481d7275527e5096b3045ee247c448262ccc"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadQueue.fetch (cognitive 102): DownloadQueue.fetch has cognitive complexity 102 (threshold 15). Drivers by points: if/else 36 (77 pts), error handling 5 (13 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 52). 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":"Library/Homebrew/download_queue.rb"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6201765d519c4549020414cbd3520ac0016046275cad6abed1b732f28205dfe0"}},{"ruleId":"D2","level":"warning","message":{"text":"Bottle.bottle_formula (cognitive 99): Bottle.bottle_formula has cognitive complexity 99 (threshold 15). Drivers by points: if/else 60 (88 pts), boolean chains 8, ternaries 2, error handling 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bottle.rb"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"89cd8ff3ea9d6ed66f48ac5b010219ff705f5bfbc7e6885b24ea075544ce9dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.run_install_step (cognitive 97): Runner.run_install_step has cognitive complexity 97 (threshold 15). Drivers by points: if/else 39 (78 pts), boolean chains 18, match/switch 1 (nesting depth added 39). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/install_steps.rb"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc96f104f3e70a7ffb3c7b8ad2254f0b0a9a3aa6db420597e440791c905768f"}},{"ruleId":"D2","level":"warning","message":{"text":"PyPI.update_python_resources! (cognitive 96): PyPI.update_python_resources! has cognitive complexity 96 (threshold 15). Drivers by points: if/else 53 (71 pts), boolean chains 24, error handling 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/pypi.rb"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a37337b029743dc916ee9d17a1aab8f8535f1789e926a806f44f33d699363ee"}},{"ruleId":"D2","level":"warning","message":{"text":"AdvisoryMatch.run (cognitive 94): AdvisoryMatch.run has cognitive complexity 94 (threshold 15). Drivers by points: if/else 43 (59 pts), boolean chains 30, ternaries 1 (3 pts), error handling 1, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e90ce52b7beebb7cf4f606538fc3d380715a9c0b228cce02b2aad0e0900f97"}},{"ruleId":"D2","level":"warning","message":{"text":"Bump.retrieve_and_display_info_and_open_pr (cognitive 92): Bump.retrieve_and_display_info_and_open_pr has cognitive complexity 92 (threshold 15). Drivers by points: if/else 47 (62 pts), boolean chains 29, ternaries 1 (nesting depth added 15). 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":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"8674f8c54494c0d6295088139db4c3d8f0220ac5d87f8983217401755beb207d"}},{"ruleId":"D2","level":"warning","message":{"text":"Influx.query (cognitive 87): Influx.query has cognitive complexity 87 (threshold 15). Drivers by points: if/else 44 (63 pts), ternaries 8 (16 pts), boolean chains 4, loops 1 (2 pts), match/switch 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/influx.rb"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16bac4a39690b99af66a84f8ca0a28df8b9abab9f0e127a80764e5515f8b50d"}},{"ruleId":"D2","level":"warning","message":{"text":"Bump.version_with_cooldown (cognitive 84): Bump.version_with_cooldown has cognitive complexity 84 (threshold 15). Drivers by points: if/else 37 (71 pts), boolean chains 12, match/switch 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"390c507cfeaf851143aba272e7e9e187422f7a22281f9ea7be6e90a1486ae09a"}},{"ruleId":"D2","level":"warning","message":{"text":"Info.info_formula (cognitive 82): Info.info_formula has cognitive complexity 82 (threshold 15). Drivers by points: if/else 36 (52 pts), boolean chains 23, error handling 2 (4 pts), ternaries 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/info.rb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f7dde75cc1cf9e15fd0aa292dc787adb09de90188512fa3418458863a21c37"}},{"ruleId":"D2","level":"warning","message":{"text":"Repository.rows (cognitive 81): Repository.rows has cognitive complexity 81 (threshold 15). Drivers by points: if/else 33 (44 pts), boolean chains 17, ternaries 10 (16 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/repository.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f81a62133020a999eabaf10b82ef02c4f61fa4dbcb5996da40c00470d6299c"}},{"ruleId":"D2","level":"warning","message":{"text":"Install.install_formula? (cognitive 80): Install.install_formula? has cognitive complexity 80 (threshold 15). Drivers by points: if/else 36 (55 pts), boolean chains 25 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/install/check.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e60017635c1c683daa450de8a7597c25e82c10a13caf790dfd9fabc130965b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Contributions.run (cognitive 78): Contributions.run has cognitive complexity 78 (threshold 15). Drivers by points: if/else 39 (54 pts), boolean chains 22, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c547c1b8d741cf4169acdd2752b0ba3b7912a3434d50b09772ff698ddb37403"}},{"ruleId":"D2","level":"warning","message":{"text":"Tap.install (cognitive 75): Tap.install has cognitive complexity 75 (threshold 15). Drivers by points: if/else 36 (51 pts), boolean chains 19, ternaries 2 (4 pts), error handling 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap.rb"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9959b5147ffd47ae0a2d5a9cc7c37e91a8135c19c7002f3072865c6c88fd24c"}},{"ruleId":"D2","level":"warning","message":{"text":"API.fetch_json_api_file (cognitive 74): API.fetch_json_api_file has cognitive complexity 74 (threshold 15). Drivers by points: if/else 30 (46 pts), boolean chains 24, error handling 2, ternaries 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/api.rb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ff65621034421bc5c89cca60dbf882b0e1fa33c060e06303f28ab7185179cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Audit.run (cognitive 73): Audit.run has cognitive complexity 73 (threshold 15). Drivers by points: if/else 42 (53 pts), boolean chains 19, ternaries 1 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/audit.rb"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8136e2f54ad4852bb81440d5bba0c1e3ae5390747fe548bfb0d1f55bce1a2f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaAuditor.audit_specs (cognitive 68): FormulaAuditor.audit_specs has cognitive complexity 68 (threshold 15). Drivers by points: if/else 32 (53 pts), boolean chains 14, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"9579e8da70a363f6fd0fdf225064a6a762c680ba6cec95c2c1914ce46b0e33dc"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaAuditor.audit_deps (cognitive 67): FormulaAuditor.audit_deps has cognitive complexity 67 (threshold 15). Drivers by points: if/else 34, boolean chains 27, error handling 3 (6 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0693fdac82e51883c113a59a10b7e98e072bbe261f8df7fcbf1213326e0af4"}},{"ruleId":"D2","level":"warning","message":{"text":"Audit.audit_signing (cognitive 66): Audit.audit_signing has cognitive complexity 66 (threshold 15). Drivers by points: if/else 31 (43 pts), boolean chains 20, match/switch 2, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52d77ff2367dbcdd092d093f837320032592db39b1cb69c7cd1234b641d383b"}},{"ruleId":"D2","level":"warning","message":{"text":"Cli.stop (cognitive 66): Cli.stop has cognitive complexity 66 (threshold 15). Drivers by points: if/else 31 (50 pts), boolean chains 13, loops 1 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/services/cli.rb"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5baa9ea6563dd1662b90a5fffbd96844a77a1d2ca1d5a8903d13f2460d8006d"}},{"ruleId":"D2","level":"warning","message":{"text":"Moved.move (cognitive 64): Moved.move has cognitive complexity 64 (threshold 15). Drivers by points: if/else 23 (56 pts), boolean chains 8 (nesting depth added 33). 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":"Library/Homebrew/cask/artifact/moved.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3172288e1053d9763edfa5710158aeaab809675da6f4327d13aaadc7407fc71"}},{"ruleId":"D2","level":"warning","message":{"text":"Release.run (cognitive 63): Release.run has cognitive complexity 63 (threshold 15). Drivers by points: if/else 27 (42 pts), error handling 8 (10 pts), boolean chains 8, ternaries 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/release.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74d6e5cac97f06dca83a24b72e229f015ede94a08838086f4ae57b7824a8068"}},{"ruleId":"D2","level":"warning","message":{"text":"UpgradeCmd.run (cognitive 59): UpgradeCmd.run has cognitive complexity 59 (threshold 15). Drivers by points: if/else 24 (38 pts), boolean chains 19, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/upgrade.rb"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfe0e729767cd729c6db24b43b97649f4e07e18368e3feecdc032993e37804b"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecSubcommand.run_external_command (cognitive 57): ExecSubcommand.run_external_command has cognitive complexity 57 (threshold 15). Drivers by points: if/else 36 (47 pts), boolean chains 7, error handling 1 (3 pts) (nesting depth added 13). 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":"Library/Homebrew/bundle/subcommand/exec.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdad96cb62d047147d4240e4d735ef11059d3a9d99f1be26933fc5d34e927614"}},{"ruleId":"D2","level":"warning","message":{"text":"StaleLeadMaintainerPrApproval.evaluate (cognitive 54): StaleLeadMaintainerPrApproval.evaluate has cognitive complexity 54 (threshold 15). Drivers by points: if/else 27 (35 pts), boolean chains 19 (nesting depth added 8). 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":".github/scripts/approve_stale_lead_maintainer_prs.rb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d660819a3e86beb9fdba552aa9f47a0f8f915d71149e0854c3ce9b563c44a1f4"}},{"ruleId":"D2","level":"warning","message":{"text":"OsvExport.merge_range_transitions (cognitive 54): OsvExport.merge_range_transitions has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 22, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/osv_export.rb"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2df4bc169b7f89b181b9bf41efd7ca8f238c5cec490d5152807e3ebb42ce5a"}},{"ruleId":"D2","level":"warning","message":{"text":"BumpCaskPr.replace_version_and_checksum (cognitive 53): BumpCaskPr.replace_version_and_checksum has cognitive complexity 53 (threshold 15). Drivers by points: if/else 25 (33 pts), boolean chains 18, ternaries 2 (nesting depth added 8). 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":"Library/Homebrew/dev-cmd/bump-cask-pr.rb"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"4868a4095b7b80513a3e797f7f6afd976502bfa4aaf677475f068482dd6d0d1a"}},{"ruleId":"D2","level":"warning","message":{"text":"Extract.run (cognitive 53): Extract.run has cognitive complexity 53 (threshold 15). Drivers by points: if/else 28 (45 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/extract.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5be68b61b64b4609531fb7b9535e623d58b8ac5cfa00c942c6352ebb4984078"}},{"ruleId":"D2","level":"warning","message":{"text":"CleanupSubcommand.cleanup (cognitive 52): CleanupSubcommand.cleanup has cognitive complexity 52 (threshold 15). Drivers by points: if/else 29 (48 pts), boolean chains 4 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/subcommand/cleanup.rb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb784c083e0a247fa9f1ecac650e2f95bc0cce5fffe84505816e40fa92c763f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Bottle.merge (cognitive 52): Bottle.merge has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 16, error handling 1 (2 pts), match/switch 1, ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bottle.rb"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95c594eb1e3fc7fce6ab31fadd301e01e98f4e7bec52a6b1895c305a8e88152"}},{"ruleId":"D2","level":"warning","message":{"text":"BumpCaskPr.run (cognitive 52): BumpCaskPr.run has cognitive complexity 52 (threshold 15). Drivers by points: if/else 28 (35 pts), boolean chains 12, error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 9). 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":"Library/Homebrew/dev-cmd/bump-cask-pr.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fd61064919ae3cba82cd75ef78779340ace0db9983c5727154b9028ba7db66"}},{"ruleId":"D2","level":"warning","message":{"text":"UninstallCmd.run (cognitive 51): UninstallCmd.run has cognitive complexity 51 (threshold 15). Drivers by points: if/else 25 (37 pts), boolean chains 9, error handling 2 (3 pts), match/switch 1, ternaries 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/uninstall.rb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfd5f79a97effbcedd449ac66823f05bf6c824873a0fbb6495fcb0f21555ef3"}},{"ruleId":"D2","level":"warning","message":{"text":"Cleanup.stale_formula? (cognitive 50): Cleanup.stale_formula? has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (35 pts), error handling 4 (8 pts), boolean chains 7 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cleanup.rb"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"692e6f2488cf9c026aa333c47a08f0f422f4a45147a28463f0c10cbb02d6d93a"}},{"ruleId":"D2","level":"warning","message":{"text":"FetchCmd.run (cognitive 50): FetchCmd.run has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (37 pts), error handling 2 (7 pts), match/switch 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/fetch.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"654c1c978c4352a61e10cd01f5c86a0ce98d7fca9c7d4383e98ba29efffaeae8"}},{"ruleId":"D2","level":"warning","message":{"text":"Untap.run (cognitive 50): Untap.run has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (34 pts), error handling 3 (10 pts), boolean chains 6 (nesting depth added 28). 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":"Library/Homebrew/cmd/untap.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b738c05b55b0a1214becb7d65e3215bf10b3247cfd4f509f8ae796cb6bc1403d"}},{"ruleId":"D2","level":"warning","message":{"text":"Reporter.migrate_tap_migration (cognitive 50): Reporter.migrate_tap_migration has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (41 pts), error handling 2 (6 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/update_report/reporter.rb"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde1447a6e08a2ba6949a749f06926bc325d19d76e831f1613037edfed16e21e"}},{"ruleId":"D2","level":"warning","message":{"text":"Curl.curl_check_http_content (cognitive 49): Curl.curl_check_http_content has cognitive complexity 49 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 19, error handling 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/curl.rb"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95ea3a8b6b74448f7686fbdd2b0ddfbc87c428390241f7782734166e3bd02d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Bump.run (cognitive 48): Bump.run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (28 pts), ternaries 7 (14 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"515447f3a06af7ebfd220ecdc7a5f532889cdcb3360cfe4198bd7fa97cc8a0f3"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedAudits.new_domain_problem (cognitive 47): SharedAudits.new_domain_problem has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (25 pts), error handling 4 (9 pts), boolean chains 5, match/switch 1 (3 pts), ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/shared_audits.rb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a028c07113a5653ac41c27e45cfb48e560a301b15a9bd9fb27e24c9339b0f1"}},{"ruleId":"D2","level":"warning","message":{"text":"App.install_phase (cognitive 46): App.install_phase has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 19 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/artifact/app.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ba94b74673d72e8964a03952da42eca0c8a5c4827fada9cd8afb25f63351f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Miscellaneous.audit_formula (cognitive 46): Miscellaneous.audit_formula has cognitive complexity 46 (threshold 15). Drivers by points: if/else 34 (37 pts), boolean chains 9 (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":"Library/Homebrew/rubocops/lines.rb"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"7836d2a3a91e3c59d7dfaa74648adcc6acff55db6354ac120ce827c9f23f7115"}},{"ruleId":"D2","level":"warning","message":{"text":"PlatformIndependence.body? (cognitive 46): PlatformIndependence.body? has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 15, match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/platform_independence.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e376fba3ea32c6a15bce0f5b94134f578965285633c2bb3d0a45eca82a7896"}},{"ruleId":"D2","level":"warning","message":{"text":"Upgrade.upgrade_casks! (cognitive 45): Upgrade.upgrade_casks! has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 13, error handling 3 (5 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":"Library/Homebrew/cask/upgrade.rb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b92da3deb9718fe63220a865c33f89892aa44b9f3763c36273b1054c8dee23"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaHistory.report (cognitive 45): FormulaHistory.report has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (25 pts), boolean chains 12, ternaries 3 (6 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/formula_history.rb"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac0945aba8773d29bcbafcfd10a00d960126db58dde14026ee5a2b12455957b"}},{"ruleId":"D2","level":"warning","message":{"text":"PrPull.run (cognitive 44): PrPull.run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 26 (29 pts), boolean chains 15 (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":"Library/Homebrew/dev-cmd/pr-pull.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"deabdd3d8cc98eca3e1bc6181fd9b8bef3a4150395a2f87f62e330d3cb3fd6d2"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkageChecker.check_dylibs (cognitive 44): LinkageChecker.check_dylibs has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 8, error handling 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/linkage_checker.rb"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"114a3c71f88983efffce4236ac6147fd7eb3dd790d38ae5d44a585b791af5427"}},{"ruleId":"D2","level":"warning","message":{"text":"Uninstall.uninstall_kegs (cognitive 44): Uninstall.uninstall_kegs has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (36 pts), error handling 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/uninstall.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3693b1ce4392836885d753281b1619216cb140707fdfae6a2eb8433af945a24"}},{"ruleId":"D2","level":"warning","message":{"text":"GemSetup.install_bundler_gems! (cognitive 44): GemSetup.install_bundler_gems! has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (39 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/gem_setup.rb"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c761f84f08183f95640f6160dc2b98f4363287d326959776ee32451d385956"}},{"ruleId":"D2","level":"warning","message":{"text":"Cask.install! (cognitive 42): Cask.install! has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (24 pts), ternaries 4 (9 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/cask.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1236f7bef090cdf70b9ffd8488e3c7eec9c1fb216d8877db1c8b1d823c7f4e"}},{"ruleId":"D2","level":"warning","message":{"text":"Unbottled.output_unbottled (cognitive 42): Unbottled.output_unbottled has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (39 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/unbottled.rb"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedd16f0598e7096242a0d040300e8f361869d2911354324398579c23e981001"}},{"ruleId":"D2","level":"warning","message":{"text":"Version.\u003C=\u003E (cognitive 42): Version.\u003C=\u003E has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 8, loops 1, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/version.rb"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4e366cff410034529b6f43460c96026f334b66ff8ba78d8fdf6f672a9f2dc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Deps.run (cognitive 41): Deps.run has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 6, match/switch 2 (5 pts), ternaries 1 (nesting depth added 9). 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":"Library/Homebrew/cmd/deps.rb"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9ab1a8a463a1eb43e5ec5e2c5d54f3637039fcc6ffd6c930260a35598c7ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"Lgtm.run (cognitive 41): Lgtm.run has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (31 pts), ternaries 3 (8 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/lgtm.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e7c23bf941f8725537bd1e514a7736e10c4bfd89c3dae6b43a6e6bf02e8ead"}},{"ruleId":"D2","level":"warning","message":{"text":"InstalledDependents.find_some_installed_dependents (cognitive 41): InstalledDependents.find_some_installed_dependents has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (27 pts), error handling 4 (11 pts), boolean chains 2, match/switch 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/installed_dependents.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcc38b69d2e5f3946744bb5d8acdeb5d42359d2e1600d0669495663173f1a32"}},{"ruleId":"D2","level":"warning","message":{"text":"Upgrade.outdated_casks (cognitive 40): Upgrade.outdated_casks has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/upgrade.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a8ad7a43072e5d5f125ff30ae0157c866962f8abe9b290aa892505cb303a87"}},{"ruleId":"D2","level":"warning","message":{"text":"Link.run (cognitive 40): Link.run has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 9, error handling 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/link.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2371434219f59a80a07c5047c09f8e2e5335cd959b92e2ca24b4e8eb23347036"}},{"ruleId":"D2","level":"warning","message":{"text":"BumpUnversionedCasks.bump_unversioned_cask (cognitive 40): BumpUnversionedCasks.bump_unversioned_cask has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (24 pts), error handling 4 (11 pts), boolean chains 5 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump-unversioned-casks.rb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e44c8b8e9cb4e3ea543544df22cef6bd9751d1acd566fe6031e528eeedf83c8"}},{"ruleId":"D2","level":"warning","message":{"text":"OnSystemConditionals.simplify_os_sha256_stanzas (cognitive 40): OnSystemConditionals.simplify_os_sha256_stanzas has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 21, if/else 15 (16 pts), ternaries 2 (3 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/on_system_conditionals.rb"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e4b607b501186d732a5be94e87b952eb2f5ec307d80bea21aad40d963b6c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"Tap.apply_redirected_remote! (cognitive 40): Tap.apply_redirected_remote! has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 19, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap.rb"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"0351ed8343c36abd8b6894815abf707eb86f4b664151891a71d333ebd2b608f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parse (cognitive 39): Parser.parse has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (27 pts), boolean chains 8, ternaries 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10f9b236e5fcf1f920aa0c5fc8f0d4daf582d0e5ff6ad619a629d188609b075"}},{"ruleId":"D2","level":"warning","message":{"text":"CurlDownloadStrategy.fetch (cognitive 39): CurlDownloadStrategy.fetch has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 5, error handling 4 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/download_strategy/curl_download_strategy.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a0a1e4a5f91e3ae33cbc908d734cece3b700d2e26012328872349e00b4b504"}},{"ruleId":"D2","level":"warning","message":{"text":"DocstringParser.parse_content (cognitive 39): DocstringParser.parse_content has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 14, ternaries 1 (4 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/yard/docstring_parser.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0084070d36821eaa3daeca9ff452d4442cc9c59a54d13d2ea20daf2c0fe7c66"}},{"ruleId":"D2","level":"warning","message":{"text":"CPAN.update_perl_resources! (cognitive 38): CPAN.update_perl_resources! has cognitive complexity 38 (threshold 15). Drivers by points: if/else 26 (35 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/cpan.rb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad242bfe58fdf161b05f4a3987bc3111cfa1a9382d27f2dc4cd4a663e777ac2"}},{"ruleId":"D2","level":"warning","message":{"text":"Reporter.report (cognitive 37): Reporter.report has cognitive complexity 37 (threshold 15). Drivers by points: if/else 28 (32 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/update_report/reporter.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbb9d660d953e7f5653ac4f7f9d0b3b985c2b08e970b9338dcbb1192b7c3229"}},{"ruleId":"D2","level":"warning","message":{"text":"UpgradeCmd.formulae_upgrade_context (cognitive 37): UpgradeCmd.formulae_upgrade_context has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/upgrade.rb"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe1cae88d947a582ee4bc6efd74738dd286e18d7c4e80ef7b0e05171a59b78d"}},{"ruleId":"D2","level":"warning","message":{"text":"PrUpload.run (cognitive 37): PrUpload.run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (37 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/pr-upload.rb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35671944d060b1b8f1b0be6109d58b5b1315050e3b79b47be7553f7a87b87ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Formula.eligible_kegs_for_cleanup (cognitive 37): Formula.eligible_kegs_for_cleanup has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 4 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula.rb"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"da06daa5f2264b4b2248507dc2ac480f08cc5870eb8c584a574a9ed7888992d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Upgrade.upgrade_dependents (cognitive 37): Upgrade.upgrade_dependents has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (22 pts), error handling 3 (6 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 7). 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":"Library/Homebrew/upgrade.rb"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2232cccbde6128de316eff3177343806608ffff464f740d036146e0e00cc63"}},{"ruleId":"D2","level":"warning","message":{"text":"Caskroom.migrate_caskfile_to_json (cognitive 36): Caskroom.migrate_caskfile_to_json has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 14, error handling 2 (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":"Library/Homebrew/cask/caskroom.rb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c607ac9af03576f346002ab9fdeabe5cc1e9d607a4da518cbbe0f28b75b63242"}},{"ruleId":"D2","level":"warning","message":{"text":"LivecheckCmd.run (cognitive 36): LivecheckCmd.run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 6 (12 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/livecheck.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f0aeb02f64b4a74e12ec983b0487727dedc45d9627ec2b01fcf6b6270e98e1"}},{"ruleId":"D2","level":"warning","message":{"text":"GitHubPackages.upload_bottle (cognitive 36): GitHubPackages.upload_bottle has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 5, error handling 1 (2 pts), ternaries 2, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/github_packages.rb"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"849c9adf1ab0a88cfbb0ebd98a92ff918648fb988921c6fc5509b18f191fefaa"}},{"ruleId":"D2","level":"warning","message":{"text":"StaleLeadMaintainerPrApproval.finish (cognitive 35): StaleLeadMaintainerPrApproval.finish has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 11, ternaries 3 (4 pts) (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":".github/scripts/approve_stale_lead_maintainer_prs.rb"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"2935ba46f2d344efdb08b65952104cc5ab281358276cc8208f5879cbbad80c7b"}},{"ruleId":"D2","level":"warning","message":{"text":"VersionInstall.run (cognitive 35): VersionInstall.run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (24 pts), error handling 3 (6 pts), boolean chains 5 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/version-install.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d6733138efca9caa420ab858605029030b675377cce6e3cdf403878868af1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Typecheck.run (cognitive 35): Typecheck.run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 6, ternaries 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/typecheck.rb"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d12308dc38bb7d6e1d58d84426f166a529c88d154ea922e937f1c0d9580889c"}},{"ruleId":"D2","level":"warning","message":{"text":"Style.check_style_impl (cognitive 35): Style.check_style_impl has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 12, 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":"Library/Homebrew/style.rb"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5c04b2186f0fea0ea99beeebedcc5f20ea5a226cb35353f832cd4f06f4b4a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Cleanup.prune_prefix_symlinks_and_directories (cognitive 34): Cleanup.prune_prefix_symlinks_and_directories has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cleanup.rb"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfead34432e83d89ca8ef13eedc62be189c5e774e98035f563cb2355104505b"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaAuditor.audit_license (cognitive 34): FormulaAuditor.audit_license has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 5 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"97eb31a68d9566ebb20bc2e8541fb7ccfa539dcd59ab3a649bc8eff9754d74da"}},{"ruleId":"D2","level":"warning","message":{"text":"Formulary.load_formula_from_struct! (cognitive 34): Formulary.load_formula_from_struct! has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22 (34 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formulary.rb"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8f6e322e0e0d764f9558e1c96cff975ba3e20955764ca9dfef5e4ab21e325d"}},{"ruleId":"D2","level":"warning","message":{"text":"Formulary.tap_formula_name_type (cognitive 34): Formulary.tap_formula_name_type has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 5 (11 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formulary.rb"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ca44ce4a511d2ebdd2b0f8e15e979ec124f33abbb160e1ba3c04df3a0c9a28"}},{"ruleId":"D2","level":"warning","message":{"text":"Keg.link_dir (cognitive 34): Keg.link_dir has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/keg.rb"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadc59c9b97edbacf463c18d50c0a4477e5e03d46475f8d73a1c8d21b95f7b74"}},{"ruleId":"D2","level":"warning","message":{"text":"Style.run_rubocop (cognitive 34): Style.run_rubocop has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 7, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/style.rb"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fb9600bb708c058f695d301a66ee5278b7a0b35ba1a9f19b3bb2d16cea0f82"}},{"ruleId":"D2","level":"warning","message":{"text":"Installer.homebrew_batchable? (cognitive 33): Installer.homebrew_batchable? has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 2, error handling 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/installer.rb"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4126ab61729bf64ab7bf7495c6c6cb888aca08c12516342822deb86cd3c431"}},{"ruleId":"D2","level":"warning","message":{"text":"Upgrade.upgrade_cask (cognitive 33): Upgrade.upgrade_cask has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (24 pts), error handling 3 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/upgrade.rb"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4331867956385621f98c3e0bda5918aa20f89f92f23df996d06b431056b9bdff"}},{"ruleId":"D2","level":"warning","message":{"text":"Info.print_json (cognitive 33): Info.print_json has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 2, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/info.rb"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae14e05333d5dc21d60d458c59498b5d3ce755c5b8f9ca03f52bfbb4daf27348"}},{"ruleId":"D2","level":"warning","message":{"text":"TapInfo.print_tap_info (cognitive 33): TapInfo.print_tap_info has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 4, ternaries 1 (4 pts) (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":"Library/Homebrew/cmd/tap-info.rb"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9047a692f363c5337fd56198701c76ed51d101ea919236b95f63536927e4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Utils.popen (cognitive 33): Utils.popen has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (25 pts), error handling 4 (8 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/popen.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38aa83487063f4d95922a98febecfe55cf5812d727393268ca1432e46be02ff"}},{"ruleId":"D2","level":"warning","message":{"text":"AdvisoryOverrides.initialize (cognitive 33): AdvisoryOverrides.initialize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 11 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/advisory_overrides.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0541174de378fd869d3ddf6d5dcbdfb7fa8f126e9407ba959206fd09a20aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"Build.install (cognitive 32): Build.install has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/build.rb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac34d77bffffb2e232c2faa6e4c44755436fc4682bbb6ee784685b1e233c5348"}},{"ruleId":"D2","level":"warning","message":{"text":"CaskLoader.tap_cask_token_type (cognitive 32): CaskLoader.tap_cask_token_type has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 4 (10 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"449c2ed378d34cfe265f3626a92689b79fcf6cf6ac8c375b4d430827cf95fe97"}},{"ruleId":"D2","level":"warning","message":{"text":"BumpFormulaPr.patches_for_removal (cognitive 32): BumpFormulaPr.patches_for_removal has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 15, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump-formula-pr.rb"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc23b3679e0342aab4c202044508aa66796406d100a1bc8c8b84933194c947d3"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.finish (cognitive 32): FormulaInstaller.finish has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 8 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d2bd97569a0958440802096c4f87deccdffabbd678126d171fd1efe3096f62"}},{"ruleId":"D2","level":"warning","message":{"text":"OnSystemConditionals.audit_identical_sha256_across_architectures (cognitive 32): OnSystemConditionals.audit_identical_sha256_across_architectures has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/on_system_conditionals.rb"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa20394c06ac16afad23f176fd5445e01b66096e904fe63cb79c550965c7f903"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallStepsHelper.simple_install_step_line (cognitive 32): InstallStepsHelper.simple_install_step_line has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/shared/install_steps_helper.rb"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a891ca74ea09037d470ffb0071af775da6fb0d6657c3b3fe480fa075fd1c653"}},{"ruleId":"D2","level":"warning","message":{"text":"Caveats.keg_only_text (cognitive 31): Caveats.keg_only_text has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 6 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/caveats.rb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d899b487b39178a11dd80b180eae24d0e9653646dc725a39ddc03b694242a67"}},{"ruleId":"D2","level":"warning","message":{"text":"Info.run (cognitive 31): Info.run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (24 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/info.rb"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6e8519c96c23ec95a4008196e51deb2c0b2f092031f2926147fb5a60a60f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Outdated.print_outdated (cognitive 31): Outdated.print_outdated has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/outdated.rb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"285affed50763b6d3f9b4ed035e1beff26f6c87cf09105a3a5b3f82be140c221"}},{"ruleId":"D2","level":"warning","message":{"text":"Reinstall.run (cognitive 31): Reinstall.run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (20 pts), error handling 4 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/reinstall.rb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"72752b5dcc503341847408c005640eef18c7a8dd0e77ff0be3e9af789cacc088"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaCellarChecks.check_prebuilt_npm_binaries (cognitive 31): FormulaCellarChecks.check_prebuilt_npm_binaries has cognitive complexity 31 (threshold 15). Drivers by points: if/else 23, boolean chains 5, error handling 2, ternaries 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_cellar_checks.rb"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bc76e5724e2fb3d9095f03d4987a015b26f6b0a578c76c3c0219d873c08e33"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaCreator.initialize (cognitive 31): FormulaCreator.initialize has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 7, error handling 1 (3 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":"Library/Homebrew/formula_creator.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2438844f54f4d54d89a297734bf046c4715793c12e8b80988294f1ca5c813c24"}},{"ruleId":"D2","level":"warning","message":{"text":"Identify.registry_purl (cognitive 31): Identify.registry_purl has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 2, match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/identify.rb"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c713538d39f060493ae8c70eb8c46faa5b6f167ac12983bec0b967a50b2d5268"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaStructGenerator.generate_formula_struct_hash (cognitive 30): FormulaStructGenerator.generate_formula_struct_hash has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 15, if/else 11 (13 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/api/formula/formula_struct_generator.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35ca9d74ae627113527624ba8629c0b39f296fb34639deeb6d61b39700f0a9c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.generate_usage_banner (cognitive 30): Parser.generate_usage_banner has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0d688a7ad34d8d1d27db5e68ae5256a2a71978b47287f30f9a5ac7b0be806b"}},{"ruleId":"D2","level":"warning","message":{"text":"Untrust.run (cognitive 30): Untrust.run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 2 (4 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/untrust.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8cb7616cda4bed344458297c61b492d347486baf8783d917e9970fb4f66c79"}},{"ruleId":"D2","level":"warning","message":{"text":"BumpFormulaPr.update_resource_block! (cognitive 30): BumpFormulaPr.update_resource_block! has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (30 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump-formula-pr.rb"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd03adf2b735fd070770f54768db3163e2a6416a5d98c99d3a40f615dca9028"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.check_install_sanity (cognitive 30): FormulaInstaller.check_install_sanity has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 9 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b17beaa8f9631738300ebdddfad732b616eb4428ac4e5a92ad291b15420fddc"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.install (cognitive 30): FormulaInstaller.install has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 6, error handling 3 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39f5b5021b92f84421b5104be9bdf63a2cd584c16a289a4928ad3466c491f8e"}},{"ruleId":"D2","level":"warning","message":{"text":"JavaVersions.audit_formula (cognitive 30): JavaVersions.audit_formula has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (24 pts), match/switch 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/lines.rb"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a3640c67ec2c84cca95adeaeae79c27fc43247789a038fc364acca7b0fe759"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedArgs.to_paths (cognitive 29): NamedArgs.to_paths has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 8, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/named_args.rb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"9820393187565ca0f43c7a0e5c3f896d2a9b446b1794ac663975c170caec98af"}},{"ruleId":"D2","level":"warning","message":{"text":"Contributions.scan_maintainer_contributions (cognitive 29): Contributions.scan_maintainer_contributions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21, boolean chains 6, ternaries 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eeccde6f04c9cca171cd8bf09ec7b07a7b8d6fd101149bff2687a29212b9192"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceAuditor.audit_urls (cognitive 29): ResourceAuditor.audit_urls has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 9, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/resource_auditor.rb"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ae2d870f53d65e18127888b16a18e68c369a067b55270e00a1cded204f3c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentsRedundancy.audit_formula (cognitive 29): ComponentsRedundancy.audit_formula has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 7, ternaries 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/components_redundancy.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16b1a0b411e2ccb2741d94adaeb82ddaa060ca08c1e6456d2093de8c3a17e28"}},{"ruleId":"D2","level":"warning","message":{"text":"Releases.report (cognitive 29): Releases.report has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 11, if/else 8 (11 pts), ternaries 3 (5 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/releases.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"381673d6256a05a186180ab14c35d9a5ce6b7b48e53368dd7bb99427c7eb204d"}},{"ruleId":"D2","level":"warning","message":{"text":"Curl.curl_http_content_headers_and_checksum (cognitive 29): Curl.curl_http_content_headers_and_checksum has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (22 pts), error handling 1 (4 pts), boolean chains 2, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/curl.rb"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"1893c2ddd89c2748f5deb6e6831ee0afc3f19624709f6c028895267f8efb2150"}},{"ruleId":"D2","level":"warning","message":{"text":"Audit.audit_min_os (cognitive 28): Audit.audit_min_os has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 10, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4b332ea508e8316301bfba28d98a23799e1b11db79e3e9e6fb547592ddd124"}},{"ruleId":"D2","level":"warning","message":{"text":"Edit.run (cognitive 28): Edit.run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 9 (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":"Library/Homebrew/dev-cmd/edit.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2234a09a017cd8271f2c9f49315612fbd0691afe82bcd26984cba8c9f5291f98"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaAuditor.audit_file (cognitive 28): FormulaAuditor.audit_file has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 6, error handling 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":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f25df0a1e925b843f299018b7a00987343120e38329a60e98362b573138e522"}},{"ruleId":"D2","level":"warning","message":{"text":"Mixin.odeprecated (cognitive 28): Mixin.odeprecated has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22 (23 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/output.rb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f057a147dc581a5b9c7a5433dc475f593205a540dd492835876b861ca5d649b"}},{"ruleId":"D2","level":"warning","message":{"text":"Audit.extract_artifacts (cognitive 27): Audit.extract_artifacts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 10 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15f7a7513a129ed989de9bad5b18cf4bf8269f76e1ad515f6c4b8c3c57d2f6e"}},{"ruleId":"D2","level":"warning","message":{"text":"Cask.auto_updates_bundle_outdated? (cognitive 27): Cask.auto_updates_bundle_outdated? has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 8, error handling 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":"Library/Homebrew/cask/cask.rb"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4a49eee319ff4c64b3d318cba7fc7b9e2aa3a8b426ed62c54a3468e4ce7133"}},{"ruleId":"D2","level":"warning","message":{"text":"DirEmitter.reconcile (cognitive 27): DirEmitter.reconcile has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 6, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"d534548bfb3665e6f12191316c8f603bd85e457579faee3f0becea74bfc128bb"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaAuditor.audit_revision (cognitive 27): FormulaAuditor.audit_revision has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14, boolean chains 13. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"d474bd50b2a012120a2c025618703fa46fb3e689671da521d964e0119a51e14d"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.forbidden_tap_check (cognitive 27): FormulaInstaller.forbidden_tap_check has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 7 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee059c9d731bddf8dbac51e87b1c2ef5ba957e185771efc9ba67d08cb1d2c190"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaFeeds.changes (cognitive 27): FormulaFeeds.changes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 8, ternaries 2 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/formula_feeds.rb"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83ea63ec77c86486779497f3c3c0a3c84656994dead1b740dcd9f86b2fca1e1"}},{"ruleId":"D2","level":"warning","message":{"text":"Sponsors.open_collective (cognitive 27): Sponsors.open_collective has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, ternaries 4, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/sponsors.rb"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf65fa9aa1e4ad251fabe16681bd7985e33f4c1f73bcbc654cf2610c6a5a9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Trust.entries (cognitive 26): Trust.entries has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/trust.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"39490fee0b7fac4f1d63075584eb270ff24eb1602f23e466eb065b6b40305f19"}},{"ruleId":"D2","level":"warning","message":{"text":"Audit.audit_rosetta (cognitive 26): Audit.audit_rosetta has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 8, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa8530324fdaa7597c4258d86632cc7c4bc85d47fa53b4069b9dca360887761"}},{"ruleId":"D2","level":"warning","message":{"text":"Audit.cask_bundle_min_os (cognitive 26): Audit.cask_bundle_min_os has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 2 (3 pts), error handling 1 (2 pts), boolean chains 1, 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":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bacd8196aa6cf1ad885313a1ec9f1a83c08faeb894b1cdf764df7f0739559f"}},{"ruleId":"D2","level":"warning","message":{"text":"AdvisoryMatch.reconcile_formula (cognitive 26): AdvisoryMatch.reconcile_formula has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19 (21 pts), error handling 3 (4 pts), 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, 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":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d70a241cd275c72b281eca03e38e5ad909da073c41a71eb71858c1f81750d1"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaCellarChecks.check_binary_arches (cognitive 26): FormulaCellarChecks.check_binary_arches has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 11 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_cellar_checks.rb"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dcd38666534d01db25334c2643e63fb3564008fd3ac192675bec3380c10afe"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.expand_dependencies_for_formula_once (cognitive 26): FormulaInstaller.expand_dependencies_for_formula_once has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, if/else 11 (13 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edb12208104511591fbc067eac19396df1991bb4c480b97001436d8e0cdf007"}},{"ruleId":"D2","level":"warning","message":{"text":"TestResource.audit_formula (cognitive 26): TestResource.audit_formula has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16, boolean chains 10. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/class.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a06d99b639a15ab243b2f3ea472446a98fe55e040f4406a06ef3a99abcfd228"}},{"ruleId":"D2","level":"warning","message":{"text":"Text.audit_formula (cognitive 26): Text.audit_formula has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/text.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96a7cc1b17101f47b81f248ae2c5afc49e2d84d5322c0d4b694676cbe627e87"}},{"ruleId":"D2","level":"warning","message":{"text":"API.generate_repositories (cognitive 26): API.generate_repositories has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 7, match/switch 2, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/api.rb"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20838bbf6f3d235987b14168e3e56d01bb0954980caa3ec7508ab8c6f055021"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaHistory.apply (cognitive 26): FormulaHistory.apply has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/formula_history.rb"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a923ae69cce9e965f05d04fe264dcdb3be3a0131877b0e07cf603848faccc9c2"}},{"ruleId":"D2","level":"warning","message":{"text":"PatchInclusion.removal_reason (cognitive 26): PatchInclusion.removal_reason has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 9, error handling 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":"Library/Homebrew/utils/github/patch_inclusion.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b008bc1e7a387d768f00e9e6c6cb51a94a8157b7d14a493dfca178a7e6fde9cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Match.reconcile_history (cognitive 26): Match.reconcile_history has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 11, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ee470ca27ee3aefeab9913f2a8139cc343442ff030f650c07d958a33ebb439"}},{"ruleId":"D2","level":"warning","message":{"text":"Match.subject_version_at (cognitive 26): Match.subject_version_at has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 5 (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":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57d6c7904fc6e479c20e8abf99b663427ae88273590f72a7627467844613770"}},{"ruleId":"D2","level":"warning","message":{"text":"Installer.load_installed_caskfile! (cognitive 25): Installer.load_installed_caskfile! has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 7, 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":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63ca8e1d5d1d6f64318cba94a93418efa1fd78acf9c44c60db542faaf2ac706"}},{"ruleId":"D2","level":"warning","message":{"text":"Info.github_info (cognitive 25): Info.github_info has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/info.rb"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"376e8be8c488f4ea25b7c9a56a058e1c1c35f06513a82869e28875d583631679"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateReport.tap_or_untap_core_taps_if_necessary (cognitive 25): UpdateReport.tap_or_untap_core_taps_if_necessary has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4 (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":"Library/Homebrew/cmd/update-report.rb"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2e9ba9b00f094cb62f591eb8890bda449bee38650b96a4e34cf4dc085bad31"}},{"ruleId":"D2","level":"warning","message":{"text":"Contributions.scan_contributions (cognitive 25): Contributions.scan_contributions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 22, boolean chains 2, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"188b3a787e2f64b626cbf729ee562046a79568a4d884ce0db125133376ed7012"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.to_plist (cognitive 25): Service.to_plist has cognitive complexity 25 (threshold 15). Drivers by points: if/else 21 (22 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/service.rb"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e657c6110882845fb66ce075ee84ee455b6f5edb967a122da9a1b1206287c88"}},{"ruleId":"D2","level":"warning","message":{"text":"Attestation.check_attestation (cognitive 25): Attestation.check_attestation has cognitive complexity 25 (threshold 15). Drivers by points: error handling 6 (21 pts), if/else 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/attestation.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a78cc8010bb2bc719c5004e49ea8d282de6f6d40af689a82d1720dfaac146a"}},{"ruleId":"D2","level":"warning","message":{"text":"History.walk (cognitive 25): History.walk has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), error handling 4 (6 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 6). 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":"Library/Homebrew/vulns/history.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"820e0f9ff43a3f539ef9a715a10a9664715bd082bfe512783037e0ae2b4d845a"}},{"ruleId":"D2","level":"warning","message":{"text":"UpgradeCmd.show_final_upgrade_summary (cognitive 24): UpgradeCmd.show_final_upgrade_summary has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 9, ternaries 3 (5 pts) (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":"Library/Homebrew/cmd/upgrade.rb"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"5942060e48d41b0ed004122bc08a422f4c5f4899b0430978bc31f553247c533d"}},{"ruleId":"D2","level":"warning","message":{"text":"Bump.handle_formulae_and_casks (cognitive 24): Bump.handle_formulae_and_casks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 3 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0b0adc83ea3cf28c44e0c75e88607bcf29aa963c544e8077fc289224a61063"}},{"ruleId":"D2","level":"warning","message":{"text":"Contributions.maintainer_activity_summary (cognitive 24): Contributions.maintainer_activity_summary has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2057fca40ffc20f682dc832fbc78a50cedcbb088d785ddb462a599e5dd17e6d9"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.install_dependency (cognitive 24): FormulaInstaller.install_dependency has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 8, error handling 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1825b10bd5ef641b81a05454fb9fba162ecfa9a0235ce8302af7a917e75a230"}},{"ruleId":"D2","level":"warning","message":{"text":"Keg.make_relative_symlink (cognitive 24): Keg.make_relative_symlink has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 3 (6 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/keg.rb"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"21401a309711fb9e74f58d2526e8cb1333cd96d8d3c733bfb298a01d5a33effa"}},{"ruleId":"D2","level":"warning","message":{"text":"Metadata.read_directly (cognitive 24): Metadata.read_directly has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15, boolean chains 4, ternaries 4, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/os/linux/elf.rb"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"86735075ae2c9c008efa787d5399ae763ca106f603a2c8bf58f40407d27ed90e"}},{"ruleId":"D2","level":"warning","message":{"text":"OnSystemConditionals.sha256_pairs (cognitive 24): OnSystemConditionals.sha256_pairs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 5 (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":"Library/Homebrew/rubocops/cask/on_system_conditionals.rb"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4397479a214adf952806b24c969f361a05994ddb0b3e4aceaefd7ea5be3c98d"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaFeeds.generate (cognitive 24): FormulaFeeds.generate has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 5 (9 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/formula_feeds.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c346a78534b91247a51b5f6d7313963cecfbd6e59033a76cf792da74cc54db98"}},{"ruleId":"D2","level":"warning","message":{"text":"Curl.curl_args (cognitive 24): Curl.curl_args has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (20 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/curl.rb"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"223f5fa437b8737d943de54619db1dbbd34bde2323ffa324e61e0bcc2019a11a"}},{"ruleId":"D2","level":"warning","message":{"text":"Utils.safe_fork (cognitive 24): Utils.safe_fork has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (19 pts), error handling 3, boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/fork.rb"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1ad46cd647b48894a6f9c68c97eae41eaf2132dfe50ca61258ee17dd037e47"}},{"ruleId":"D2","level":"warning","message":{"text":"AppImage.install_phase (cognitive 23): AppImage.install_phase has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 9, error handling 2, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/artifact/appimage.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe485f5fc002605e12cec6928af8f81f508cd9d348a6aa85757b15c4864cd86"}},{"ruleId":"D2","level":"warning","message":{"text":"UpgradeCmd.upgrade_outdated_formulae! (cognitive 23): UpgradeCmd.upgrade_outdated_formulae! has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 5 (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":"Library/Homebrew/cmd/upgrade.rb"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ce37aa5b047e0af7a4bc73e5982a194a4e1f8e9675e7393d0aea06a6565dfd"}},{"ruleId":"D2","level":"warning","message":{"text":"Uses.intersection_of_dependents (cognitive 23): Uses.intersection_of_dependents has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (6 pts), boolean chains 5 (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":"Library/Homebrew/cmd/uses.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c87750dac26e07d36d6ee91ec96db6c82547cb6092e27d05ec4932f7027e4c"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerateCaskCiMatrix.run (cognitive 23): GenerateCaskCiMatrix.run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/generate-cask-ci-matrix.rb"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f550b8bc6dc91bac11592952118e648359afdfbf5a824dd9db4eea21335e3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Formula.system (cognitive 23): Formula.system has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula.rb"},"region":{"startLine":3743}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9ac7eaa48360eb5fa260969565abbd5c362477675672e1d5f450c3939a583e"}},{"ruleId":"D2","level":"warning","message":{"text":"Cli.service_load (cognitive 23): Cli.service_load has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, ternaries 3 (6 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":"Library/Homebrew/services/cli.rb"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f52d946d56f500fde40e3d43151ce7d257361229b0df63dc9d68a9820c9002d"}},{"ruleId":"D2","level":"warning","message":{"text":"Attestation.check_attestation (cognitive 22): Attestation.check_attestation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, error handling 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/attestation.rb"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d887ebf52e861abbb70c29398d163cfc3bd804b7af525f0817f342a8c33ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"Brew.formula_to_hash (cognitive 22): Brew.formula_to_hash has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/brew.rb"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9c294102ae58d7635c229ac1106e24960bfb47c9a13c4918c826a240e3e32c"}},{"ruleId":"D2","level":"warning","message":{"text":"Cleanup.clean! (cognitive 22): Cleanup.clean! has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cleanup.rb"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b283d46298101a6d9460bd2a105eb997724c06909791d7d39ead425bec72d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Contributions.approved_pull_request? (cognitive 22): Contributions.approved_pull_request? has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e9ec6c3f415f188506f5cf8d08e2c6f4b4eb99d59deb7117f95f0092fe7353"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.check_conflicts (cognitive 22): FormulaInstaller.check_conflicts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 3 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ffb71c2f8b37d7d44f1d8aea2b6afdbd3ed30a0761d6eb5a4f5fdf2784580f"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentsOrder.audit_formula (cognitive 22): ComponentsOrder.audit_formula has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, ternaries 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/components_order.rb"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95a001cce0930ae81bb81c31e7ed8d4c2e2e301bb9b5b194b91481ec9cc36eb"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonVersions.audit_formula (cognitive 22): PythonVersions.audit_formula has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/lines.rb"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"3062327c460ec02375d6ea97aff1052797b3e9c1533f02bfab89f9d98f11cadc"}},{"ruleId":"D2","level":"warning","message":{"text":"OSDependsOn.on_send (cognitive 22): OSDependsOn.on_send has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/os_depends_on.rb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bae41524881ea5bb967c02f394c4da9fcd130bf914c6574116a78e803fd554"}},{"ruleId":"D2","level":"warning","message":{"text":"UrlHelper.audit_url (cognitive 22): UrlHelper.audit_url has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, boolean chains 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/shared/url_helper.rb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"574bf8e35bdf923d95d6d363e7caa135f741ef1a1182c513fcb286bfe0f6c42e"}},{"ruleId":"D2","level":"warning","message":{"text":"Sandbox.deny_read_home (cognitive 22): Sandbox.deny_read_home has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/sandbox.rb"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f431dbcce741d3d7222d5a3db437634faf509ec83cd1afe6a1440c2879253f"}},{"ruleId":"D2","level":"warning","message":{"text":"Trust.write_trust_store (cognitive 22): Trust.write_trust_store has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (21 pts), error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/trust.rb"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8334a487dec4377184c9ba6dbd368c3b9296d54efb1f1b08091406af320277"}},{"ruleId":"D2","level":"warning","message":{"text":"Bump.create_pr (cognitive 21): Bump.create_pr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bump.rb"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8e5b0692492afedf66a6f78c4cc11ed661800cf6c35c59577152db43d871fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Brew.install! (cognitive 21): Brew.install! has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 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":"Library/Homebrew/bundle/brew.rb"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fef68a5ae83eae2c30fc2070fa6197ec3fcf0477876e98721055d4aabe8ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"Flatpak.install! (cognitive 21): Flatpak.install! has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/flatpak.rb"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"617515bda1cd73c6b567c3337a882f30a44998699745cdbb5e7b9f5c0af68e88"}},{"ruleId":"D2","level":"warning","message":{"text":"FromPathLoader.load (cognitive 21): FromPathLoader.load has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 3 (5 pts), boolean chains 4 (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":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff13886ee03e1a1e1da4bef7dfca415f6ad5704c75c380dabe167aa441aa81a"}},{"ruleId":"D2","level":"warning","message":{"text":"Installer.forbidden_tap_check (cognitive 21): Installer.forbidden_tap_check has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 7 (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":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44aa34fbe03a8da4cbced793b326de9ab5e1d4a5a2d76e8bda00848d7091980"}},{"ruleId":"D2","level":"warning","message":{"text":"Installer.forbidden_cask_and_formula_check (cognitive 21): Installer.forbidden_cask_and_formula_check has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ffbb4028bc195cc8db74e5024e450bb7c5d2ed55a993c00520bf2a8773364cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.generate_help_text (cognitive 21): Parser.generate_help_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be5f2e3ff8693001897e1d939d7490b46b36af08c1a2d7cce2c9f65578d707f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeprecateDisable.message (cognitive 21): DeprecateDisable.message has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/deprecate_disable.rb"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc4aa4f7b8bc7eaacc6208a5caf98195a745b96a98be79b57fcf659a6190a7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Bump.version_args_for_bump (cognitive 21): Bump.version_args_for_bump has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a508fd44f90be89c01ee39c73e4252d9d77cbcc5598b1fc1e53a3dcae9d7260"}},{"ruleId":"D2","level":"warning","message":{"text":"Contributions.maintainer_activity_totals (cognitive 21): Contributions.maintainer_activity_totals has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"de17b82bb10b64bbae7c5891f1e86802882e4107a98d925cb8bb9c0203ef7566"}},{"ruleId":"D2","level":"warning","message":{"text":"Create.create_formula (cognitive 21): Create.create_formula has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18 (21 pts) (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":"Library/Homebrew/dev-cmd/create.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3453b841eef0d483c4df2f830abb78c947c3abf4a8c3bb8b6c27bdfb1071f637"}},{"ruleId":"D2","level":"warning","message":{"text":"Unbottled.run (cognitive 21): Unbottled.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/unbottled.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4d1d387de2605d1bf0786bd14734616e563992eb69a00ed4686d1363b14c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.pour_bottle? (cognitive 21): FormulaInstaller.pour_bottle? has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4910959b86f102b4ea84b3c7e7df0d47692847f0dbdec2633bef69a5a7663b"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.build (cognitive 21): FormulaInstaller.build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5, error handling 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":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c79a9ece8164d10108e8e12b090023f3fc1c226e43ac474da3ba2eadb6c78e"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.link (cognitive 21): FormulaInstaller.link has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 4 (8 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"2963fcf788f75620ba9d54f98d4b75565655617996795d1219f7c8390d498783"}},{"ruleId":"D2","level":"warning","message":{"text":"Readall.valid_casks? (cognitive 21): Readall.valid_casks? has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), error handling 2 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/readall.rb"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbfaed849730a3ab7145bd67f5f0c2f615b367b73d00fedd78c376b29193690"}},{"ruleId":"D2","level":"warning","message":{"text":"Patches.patch_problems (cognitive 21): Patches.patch_problems has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/patches.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"68adc196673a797e5d7c18384b226cc908c18cd8d73be3249492d84ed19a48fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Trust.trust_name (cognitive 21): Trust.trust_name has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, error handling 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/trust.rb"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9f071c5553876c704570b1725ba6ad33e8b637c8f7de5dcfb0e4d606b4a579"}},{"ruleId":"D2","level":"warning","message":{"text":"API.open_rest (cognitive 21): API.open_rest has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), error handling 2 (3 pts), ternaries 2 (3 pts), boolean chains 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":"Library/Homebrew/utils/github/api.rb"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24dc1d8a94c554a219f0c950f29cf7b39b189ffd42a2c26873955a93d787574"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.formulae (cognitive 20): Parser.formulae has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01394993be92fe1ecf49921b48073594058ef40fdcde79cb765886aae6b3e35"}},{"ruleId":"D2","level":"warning","message":{"text":"DirEmitter.prepare_aliases (cognitive 20): DirEmitter.prepare_aliases has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"511b4981ec8222d56c9ef598dcfbf8b7ea7e2a38fb86ad03a20aa29f3928e094"}},{"ruleId":"D2","level":"warning","message":{"text":"Bump.livecheck_result (cognitive 20): Bump.livecheck_result has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a14d30aa5883aa0eabc17a4035aa0f0f5da4fb875ee40fbfc7122a5bef08e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Contributions.generate_maintainer_report_csv (cognitive 20): Contributions.generate_maintainer_report_csv has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 5, ternaries 5. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaa006a3323147ec6fa0b127dee93880cf7bc1991b35fc36997cee4a7c459f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Create.create_cask (cognitive 20): Create.create_cask has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 3, ternaries 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/create.rb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4fddcfe0816b16b48646b36930689e41901b13f98f62494a1b8ea056d804eb"}},{"ruleId":"D2","level":"warning","message":{"text":"WhichUpdate.update_and_save! (cognitive 20): WhichUpdate.update_and_save! has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, match/switch 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/which-update.rb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6cab8677ac4e9ae413439212cb633b8e497bdfdce3b2887435437c38201dc4"}},{"ruleId":"D2","level":"warning","message":{"text":"Checks.check_untrusted_taps (cognitive 20): Checks.check_untrusted_taps has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, boolean chains 1, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/diagnostic.rb"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6caa3eddf010f8e3ff5c570b5f2e0834ea1d77b5d01d50ba331a52e16de600"}},{"ruleId":"D2","level":"warning","message":{"text":"Install.install_formulae (cognitive 20): Install.install_formulae has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, error handling 2 (3 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":"Library/Homebrew/install.rb"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e55b8583a6762804f2c9ceb8e7357437376032ba25a0f78ec3e2d80c0d86c93"}},{"ruleId":"D2","level":"warning","message":{"text":"Keg.relocate_build_prefix (cognitive 20): Keg.relocate_build_prefix has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2 (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":"Library/Homebrew/keg_relocate.rb"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08084037ede202b6013110eef465d7f8f79c6646f8928ebc823b20a033e63be"}},{"ruleId":"D2","level":"warning","message":{"text":"McpServer.respond_to_tools_call (cognitive 20): McpServer.respond_to_tools_call has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/mcp_server.rb"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9684654b941f222b19311e0eec2fea8ab30ddbcf8d61f54dd3208e7654718d3c"}},{"ruleId":"D2","level":"warning","message":{"text":"Patch.create (cognitive 20): Patch.create has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (3 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/patch.rb"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90973c7ed680ae3b05b47eab8c49aca4b3fef6e9d63a51b3bd5109a44ab64a4"}},{"ruleId":"D2","level":"warning","message":{"text":"TernaryToIf.before_declaring_variable (cognitive 20): TernaryToIf.before_declaring_variable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 2, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/ternary_to_if.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bedb765741e2bc3b56d6ccdf8f63955969e60b527adf9f58e5646808d26e77"}},{"ruleId":"D2","level":"warning","message":{"text":"Curl.curl_with_workarounds (cognitive 20): Curl.curl_with_workarounds has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/curl.rb"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad04f9195b582aea8dc7bf362cc8f7587183f418f7303dd4e7342f1455bbc25"}},{"ruleId":"D2","level":"warning","message":{"text":"Curl.curl_headers (cognitive 20): Curl.curl_headers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/curl.rb"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"11457e8fa1171e0316acc353ed54875964d209ddfdee0f5afc68811562bdc498"}},{"ruleId":"D2","level":"warning","message":{"text":"Match.to_brew_record (cognitive 20): Match.to_brew_record has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9, boolean chains 7, ternaries 3 (4 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbac73d2fe105027cc021856ca3e7eaf60fac5cb3432d0d11f65eac32fb293e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Match.reconciliation_observation (cognitive 20): Match.reconciliation_observation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 5, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"36926459a44ba33d89cee99a9c0750e3400306fcc6fdbca41e53156884363aca"}},{"ruleId":"D2","level":"warning","message":{"text":"OsvExport.merge_existing (cognitive 20): OsvExport.merge_existing has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, boolean chains 9, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/osv_export.rb"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece561a9c35669789b4017417cb63081967be9d16c385cf21f72458e0d03545e"}},{"ruleId":"D2","level":"warning","message":{"text":"Cargo.package_outdated? (cognitive 19): Cargo.package_outdated? has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, match/switch 1 (2 pts), error handling 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":"Library/Homebrew/bundle/extensions/cargo.rb"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb3ddd5e0eb775bc4119a39c8c3a0286c973c8bb4c56e01cc7527d0f6860456"}},{"ruleId":"D2","level":"warning","message":{"text":"Cask.to_hash_with_variations (cognitive 19): Cask.to_hash_with_variations has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5 (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":"Library/Homebrew/cask/cask.rb"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fb381652b7f64e513fd83fd31ee3ce4674eae63cf4ddea37d79ad061fb496a"}},{"ruleId":"D2","level":"warning","message":{"text":"DependsOn.record_macos_requirement (cognitive 19): DependsOn.record_macos_requirement has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/dsl/depends_on.rb"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f909d1cc947dc2db181a2ac167dc1cddc02ceb5851412d337cd731bba33b1ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"Caveats.service_caveats (cognitive 19): Caveats.service_caveats has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 8 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/caveats.rb"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c245843e78575eefa15dca55d74d1b585af115f661c2f006d124225a848ebf0"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.named_args (cognitive 19): Parser.named_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa9d9edcefc031be9f1f50e3d4bbab0c63b4eba1cc697e41c4caf439df7b361"}},{"ruleId":"D2","level":"warning","message":{"text":"Deps.dep_display_name (cognitive 19): Deps.dep_display_name has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (19 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/deps.rb"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8fd98cd0740d3d874965a638e2b73eb8742bb1912a3864a877efcefa639138"}},{"ruleId":"D2","level":"warning","message":{"text":"Descriptions.decorate_name (cognitive 19): Descriptions.decorate_name has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), error handling 2 (5 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/descriptions.rb"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd3c06116d2561be834639f35719f5d192d601bb76bb651a406960e322b51c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Bottle.keg_contain? (cognitive 19): Bottle.keg_contain? has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bottle.rb"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9148cd8f03894735ef00ce027b46b810c37eeaffe0ae887a238d6424b30b96"}},{"ruleId":"D2","level":"warning","message":{"text":"Contributions.parse_git_log (cognitive 19): Contributions.parse_git_log has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, ternaries 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"9346f9e0d0f988fbbaba29aabae9cb957572ec7463184f365a615e8529479318"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerateCaskCiMatrix.generate_matrix (cognitive 19): GenerateCaskCiMatrix.generate_matrix has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/generate-cask-ci-matrix.rb"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a613da01b3a4ceeaf4a404362dd72bff6f2c0e6b525c28a9254b9aafa03c4a60"}},{"ruleId":"D2","level":"warning","message":{"text":"AbstractFileDownloadStrategy.parse_basename (cognitive 19): AbstractFileDownloadStrategy.parse_basename has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (19 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":"Library/Homebrew/download_strategy/abstract_file_download_strategy.rb"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ee3585c0426565e23d2440333c0cf1ff8ccc5c11bea9410336ff732057337b"}},{"ruleId":"D2","level":"warning","message":{"text":"GitDownloadStrategy.env (cognitive 19): GitDownloadStrategy.env has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 8, error handling 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/download_strategy/git_download_strategy.rb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"327d14402301e3774ffb6d8f06b64f8896df86065434ec6f70978e2d8458946b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassMethods.setup_preferred_gcc_libs (cognitive 19): ClassMethods.setup_preferred_gcc_libs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/extend/os/linux/install.rb"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1333da817b975a946cb6a5bf8aa724ce29162b325fd4053436b3b2f090cfb673"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.prelude_fetch (cognitive 19): FormulaInstaller.prelude_fetch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25cd47de6a8c99d9fba32e9fbd5874541ee566a2b1b5504d917fd420f4b19cf"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.enqueue_fetch (cognitive 19): FormulaInstaller.enqueue_fetch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, error handling 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":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"a105320df0edb858fea3293b1f20845874a11947e6dab8091a45c82f007a98ab"}},{"ruleId":"D2","level":"warning","message":{"text":"GitHubPackages.preupload_check (cognitive 19): GitHubPackages.preupload_check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/github_packages.rb"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"974f5ef5787784cd34a7d5222b1e7c3f0e76138482bf587d6cd032217506e63c"}},{"ruleId":"D2","level":"warning","message":{"text":"API.github_activity (cognitive 19): API.github_activity has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/analytics/api.rb"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47e70f7bc78ef4fe96538bb2c7ac2d853106b0b121345c289a1bb9865d0ce55"}},{"ruleId":"D2","level":"warning","message":{"text":"SPDX.string_to_license_expression (cognitive 19): SPDX.string_to_license_expression has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/spdx.rb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"857715585e507f5f50685b250fca8a21b40027702aaf3525b80acda5b410e423"}},{"ruleId":"D2","level":"warning","message":{"text":"Identify.registry_package_for (cognitive 19): Identify.registry_package_for has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/identify.rb"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0158f207ad5ac1c4134be06384a7a1061dcd0539287f2b5af846e749a861f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Tap.dump (cognitive 18): Tap.dump has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3 (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":"Library/Homebrew/bundle/tap.rb"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0db5c78ae57398b805497de57dedac4e8583b240464db7a6d3c693e07233b1c"}},{"ruleId":"D2","level":"warning","message":{"text":"FromAPILoader.load_from_struct (cognitive 18): FromAPILoader.load_from_struct has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, error handling 1 (2 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"62eaaacb380d54d6219fd7e96f53051bfad08fbe9c3150ea0370bab4f1e85b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"Cleanup.cleanup_cache (cognitive 18): Cleanup.cleanup_cache has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cleanup.rb"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05de1ead7b78962f325bcf2c1aef843b73d067ec2db1a60c7ff05d11555241c"}},{"ruleId":"D2","level":"warning","message":{"text":"Completions.generate_fish_subcommand_completion (cognitive 18): Completions.generate_fish_subcommand_completion has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/completions.rb"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04314d7deac4c913ea14ffbc1a67c62f4473daaba67b58ddc612e5f7a55872f"}},{"ruleId":"D2","level":"warning","message":{"text":"DirEmitter.terminal_intervals (cognitive 18): DirEmitter.terminal_intervals has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 8, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dcbb15d6da50383ab4d7eb70d053b24b90ce1401fd2fc263dacc4064203320"}},{"ruleId":"D2","level":"warning","message":{"text":"DispatchBuildBottle.run (cognitive 18): DispatchBuildBottle.run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/dispatch-build-bottle.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8faa8ac8d794ac913036a4423861b44a6a7c2fb07170eeb377746d8dc18e7283"}},{"ruleId":"D2","level":"warning","message":{"text":"Unbottled.formulae_all_installs_from_args (cognitive 18): Unbottled.formulae_all_installs_from_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/unbottled.rb"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac44bd66b30cdadc561d93217384d9b08a3c5335a3edee01e4ab88f49194ee4"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildError.dump (cognitive 18): BuildError.dump has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (18 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":"Library/Homebrew/exceptions.rb"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"474598d2a51267173bfba536a32eabe8fc1a8de9724cb4a0c4746e483ffb0478"}},{"ruleId":"D2","level":"warning","message":{"text":"Formula.ensure_installed! (cognitive 18): Formula.ensure_installed! has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, 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, 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":"Library/Homebrew/formula.rb"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"100253e6688f157842f011dc371c849b24151bd06c1f776bb624473ee9c439c4"}},{"ruleId":"D2","level":"warning","message":{"text":"LinkageChecker.check_formula_deps (cognitive 18): LinkageChecker.check_formula_deps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/linkage_checker.rb"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4a5d190efba35dcbd70d0f1aedbc5604c184555b88f88119d753c6e1b70961"}},{"ruleId":"D2","level":"warning","message":{"text":"McpServer.tool_command_arguments (cognitive 18): McpServer.tool_command_arguments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/mcp_server.rb"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"902cccd1ba6ef7a257ecf664bbb8c69493b4dbef973380b043d4f6011d7aa7bf"}},{"ruleId":"D2","level":"warning","message":{"text":"Readall.valid_tap? (cognitive 18): Readall.valid_tap? has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2 (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":"Library/Homebrew/readall.rb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4541cbcfc0726c745897acb2e954bb6fc884fa1924e902ecb081808c3de15ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceAuditor.audit_download_strategy (cognitive 18): ResourceAuditor.audit_download_strategy has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/resource_auditor.rb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"020042201680b88daeb0da9ffce571d891627e175a6c607a70b6c633673ca5a6"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallSteps.keychain_find_certificate_name (cognitive 18): InstallSteps.keychain_find_certificate_name has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/install_steps.rb"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ce69355ccf314905c3a871cd4004896ee0e7978261d5db377b88a65932adb6"}},{"ruleId":"D2","level":"warning","message":{"text":"Sandbox.run (cognitive 18): Sandbox.run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), error handling 3 (4 pts), boolean chains 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":"Library/Homebrew/sandbox.rb"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91036b85d4f9b0d4b33b2071943d7f60f022bab859a9f80aafc1e34864e27df"}},{"ruleId":"D2","level":"warning","message":{"text":"Service.to_systemd_unit (cognitive 18): Service.to_systemd_unit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 2 (4 pts), boolean chains 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":"Library/Homebrew/service.rb"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d9ae32c55585761832f5145d8c2e60dba21c0fed7f30920ac5d324f557a6b6"}},{"ruleId":"D2","level":"warning","message":{"text":"TapAuditor.check_renames (cognitive 18): TapAuditor.check_renames has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap_auditor.rb"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e0ec2b98021074d42b4abf3d8cd327e83fe9cda81f72cd27e678a2e0bc323d"}},{"ruleId":"D2","level":"warning","message":{"text":"Brewfile.path (cognitive 17): Brewfile.path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3 (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":"Library/Homebrew/bundle/brewfile.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fb2d16993d134070c78198b009f164bc06f27cda9b9da96a1448baaa84b527"}},{"ruleId":"D2","level":"warning","message":{"text":"BundleVersion.nice_parts (cognitive 17): BundleVersion.nice_parts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6 (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":"Library/Homebrew/bundle_version.rb"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bc30d87b32fea990d2d4329269fd5c5429ebafc7167cd9225f0b24b5378912"}},{"ruleId":"D2","level":"warning","message":{"text":"Migrator.move_old_cask (cognitive 17): Migrator.move_old_cask has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/migrator.rb"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b944687b078d8eca8e3f9198e2514261ab3e6782e18b9b767322891197a92ad9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.parse_remaining (cognitive 17): Parser.parse_remaining has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"799c2f0f5f41b60e5f6e89ebde59e5d713650a5c08095d13e8dab361daee7b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"Commands.command_options (cognitive 17): Commands.command_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2 (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":"Library/Homebrew/commands.rb"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e927414fca10c691f4855ae3e264b52320048a3fd2506732d645d7274f782bf2"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependency.installed? (cognitive 17): Dependency.installed? has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dependency.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8980829c42bc13a4d79117e07dee57e18df11a7a67ee3856173ce9bee2c39be9"}},{"ruleId":"D2","level":"warning","message":{"text":"Contributions.maintainer_report_users (cognitive 17): Contributions.maintainer_report_users has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd79236579c59cb3d690de4e322974b9533dac8b2adc94455fc6bc8d18469bda"}},{"ruleId":"D2","level":"warning","message":{"text":"CurlDownloadStrategy.resolve_url_basename_time_file_size (cognitive 17): CurlDownloadStrategy.resolve_url_basename_time_file_size has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, error handling 2, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/download_strategy/curl_download_strategy.rb"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b3a9d593d5431c67962637df63d7fb03828abcb25a70f37088808e739981fb"}},{"ruleId":"D2","level":"warning","message":{"text":"ErrorDuringExecution.initialize (cognitive 17): ErrorDuringExecution.initialize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 3 (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":"Library/Homebrew/exceptions.rb"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"e071cf5b67e1814cca68f2e218f328521b1d8a89bf2c8c6c4e60d45408ff59e8"}},{"ruleId":"D2","level":"warning","message":{"text":"DiskUsageExtension.compute_disk_usage (cognitive 17): DiskUsageExtension.compute_disk_usage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3 (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":"Library/Homebrew/extend/pathname/disk_usage_extension.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8491b27fc204f8ac6496e11fb7864a7c74d61614b1c0b3becf475dc2ade9ba0c"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaAuditor.audit_compatibility_version (cognitive 17): FormulaAuditor.audit_compatibility_version has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc75f1ff485408185aba8ecd95f3fc4b125de616388c963cb885b684a5b1647"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaCreator.write_formula! (cognitive 17): FormulaCreator.write_formula! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_creator.rb"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f496cfa6788164a8dddc0d8176ffe4d90936b710053214d6f375307999aa245f"}},{"ruleId":"D2","level":"warning","message":{"text":"FromNameLoader.try_new (cognitive 17): FromNameLoader.try_new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, ternaries 1 (3 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formulary.rb"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1a71e64db73ce4b589b5e87d30cb34cc547f72c37c3f0a0645dc93ede08d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Formulary.load_formula (cognitive 17): Formulary.load_formula has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, error handling 2, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formulary.rb"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"784f1b86e91b5dabb6cfac42ef463cabf732ecda4806bb148eb274d3ad68f627"}},{"ruleId":"D2","level":"warning","message":{"text":"Livecheck.url (cognitive 17): Livecheck.url has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 5, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck.rb"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"01baeaa597c2b22f4cfba11d80748dbdd6a99037f404c505e32b650bbbdf9d78"}},{"ruleId":"D2","level":"warning","message":{"text":"LivecheckVersion.\u003C=\u003E (cognitive 17): LivecheckVersion.\u003C=\u003E has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/livecheck_version.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f5d1611e59dd485a052967f812e3509ff7609f880cf25b089dad34066afed2"}},{"ruleId":"D2","level":"warning","message":{"text":"Git.preprocess_url (cognitive 17): Git.preprocess_url has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/git.rb"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9284abca5d037b4c5381da7e3566c2e197edf027757f755de7838fd8e334b05d"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingFormula.tap_migration_reason (cognitive 17): MissingFormula.tap_migration_reason has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/missing_formula.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59c39167e367cbce2b5ea1d290be1642bea4365835be9b918c907006b9d5dda"}},{"ruleId":"D2","level":"warning","message":{"text":"MissingFormula.deleted_reason (cognitive 17): MissingFormula.deleted_reason has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3 (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":"Library/Homebrew/missing_formula.rb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"53337342848fdf84bfe51d0c569ae0b6d7d657e08505627746b2021f4801273b"}},{"ruleId":"D2","level":"warning","message":{"text":"RetryableDownload.fetch (cognitive 17): RetryableDownload.fetch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/retryable_download.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ee76d3747dce0325338c81da20cfdcbcf54e9f94d31790aa1d7ae7f9a10b83"}},{"ruleId":"D2","level":"warning","message":{"text":"NoOverrides.on_system_stanzas (cognitive 17): NoOverrides.on_system_stanzas has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/no_overrides.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"444fe1978f036911fa018d827a6701239f1eee6ba5553ff732c51851bb732638"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallSteps.add_implicit_var_base_offense (cognitive 17): InstallSteps.add_implicit_var_base_offense has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/install_steps.rb"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b72053a516a223983044a3e62a52054a7d66e8745aebfa040239152c0f75e8"}},{"ruleId":"D2","level":"warning","message":{"text":"DescHelper.audit_desc (cognitive 17): DescHelper.audit_desc has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/shared/desc_helper.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"644dffb9975aeffdb508253fdc2b719c8b7f1318fc1e49179b89365f731e0aa2"}},{"ruleId":"D2","level":"warning","message":{"text":"Cli.start (cognitive 17): Cli.start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/services/cli.rb"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"200aa1c2ad8753049a1bbf916a824c56acb9d4e28ed00fee5a62e04130baa926"}},{"ruleId":"D2","level":"warning","message":{"text":"Cli.take_root_ownership? (cognitive 17): Cli.take_root_ownership? has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/services/cli.rb"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4e3f7571d0a2a8f1917936e42ab197e1b5450cf8fde67c799eb1f32158ff40"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemCommand.each_output_line (cognitive 17): SystemCommand.each_output_line has cognitive complexity 17 (threshold 15). Drivers by points: error handling 4 (7 pts), if/else 5 (6 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/system_command.rb"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"9616e26746625f300547719607ab8576af796e388e23df875c6e93684925d6f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Trust.trust_fully_qualified_items! (cognitive 17): Trust.trust_fully_qualified_items! has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, ternaries 3 (5 pts), boolean chains 2, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/trust.rb"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b920829fdd489a37831c7eb84be9d77aaa89e290a1ea7c8648e39f9e8697bcf9"}},{"ruleId":"D2","level":"warning","message":{"text":"UnversionedCaskChecker.guess_cask_version (cognitive 17): UnversionedCaskChecker.guess_cask_version has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, error handling 2 (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":"Library/Homebrew/unversioned_cask_checker.rb"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"29329b844dfbd158b3171359d76694f3dd101d92473d853281549fde05197ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"Annotation.to_s (cognitive 17): Annotation.to_s has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 1 (2 pts) (nesting depth added 9). 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":"Library/Homebrew/utils/github/actions.rb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9809a3e81846ed4c71caa61c6f91b788ef8ec17540a92c12924a420bf301324"}},{"ruleId":"D2","level":"warning","message":{"text":"API.raise_error (cognitive 17): API.raise_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, error handling 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/github/api.rb"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"7164630204f2d21e019bb86496d63cefe735c0ef9369c047675ed3b0bbfe8de4"}},{"ruleId":"D2","level":"warning","message":{"text":"Attestation.check_core_attestation (cognitive 16): Attestation.check_core_attestation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/attestation.rb"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab080a7a9b8a9e329c166b240bdf2eaf8bff0341e47187579f6c6033c1bfed96"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallSubcommand.run (cognitive 16): InstallSubcommand.run has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/subcommand/install.rb"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf7cc7cd3fb38a66f98f6b458f0bb85dc0de1cbd8e8dd3023f1a9174374207c"}},{"ruleId":"D2","level":"warning","message":{"text":"Auditor.audit (cognitive 16): Auditor.audit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/auditor.rb"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0c4b20a5ea14086a85f8dbf7d741f4034ea0dd05f5dc1fa7ee95e77da77740"}},{"ruleId":"D2","level":"warning","message":{"text":"FromNameLoader.try_new (cognitive 16): FromNameLoader.try_new has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), ternaries 1 (3 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"874a3c71ea3fb91be9758349ec0a22713219056c531397f31058138d1eebfabe"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedArgs.warn_if_cask_conflicts (cognitive 16): NamedArgs.warn_if_cask_conflicts has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (6 pts), error handling 2 (3 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/named_args.rb"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"260fdc85f273d994ebc96915456a729c545599ce49fba24de542905c09ed1455"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.switch (cognitive 16): Parser.switch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfb67982d9bd8d3c7e0fbfd5f2ac4516ea319c03f4b5780a88e47fe21c30c2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Doctor.run (cognitive 16): Doctor.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/doctor.rb"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"832a1f2c8588d56ff9f1475d348d78ea34bf29b69ff2dce0ad1f4d6f5459b0d5"}},{"ruleId":"D2","level":"warning","message":{"text":"ReporterHub.dump (cognitive 16): ReporterHub.dump has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/update_report/reporter_hub.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adf876572668169992263b369564eb9cac099859b56d36269106bb7c4608591"}},{"ruleId":"D2","level":"warning","message":{"text":"BumpRevision.run (cognitive 16): BumpRevision.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 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":"Library/Homebrew/dev-cmd/bump-revision.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f4677c3273ce347f30f55adef875c5ef363f8d2b8fb1f63baff8ecca5c4504"}},{"ruleId":"D2","level":"warning","message":{"text":"Extract.with_monkey_patch (cognitive 16): Extract.with_monkey_patch has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/extract.rb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88945948bc38e56e0c18556cf5be775b22c28a41601fda5fe1df0dd469aee6a"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.fetch_bottle_tab (cognitive 16): FormulaInstaller.fetch_bottle_tab has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ddd32631feb44b6bf170ae3f1152fb965644be0cdbf6caf7fcd812363cf5c1"}},{"ruleId":"D2","level":"warning","message":{"text":"FormulaInstaller.pour (cognitive 16): FormulaInstaller.pour has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 4, ternaries 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9a29730528ad7d0a1bb245a869d76fc708195eba06a0bd58daa57535c63f71"}},{"ruleId":"D2","level":"warning","message":{"text":"Formulary.resolve_installed_spec (cognitive 16): Formulary.resolve_installed_spec has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formulary.rb"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"615243cfe9e4f7c7c039035a86e56d97a4d229e923de27f1642bbd8161c0d006"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner.sandbox_write_paths (cognitive 16): Runner.sandbox_write_paths has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 4 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/install_steps.rb"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee18cdc7dd8dec05108469c198f39d75a088f8298d276116c9a51138051d512e"}},{"ruleId":"D2","level":"warning","message":{"text":"HeaderMatch.versions_from_content (cognitive 16): HeaderMatch.versions_from_content has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 6, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/header_match.rb"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a722bfa0442067d2b122cc04b0c84048492499a9efac4ad7e76f156b1563345"}},{"ruleId":"D2","level":"warning","message":{"text":"Migrator.link_newname (cognitive 16): Migrator.link_newname has cognitive complexity 16 (threshold 15). Drivers by points: error handling 4 (8 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/migrator.rb"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccc002e2c0e78774ddd79ab8d5b5e64991977c7a005a2f71652e0eadef0c68f"}},{"ruleId":"D2","level":"warning","message":{"text":"Resource.unpack (cognitive 16): Resource.unpack has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/resource.rb"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d24f170a80c39b1ec9e1f1382c122d475a77443eeaba3e196e1241df3cebb25"}},{"ruleId":"D2","level":"warning","message":{"text":"EmptyConditionalArgument.on_send (cognitive 16): EmptyConditionalArgument.on_send has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/empty_conditional_argument.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eedede82810ec623be8b4428f90e05c4fe59108978186d1e4aaacd6a732dd7b"}},{"ruleId":"D2","level":"warning","message":{"text":"HelperFunctions.string_content (cognitive 16): HelperFunctions.string_content has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/shared/helper_functions.rb"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d36167b999c5b74065c603c04c5497d57ff943e10f666859762621e5173fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"OnSystemConditionalsHelper.audit_on_system_blocks (cognitive 16): OnSystemConditionalsHelper.audit_on_system_blocks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/shared/on_system_conditionals_helper.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff35dca77ce14d3ccd87d485f1c6f965a76fc1794dbc878aa19a2d134646afb"}},{"ruleId":"D2","level":"warning","message":{"text":"ShellCommands.on_send (cognitive 16): ShellCommands.on_send has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/shell_commands.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"523dc26de0ac90bc4a88b84102128235ddae4444c216cf6fec72f2380489c455"}},{"ruleId":"D2","level":"warning","message":{"text":"Services.dispatch (cognitive 16): Services.dispatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/services/subcommand.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0211adf9972a0426249f718e4582d224feafb310334f049e8eb446076a2b1b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Trust.infer_target (cognitive 16): Trust.infer_target has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (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":"Library/Homebrew/trust.rb"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bfec7d2d3ce0ae5d00ae9fbc7e37433816af82fff6785e2e680a48c2e85041"}},{"ruleId":"D2","level":"warning","message":{"text":"Match.range_status (cognitive 16): Match.range_status has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"e556b566a576006c64af77285621fad31196de6cadcbe4bbc54114ce0a1659e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.build_target (cognitive 16): Scanner.build_target has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/scanner.rb"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"548f53baee96624c8ebaf224d0b938f32bb404baf15e426244f7af42dc261645"}},{"ruleId":"D2","level":"warning","message":{"text":"Vulnerability.non_semver_fix_available_of_type? (cognitive 16): Vulnerability.non_semver_fix_available_of_type? has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/vulnerability.rb"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4d531d41493fb62c289b86e1fb87611b81f8b9377466cbc5aadb823de1f38d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Formula: TooManyMethods \u2014 293 methods. The bar is 30 methods; this is 263 over it, 9.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula.rb"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef7ebbc6ee5200193acb553857d5b8354a74695009f33782fc174c1ace75822"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/formula.rb: FileTooLong \u2014 2743 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2243 over it, 5.49\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":"Library/Homebrew/formula.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaadb8b0541f2694e83355fc29859f9cdb73fc77d12ef6e08b4646d4fae3d26d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tap: TooManyMethods \u2014 99 methods. The bar is 30 methods; this is 69 over it, 3.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1c31e1c4b49d4d42e21e6dd288b586b534f1edb51d9d40bf21619da06ef9a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/formula_installer.rb: FileTooLong \u2014 1567 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1067 over it, 3.13\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":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d513d68f73f9741840dfad6b1b028fd83f108dd70fb136533fb5c8890abde38"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FormulaInstaller: TooManyMethods \u2014 94 methods. The bar is 30 methods; this is 64 over it, 3.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3f6611c38bc98ef39cc38cfdc04e9e3065139b2a540979301f77d2f0aea217"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/diagnostic.rb: FileTooLong \u2014 1559 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1059 over it, 3.12\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":"Library/Homebrew/diagnostic.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32836b0c847c613573c6ab92684c7b91d6f5df11273ebb6e2734847a284f5a5e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Audit: TooManyMethods \u2014 87 methods. The bar is 30 methods; this is 57 over it, 2.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af294cf2aaf08c31dd72b9a9cbfdb0305bf3ac8d88a36607d3e6a50c8130f9d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Checks: TooManyMethods \u2014 87 methods. The bar is 30 methods; this is 57 over it, 2.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/diagnostic.rb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71126a3b72245a5906e506dff77793c2a248ce8b42392e17f6523f993f5868c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/install_steps.rb: FileTooLong \u2014 1442 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 942 over it, 2.88\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":"Library/Homebrew/install_steps.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0bf2168b176ce5b32c88bc8edfd93508dd393ea97cddd657911f7c39725883"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dev-cmd/contributions.rb: FileTooLong \u2014 1357 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 857 over it, 2.71\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":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be4c9b790d9b16e97ca827494e049f9c6316f61455625eee955ea186ccc2c77"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Cask: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b18df7c40e7ac814b64f73a09fe5472213db2a1c79f5f914307271b9168a75"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Installer: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2c0903cb0e3c73b3957b53fbbe2110a47a3cf58ccbefefcf0c9e08de520a24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cask/audit.rb: FileTooLong \u2014 1196 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 696 over it, 2.39\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":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d8300dcfa511e78d8437f64ea5ccb209974a149bacd9485cfc2a8bc676b0b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dev-cmd/advisory-match.rb: FileTooLong \u2014 1164 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 664 over it, 2.33\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":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb78e16cd2ecfc71e3e0ae97777ea106693602a08aaa1e5a04f2abe5d92860b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/formula_auditor.rb: FileTooLong \u2014 1111 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 611 over it, 2.22\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":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d9b5b220b06da57a441240185e04646c61105fe1d153fcf6c137346935b816"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/tap.rb: FileTooLong \u2014 1107 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 607 over it, 2.21\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":"Library/Homebrew/tap.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6989a684c01ecf022ce33b02db865f5e38cc035a57d77b3644cbc5af1ff9ffa9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DSL: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/install_steps.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1ce6b3b5acb9dfd8de4f3cc35444cdb4ec6f1e7b36408a096e1a5bb2de577b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Sandbox: TooManyMethods \u2014 66 methods. The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/sandbox.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0ab7d0a7b3acb9749da78018ffc092623f6e338fd86c7bee3381aa1bb4460b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: livecheck/livecheck.rb: FileTooLong \u2014 1061 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 561 over it, 2.12\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":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79763c22b5ed27144cb395941d7ce5dc9dbdec8f9055057a4679b7992388bbc1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Brew: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/brew.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"56841f96efcbf3e6c98d8036243c9cdc5fe687cc8c5ba4a5ed7212b244ee643a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 61 methods. The bar is 30 methods; this is 31 over it, 2.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1ad952f9edcb90b60c60c6bce7fa9fd8ce05287ea8278dfe716d5f78fa226a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/formulary.rb: FileTooLong \u2014 991 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 491 over it, 1.98\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":"Library/Homebrew/formulary.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d39836edcc6a59832ba90e0661df8138e33150e6b70bf2633f197dd23434dda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/parser.rb: FileTooLong \u2014 982 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 482 over it, 1.96\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":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"831555086f3ac38a011e58e045fed319b674c61adf00ea4b945931c47acf8984"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dev-cmd/bump.rb: FileTooLong \u2014 954 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 454 over it, 1.91\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":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2f6f1299c603608793986aad4ee5618578ab6d1f9e8bcd819568aef0be323c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Keg: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/keg.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e69e93b45cdfd18119ea50cc8f536932afcd15889f83335dbec21ef834c8d62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rubocops/lines.rb: FileTooLong \u2014 920 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 420 over it, 1.84\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":"Library/Homebrew/rubocops/lines.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c6697e3a22ea942e537a42d1e1843a5078bddd1e80a1ab3254b0c86499edff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Cleanup: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cleanup.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"647c848d185454fc29211be9d7d787c37253a381bb60f854bb2608a2d29b48cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vulns/match.rb: FileTooLong \u2014 887 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 387 over it, 1.77\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":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9520ec2617f32354e8543b00ef26aa9f0383f3c423a434feeaf9b96bc73aa327"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Service: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/service.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f357ed7fb122ed41eb225b6d72eaad747a1ea6e82b6b3ceba90b6253df90693"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FormulaWrapper: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/services/formula_wrapper.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d73394bceeb753f90e246893ffcc620c7e113b00e5cdcebecf18d39b72c421"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cask/installer.rb: FileTooLong \u2014 871 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 371 over it, 1.74\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":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"111f847822cf41a984379745a06b7185c8c39eaf5cc362277509a8d47d90e80b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/cleanup.rb: FileTooLong \u2014 868 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 368 over it, 1.74\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":"Library/Homebrew/cleanup.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4a68d7bb3c7627b58879e5731693ac9dfc5d386d79abed43732c88a52fa343"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Extension: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/extension.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f057405bb19463157a57ee5fad686912b1e9776612f68b97c6168ebb270539"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FormulaAuditor: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c593a14b4a6dca61501296a88afff9dcc0456a8c58d8fcc3b37f2a46ec3a97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/upgrade.rb: FileTooLong \u2014 854 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 354 over it, 1.71\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":"Library/Homebrew/cmd/upgrade.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb40cf39b78dfb1709da3a154fded91c30681bed7a529a159c3b09cbc56236f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/env_config.rb: FileTooLong \u2014 847 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 347 over it, 1.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":"Library/Homebrew/env_config.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4140df75a51c384a66e148fed75107889db69400cb86f9137417a50ca48089"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dev-cmd/bump-formula-pr.rb: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 321 over it, 1.64\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":"Library/Homebrew/dev-cmd/bump-formula-pr.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ee3e72d7d7ee694ac2264d4f1cf1fc4d39761ab32b3dec422c086a0076c393"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Superenv: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/extend/ENV/super.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9802d6c45e5ef5f5a209df91cc59aff8c22ca5d5e16aad0338348c622fbc63b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/exceptions.rb: FileTooLong \u2014 779 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 279 over it, 1.56\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":"Library/Homebrew/exceptions.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dbcb332e353ca96e83dbe103fc9995e5cf6cf0733dad278d301cbd39fca8e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dev-cmd/bottle.rb: FileTooLong \u2014 775 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 275 over it, 1.55\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":"Library/Homebrew/dev-cmd/bottle.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db90c44bc294bea7ddd62b2c159ad398d4987b2971493ca03712249a454efa2d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Winget: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/winget.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"223a4b1f27b8cbd4f46427f53eae218641b7be465442128b0f4b782c6d769b0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/keg.rb: FileTooLong \u2014 764 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 264 over it, 1.53\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":"Library/Homebrew/keg.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"548458ae3e33a41c278e066e073f79ffddc4f6fa9cd1b46362ae57b5b6503035"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cask/cask.rb: FileTooLong \u2014 725 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 225 over it, 1.45\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":"Library/Homebrew/cask/cask.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0057a195dc6c672a4d57ce6c8bff244d660d5eb20eecde6e62ad632e87a637"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/curl.rb: FileTooLong \u2014 724 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 224 over it, 1.45\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":"Library/Homebrew/utils/curl.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1198e7c671f00a0d8e0be02569e768b52304d0d7f900a21841d13f0c465695c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/ast.rb: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 211 over it, 1.42\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":"Library/Homebrew/utils/ast.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23289aff7c89ebc5f6b1ff1c2fb7d6ab861191a235c914da7be02096e4f7524d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cmd/info.rb: FileTooLong \u2014 707 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 207 over it, 1.41\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":"Library/Homebrew/cmd/info.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb706e9de09e40ef8ad7d9d6438a1bf8ef46cc39a747623e2e8adde45b7a99ad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Runner: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/install_steps.rb"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"308c2444e55e8082eab742e9f5f93c9ca8bf0af6df6b7317569c124ad02e2619"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InstallStepsHelper: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/shared/install_steps_helper.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3168fb79b75a6887ccee3eb7097101583f96378b17e6e0aaadf63034d43d2747"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GitHub: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/github.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26de6b260848a88f7cb8858a06e69792008936bbc1872cb3c6ef67e71a66613"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/github.rb: FileTooLong \u2014 695 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 195 over it, 1.39\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":"Library/Homebrew/utils/github.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9199470989c39dc5b05bc2f2f26e0cf7ca043a6e887e47bbc4c82df1088bf544"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shared/install_steps_helper.rb: FileTooLong \u2014 693 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 193 over it, 1.39\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":"Library/Homebrew/rubocops/shared/install_steps_helper.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f65dbfd114b364bb58c8865b3e59c1a03d266519462c3db08b4f487026da91"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DSL: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/dsl.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb2656077f44475fb7a7f855c79030748154074718927311d99a26d7c49338a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SharedEnvExtension: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/extend/ENV/shared.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dfe14a1c558e03afaf684ac739f2c548fd212fc8fa1f987af63962adb90fa2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Trust: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/trust.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c057c363fcc4c56e75bd7e542a6439a6a71a55e226c190a0ceaa063751e3d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cask/cask_loader.rb: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 174 over it, 1.35\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":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da67c1d753ad08302f6bd49f5bc85387b52f7b7753f78796301b7c814f7e8b3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bundle/brew.rb: FileTooLong \u2014 673 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 173 over it, 1.35\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":"Library/Homebrew/bundle/brew.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e680c41d320c29ab85b2424b3a5d6b5c1489aaa135f91985924997288d78c9ac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FormulaAST: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/ast.rb"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b666d9696624e257a5148228b523d11a9a61c7b5ed4b5cd6b839614aab1fb00"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Match: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f30928ae1ad59280afab0161e5031bba55d2700e839d8a4321da5a025d29b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/service.rb: FileTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 152 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/service.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5d06b8a06fa7b11dcf0e63092e1a8607f97bb56d3f59bec39aa58251470ca2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/sandbox.rb: FileTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 147 over it, 1.29\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":"Library/Homebrew/sandbox.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21ca6cfb1632938893ff1cd6c1c4f09dd95a72f42ecf64cdba3ce056756e663"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AbstractUninstall: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/artifact/abstract_uninstall.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c92dfde6bfe1c340c3242e725383d0677ad570cc6051aa39fb0c74f92519ed"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Contributions: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1454aeaf79889ae86d7975a387a06405ec10755a4dae93029be276ac31363d31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/install.rb: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 131 over it, 1.26\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":"Library/Homebrew/install.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eef063657bb5c59c305f36e7e9450917ad8fefa33e272171b421011e04f002"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cask/dsl.rb: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 123 over it, 1.25\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":"Library/Homebrew/cask/dsl.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2108d45a855c727c119ec6aa2e42c1b24bf5d049c380b728fe7ef1e62e1616"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/keg_relocate.rb: FileTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 106 over it, 1.21\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":"Library/Homebrew/keg_relocate.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbb5ae87d2cf347c035382e6578dc1eacc7f4b468550153d56ef12f01a05bfb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Uv: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/uv.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"67315e4c2ea87fc1abce27de9695edfb0fb7a53caaf572b7ab548162f391aaa8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HelperFunctions: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/shared/helper_functions.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab25401e0760564b93840e52132ada75114ace19843710536e129daabf00727f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Formulary: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formulary.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"95362468dcc329ad6b27af101a7f638bf37d470af341276cc7addbd08e30b701"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Install: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/install.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e052dfacb7861cbd6a741ff782dadbb8f7a5a0b9bc37e6bfa4c1e4af3d6d731"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: artifact/abstract_uninstall.rb: FileTooLong \u2014 580 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 80 over it, 1.16\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":"Library/Homebrew/cask/artifact/abstract_uninstall.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c708f78b8b6a9a68495a9a95c42ed75c4365605ee9514ba685a9a377e16799"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/system_command.rb: FileTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 71 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/system_command.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fb60d95a8f50e99441db5992602fc263ca4a0c91831f3dc547a9ed4f051783"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Downloadable: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/downloadable.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa6ee42bc611a764127dc3d195fa5ddcb4a632b8c1a728602318153d5693d44"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Keg: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/keg_relocate.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0baf8c00d9c6995a852f88d1b360a51cb0b30d7efb7aa23663e599a27320e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/sbom.rb: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 55 over it, 1.11\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":"Library/Homebrew/sbom.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc68be2e99e26b4c048eb1deb499e0961a8d4c2d13de9d82f36cc4762a75cb8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/trust.rb: FileTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 51 over it, 1.10\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":"Library/Homebrew/trust.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b25a7a4e8f76dafaaf65729a58ef61c578a9452fa5823ec13c2865707aa00f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Bottle: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bottle.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"293210c2c197c0825bb1f887bb6f75610f8b76f950fd3665d78b462f388051b6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Pathname: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/extend/pathname.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2842cfe11c917786c234332280b6d6a58b6934d3d5ecf8920f51179370bb0260"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SBOM: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/sbom.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1432b77e3c0d73cebc1fa9ed22697914a0a3ecd16ae5e44c47cbe336264448"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tab: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tab/tab.rb"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e929e297c2a88a0e42cac9985dfa5642a3fe44e4aebb7062a5baeba1dbc5a317"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/upgrade.rb: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 47 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/upgrade.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b497227e67f91094547f9d48d38fa2edeaba852e28e6379bf5cfa250e50dd5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MacAppStore: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/mac_app_store.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"83afe9826979e3460335c28bda83a244ba50d8310490bf6a31a124de7145b8e8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Commands: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/commands.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d173930d5f86f020ba6e0627323d9c2c52b007abd8293adf9fc0163ebec8310"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GitDownloadStrategy: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/download_strategy/git_download_strategy.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1519137c2f2f01eb21a241a341899edf253941ce2337d1a947c1521e371e3a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Vulnerability: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/vulnerability.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebf0ff5e9906138ccb760bf6907d0597866fed270989dc2934a1c1b23b3296c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rubocops/install_steps.rb: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 31 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/install_steps.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a36df19404244f9f09fcdf478eabe957b80f9a3a23ef992227874d4f338d5b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/named_args.rb: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 19 over it, 1.04\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":"Library/Homebrew/cli/named_args.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca9c8376b3f204c8f5cf94b7712fb6cb9331535b6158198203c538ac2476f63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/completions.rb: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 19 over it, 1.04\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":"Library/Homebrew/completions.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04f898c2998caea3383f8ddaf25181801e6310068225275a7cc3ae3fa0b70f0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Cargo: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/cargo.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"33110f01c252ddaa9688b0bc352edb0f65c15a08eb6ac3eb8e9db70fc56da1fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Homebrew/version.rb: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 over it, 1.03\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":"Library/Homebrew/version.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9babc55f7916bd722b37f5f97fc4ee4d142839146168028d8908fc92ad519d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extensions/winget.rb: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2 over it, 1.00\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":"Library/Homebrew/bundle/extensions/winget.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"818cd13df6033f21fd25b0ce0648832d862fdd674d89e9bc670c38ef8a04df24"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (53 shared lines): Library/Homebrew/livecheck/livecheck.rb:640-893 | Library/Homebrew/livecheck/livecheck.rb:919-1139 \u2014 These two members are variants of one another: 53 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"80823d39c1d38c2350171a24064791dae8f71f21f0c099ad97d0482b0f1300d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): Library/Homebrew/livecheck/strategy/json.rb:109-125 | Library/Homebrew/livecheck/strategy/page_match.rb:96-114 | Library/Homebrew/livecheck/strategy/sparkle.rb:248-267 | Library/Homebrew/livecheck/strategy/xml.rb:148-164 | Library/Homebrew/livecheck/strategy/yaml.rb:107-123 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/json.rb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e194e8c592a7a5e9576412b3578a47ce62d043d3a4bd509bd4245c658957d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): Library/Homebrew/cask/cask_loader.rb:650-691 | Library/Homebrew/formulary.rb:1209-1261 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7a35271f45b5fd8dcd054a495360b5fc32ae4bd534f8d404b3387e59240e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): Library/Homebrew/diagnostic.rb:1807-1837 | Library/Homebrew/diagnostic.rb:1842-1873 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/diagnostic.rb"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22ac541d0c282e8ee0a7220a335f5342a765790f024a06bb54be96ff6788a7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): Library/Homebrew/cask/cask_loader.rb:481-512 | Library/Homebrew/formulary.rb:766-798 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"af527c1f6776a33e4cbbbe337a716df73e6e1f0d9dffd6513b3ee78bffd8770f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): Library/Homebrew/dev-cmd/bump-compatibility-version.rb:33-72 | Library/Homebrew/dev-cmd/bump-revision.rb:35-75 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump-compatibility-version.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f17cfdc3d57b02ad57865d2a80c03030dc7bd082154d6a4d4763cb93b0fbc92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): Library/Homebrew/cask/installer.rb:886-922 | Library/Homebrew/formula_installer.rb:1899-1941 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e9e61a8dba67019f91115b11e773c6d92d2477b17445769815a3578ea083fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): Library/Homebrew/reinstall/reinstall.rb:42-78 | Library/Homebrew/upgrade.rb:594-635 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/reinstall/reinstall.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"125cf0ca247b516f93fe023d2060e6dd9ca1fa3f0cdcc2a28390d3840f60cf39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): Library/Homebrew/cask/staged.rb:29-58 | Library/Homebrew/install_steps.rb:1356-1379 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/staged.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31b5adcc55d4e1afe742711805919df22ea31e36dd97e72038a8297af83e664"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): Library/Homebrew/rubocops/bottle.rb:61-86 | Library/Homebrew/rubocops/bottle.rb:96-121 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/bottle.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3153d2d8d9424e335244bda109d0a1be063dc592c3d408897aa198c217f56e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Library/Homebrew/cli/named_args.rb:109-118 | Library/Homebrew/cli/named_args.rb:288-304 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/named_args.rb"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2916afd640a3d84a4cb376616501eabf4653530e81ac8a45355a7ca61ceea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): Library/Homebrew/cmd/nodenv-sync.rb:24-45 | Library/Homebrew/cmd/pyenv-sync.rb:24-44 | Library/Homebrew/cmd/rbenv-sync.rb:24-45 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/nodenv-sync.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d80d62dd54256c000c7d21a3d6817aaf20729082390a07973e71c8525cc29c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): Library/Homebrew/livecheck/strategy/crate.rb:97-117 | Library/Homebrew/livecheck/strategy/github_latest.rb:90-109 | Library/Homebrew/livecheck/strategy/github_releases.rb:133-152 | Library/Homebrew/livecheck/strategy/npm.rb:77-95 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/crate.rb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc04ebc91c0112a01e88c54641ef00865d3d681ee7c1d7a19c52799afcb5f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Library/Homebrew/description_cache_store.rb:52-67 | Library/Homebrew/description_cache_store/cask_description_cache_store.rb:38-50 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/description_cache_store.rb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6976cb72fef9c72445a4861c966aa72458e1dcb03da8fd7cce038a79a0953436"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Library/Homebrew/tap/core_cask_tap.rb:59-73 | Library/Homebrew/tap/core_tap.rb:206-220 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap/core_cask_tap.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a964505164565700fd1a00d4d5680021607b8e41304cbf98d09eb28ded67b0bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): Library/Homebrew/utils/shared_audits.rb:422-445 | Library/Homebrew/utils/shared_audits.rb:450-471 | Library/Homebrew/utils/shared_audits.rb:517-539 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/shared_audits.rb"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a368fc21f9623fd4c2697726fa4e099245d282bc1e5237cc2c8538ae767b34f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): Library/Homebrew/cmd/source.rb:141-166 | Library/Homebrew/cmd/source.rb:171-190 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/source.rb"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adb41c791cdfd8ee0810dcb0de022e79c6f43df902bb877cfc08069fba1fcf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): Library/Homebrew/cask/artifact/abstract_artifact.rb:196-202 | Library/Homebrew/downloadable.rb:176-183 | Library/Homebrew/os/linux/elf.rb:49-58 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/artifact/abstract_artifact.rb"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6be82b72359c34d26d0a0136894deeeb5903beb8dfd4828cfe8e6b24a4eb53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Library/Homebrew/diagnostic.rb:1557-1574 | Library/Homebrew/diagnostic.rb:1579-1598 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/diagnostic.rb"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1ba9c95ca33a6ab48852fce8a65a3ed48ea62b7adc89cafd1e14a48d0da3dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): Library/Homebrew/cask/artifact/abstract_uninstall.rb:473-494 | Library/Homebrew/cask/ci/zap_check.rb:118-145 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/artifact/abstract_uninstall.rb"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec32f65d6efd4f3156fd882366f602611f63d96dcfc8f4f98c5f3372ca96fd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): Library/Homebrew/cli/named_args.rb:240-250 | Library/Homebrew/cli/named_args.rb:255-265 | Library/Homebrew/cli/named_args.rb:270-280 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/named_args.rb"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"780da33ecc83f2e09766f6dc1e919ee1e6ce129ff260930e11a7baaea96af922"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): Library/Homebrew/cask/dsl.rb:774-793 | Library/Homebrew/cask/dsl.rb:811-840 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/dsl.rb"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"899cb84f5d07222a6a2a1c400cf07055a9fcfbea29b9660bba9f8ed61d07c7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Library/Homebrew/bundle/cask.rb:23-27 | Library/Homebrew/bundle/extensions/flatpak.rb:57-60 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/cask.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25e697887da423c087fcf3c1429dce3904de13a3da90552e26daf5ff24b5a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Library/Homebrew/services/formula_wrapper.rb:500-505 | Library/Homebrew/services/formula_wrapper.rb:510-515 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/services/formula_wrapper.rb"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec400850ecb38f7ab4dff87623f88cc09d38e208ca6b910ca87e636b7fa3dba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Library/Homebrew/diagnostic.rb:543-560 | Library/Homebrew/diagnostic.rb:565-583 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/diagnostic.rb"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6e04c0da6b1fe79b472bc9915654c2f8ec68ab72ef7a59ee6841fb14ca2c99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Library/Homebrew/dev-cmd/advisory-match.rb:1081-1095 | Library/Homebrew/dev-cmd/advisory-match.rb:1100-1113 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e2815311861769e8118cbe0204f9dfe0796dfb739c557804aa0b5f8a1ad69b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): Library/Homebrew/livecheck/strategy/apache.rb:62-82 | Library/Homebrew/livecheck/strategy/cpan.rb:50-71 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/apache.rb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba29bae58da22a1c45e728d6db737d77ffabcddbbdf17061cc9f0a5ec27f7ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Library/Homebrew/cmd/update_report/reporter_hub.rb:113-128 | Library/Homebrew/cmd/update_report/reporter_hub.rb:133-151 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/update_report/reporter_hub.rb"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"147b4aee71e292248162c19bd8027075e806c24ed1cd9baa38f954cd2724d480"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Library/Homebrew/rubocops/urls.rb:137-146 | Library/Homebrew/rubocops/urls.rb:160-169 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/urls.rb"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0626af347c11999d7176bbe4b3bf3ab2d734025651ac6d696ce2e6e5ca5a87c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Library/Homebrew/utils/shared_audits.rb:371-383 | Library/Homebrew/utils/shared_audits.rb:406-417 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/shared_audits.rb"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a571625cc2e520cb3a6cb91fac60a4f2426907c5a5414885fe8018334ff8d5e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Library/Homebrew/tap.rb:1082-1087 | Library/Homebrew/tap.rb:1106-1111 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap.rb"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa50f47415059c36b3b66fe9ec375e519e4c0aa1b761fa3d284ef33dd8d0819"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): Library/Homebrew/cask/audit.rb:1012-1021 | Library/Homebrew/cask/audit.rb:1026-1036 | Library/Homebrew/cask/audit.rb:1041-1050 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c4e444d52cacfcef01e0726c5fca4d348b5408192f1125487616b421dea867"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): Library/Homebrew/cask/audit.rb:1104-1114 | Library/Homebrew/cask/audit.rb:1119-1129 | Library/Homebrew/cask/audit.rb:1134-1144 | Library/Homebrew/cask/audit.rb:1149-1159 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac03c971e5cb1f09131a206dd0b4a640ac89b8eb5f1a6287cbd27f2810f62d80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Library/Homebrew/tap.rb:98-107 | Library/Homebrew/tap.rb:112-121 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap.rb"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b111788b46330895c34a8f5326ee6b71875771486c2d2cd4b333f3342cc3197f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Library/Homebrew/sorbet/tapioca/compilers/rspec_dynamic_matchers.rb:42-50 | Library/Homebrew/sorbet/tapioca/compilers/rspec_dynamic_matchers.rb:85-93 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/sorbet/tapioca/compilers/rspec_dynamic_matchers.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7a55ff255273e3c20c344823a19dc905e4a0a5a2ca62cb5f7a15acdbc3fbda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Library/Homebrew/extend/os/linux/keg_relocate.rb:117-132 | Library/Homebrew/extend/os/mac/keg_relocate.rb:229-244 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/extend/os/linux/keg_relocate.rb"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"db63ca69b44e6ac9a0902ad6754d2872d96962d69b715a9dac98d5c9c4845f60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Library/Homebrew/bundle/brew.rb:306-320 | Library/Homebrew/bundle/brew.rb:325-339 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/brew.rb"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01a216c882def4cf705d72580e39331f6c056374e430c9ebf541ae668739f66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Library/Homebrew/download_strategy/curl_download_strategy.rb:372-377 | Library/Homebrew/download_strategy/curl_download_strategy.rb:407-413 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/download_strategy/curl_download_strategy.rb"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bad1a1b4b997745843e6fb99fc9f3c977e2e01617017c59556b7f12687d0a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): Library/Homebrew/cask/audit.rb:1056-1065 | Library/Homebrew/cask/audit.rb:1071-1082 | Library/Homebrew/cask/audit.rb:1087-1099 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bb01e77af1a5d43c2477cd8eb11ea445f20847d6d32352d8f7b5954c50a4fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Library/Homebrew/cmd/tap-info.rb:124-135 | Library/Homebrew/cmd/tap-info.rb:140-151 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/tap-info.rb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6f55c1bd809963dbb5174337130aaca558cd2c15508fe5cdc149e4819b5488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): Library/Homebrew/bundle/extensions/cargo.rb:294-305 | Library/Homebrew/bundle/extensions/extension.rb:353-364 | Library/Homebrew/bundle/extensions/uv.rb:377-389 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/cargo.rb"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e6bcbaa0660d4e3d0c68b5be729b8f7d4cc3a1cc79ca97df602f56c01267e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Library/Homebrew/bundle/extensions/winget.rb:135-137 | Library/Homebrew/caveats.rb:18-22 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/winget.rb"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40ce1e615831c7c51cbb8b655a64baf0d41e76cb0786658b2ff008c89efcc8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Library/Homebrew/formula_auditor.rb:1298-1307 | Library/Homebrew/resource_auditor.rb:76-87 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e57a9b82003d17a4429d214bd545d31ac21bdfb7934d4985c1d9a3d7dfa22e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): Library/Homebrew/bundle/extensions/go.rb:25-27 | Library/Homebrew/bundle/extensions/krew.rb:22-25 | Library/Homebrew/bundle/extensions/mac_app_store.rb:51-54 | Library/Homebrew/bundle/extensions/npm.rb:22-24 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/go.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9a937f85bc910bffeff90bd59e564d887021eba4b50f165f47163a80c91938"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): Library/Homebrew/bundle/extensions/cargo.rb:375-381 | Library/Homebrew/bundle/extensions/extension.rb:375-377 | Library/Homebrew/bundle/extensions/uv.rb:418-426 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/cargo.rb"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"316af650301e8788eb3a2f9f9234d3551d9309e98017c35758ea76bedf8f5e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Library/Homebrew/download_strategy/homebrew_curl_download_strategy.rb:49-55 | Library/Homebrew/utils/curl.rb:467-472 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/download_strategy/homebrew_curl_download_strategy.rb"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8708f653b3de38b7c5b14fba92ebb77695e77337741ccf21037b65c16262bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Library/Homebrew/livecheck/strategy/hackage.rb:56-70 | Library/Homebrew/livecheck/strategy/gnome.rb:57-72 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/hackage.rb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"322352ce68e5fe705b6844f5edaa61222451b3088ec31673dd9c07480500cfdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Library/Homebrew/bundle/extensions/cargo.rb:101-112 | Library/Homebrew/bundle/extensions/npm.rb:98-109 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/cargo.rb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa0a97c3be08bf7f6bcd396958309a8ad26a19918a42c2904a09215edd891f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Library/Homebrew/livecheck/strategy/github_latest.rb:60-69 | Library/Homebrew/livecheck/strategy/github_releases.rb:70-79 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/github_latest.rb"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7394fd6524881c363fd01497f078140f9e9ad2c0aff6fb5bf6e09c01e5a9d9f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Library/Homebrew/livecheck/strategy/xml.rb:115-127 | Library/Homebrew/livecheck/strategy/yaml.rb:76-86 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/xml.rb"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c82577924319d19363fd819a1484f560faaf1c9e2fa883a5ffdcfbe34fc5f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): Library/Homebrew/analytics/subcommand.rb:17-24 | Library/Homebrew/completions/subcommand.rb:17-24 | Library/Homebrew/developer/subcommand.rb:17-24 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/analytics/subcommand.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85e99b7484e400833e0be8b34d414b0e0ac05910dd940edce880ff7fa62b2a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Library/Homebrew/bundle/extensions/extension.rb:399-401 | Library/Homebrew/bundle/package_type.rb:171-173 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/extension.rb"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd09e52fe9cf07fb7e2c595e27e4a70322f788ece24a051484461a5b71156090"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Library/Homebrew/utils/cpan.rb:18-21 | Library/Homebrew/utils/pypi.rb:27-32 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/cpan.rb"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a68e8c8a79e1a80bcc3c340022816ce76e8963cb5e4240333d18b4cf6165103"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Library/Homebrew/install.rb:709-711 | Library/Homebrew/upgrade.rb:236-238 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/install.rb"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd84aecd5b9e1d613517011d1f9bf07182eb655f5e55cb4889e6d5f3cf8a66a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Library/Homebrew/bundle/extensions/extension.rb:230-239 | Library/Homebrew/bundle/extensions/flatpak.rb:408-416 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/extension.rb"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7b8d3a9c4e33aea9213203e2a326549029237c007b3ba941e7546f9d31eb85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 5\u002B corresponding lines): Library/Homebrew/unpack_strategy/bzip2.rb:28-33 | Library/Homebrew/unpack_strategy/gzip.rb:23-27 | Library/Homebrew/unpack_strategy/lzip.rb:28-33 | Library/Homebrew/unpack_strategy/lzma.rb:28-33 | Library/Homebrew/unpack_strategy/xz.rb:28-33 | Library/Homebrew/unpack_strategy/zstd.rb:28-33 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/bzip2.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69fa43a7547666b1f063b40f4b1c0b430bfe1044e1b74551d39113fe8c00420"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): Library/Homebrew/rubocops/cask/mixin/on_desc_stanza.rb:14-18 | Library/Homebrew/rubocops/cask/mixin/on_homepage_stanza.rb:14-18 | Library/Homebrew/rubocops/cask/mixin/on_url_stanza.rb:14-18 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/mixin/on_desc_stanza.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b89b887f01be5c5de1369c5c6bbe958e8d725aebd5df74a0c49f821b8f3c231"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Library/Homebrew/sorbet/tapioca/compilers/args.rb:22-25 | Library/Homebrew/sorbet/tapioca/compilers/subcommand_args.rb:18-21 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/sorbet/tapioca/compilers/args.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1eb558df4958343d8b2d5c541a0d95c4e3554f389dbcd0346783efa85ee9b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): Library/Homebrew/cask/auditor.rb:28-31 | Library/Homebrew/system_command.rb:178-179 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/auditor.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be0a2c4f2413bb099cf5a5a894c212ba42aa5dcc6e6cb3729a699e51c2e45a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Library/Homebrew/api/cask_struct.rb:12-18 | Library/Homebrew/api/formula_struct.rb:13-17 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/api/cask_struct.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e679d555c14f42225452410ec5fd62221d6c18a0618f2c6fa8d57eabdcabe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): Library/Homebrew/cmd/pyenv-sync.rb:51-75 | Library/Homebrew/cmd/rbenv-sync.rb:52-75 \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":"Library/Homebrew/cmd/pyenv-sync.rb"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7754ec858d7b1f5577ef64fc488b94fcc42d9b0c0a18e6d83540cf62fdae9b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): Library/Homebrew/livecheck/livecheck.rb:787-810 | Library/Homebrew/livecheck/livecheck.rb:1047-1070 \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":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdac7b2f779749ace76a5c186fc8bf8cf6d66026a69f7bed4dad20a8c0b2b10b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): Library/Homebrew/livecheck/livecheck.rb:710-729 | Library/Homebrew/livecheck/livecheck.rb:960-979 \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":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"4555f64e922b5b52f7b6ad0d3f54b1f21bb9dfcf58564c16d65b30999323432b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): Library/Homebrew/cask/artifact/abstract_uninstall.rb:474-491 | Library/Homebrew/cask/ci/zap_check.rb:120-137 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/artifact/abstract_uninstall.rb"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b7bb6826b5d1a1599a8946dcc7f7991919097ba70254f9209cdaf45083f46f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): Library/Homebrew/formula.rb:5312-5329 | Library/Homebrew/formula.rb:5423-5440 \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":"Library/Homebrew/formula.rb"},"region":{"startLine":5312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffadb0b85e9f80a02a208672ad217347479802d512893de49911b285ed90a7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): Library/Homebrew/diagnostic.rb:1817-1833 | Library/Homebrew/diagnostic.rb:1852-1868 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Library/Homebrew/diagnostic.rb:1817\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/diagnostic.rb"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f51e16882ed8c6aace37cb439d9346c3e0dc813d27440e29221bdb307c889f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): Library/Homebrew/utils/shared_audits.rb:429-445 | Library/Homebrew/utils/shared_audits.rb:523-539 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/shared_audits.rb"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd684fcfeecfdfe54b792323a4c07edcf080154b8a5bc0b16c451de91ff5a0f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): Library/Homebrew/livecheck/strategy/json.rb:112-125 | Library/Homebrew/livecheck/strategy/page_match.rb:101-114 | Library/Homebrew/livecheck/strategy/xml.rb:151-164 | Library/Homebrew/livecheck/strategy/yaml.rb:110-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/json.rb"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"498889fca7efded8b6d8b0f999db9d6403ee31aef0e4aa886f1052ecc7f14ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Library/Homebrew/reinstall/reinstall.rb:44-57 | Library/Homebrew/upgrade.rb:601-614 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/reinstall/reinstall.rb"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e65a661e21ddc22456e1e1658f4050f245ac4104d00969f2d4fbdc4bafa494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Library/Homebrew/livecheck/strategy/crate.rb:97-109 | Library/Homebrew/livecheck/strategy/npm.rb:77-89 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/crate.rb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d23a7faf1ea4158b66686e00248b921a8b6f9578ff72a74977d949735db4bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Library/Homebrew/livecheck/strategy/github_latest.rb:91-103 | Library/Homebrew/livecheck/strategy/github_releases.rb:134-146 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/github_latest.rb"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d86ed3fce6703660da5226956bc6fe58dba7137303a59657990e1248d59a96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Library/Homebrew/build.rb:101-112 | Library/Homebrew/build.rb:114-125 \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":"Library/Homebrew/build.rb"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5906d35bd836e03dc9847521ada0edb8a132013cd1f04742b16a8b2ca42ed0ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): Library/Homebrew/cmd/install.rb:370-381 | Library/Homebrew/cmd/reinstall.rb:246-256 \u2014 before extracting anything, compare \u0060Library/Homebrew/cmd/install.rb\u0060 and \u0060Library/Homebrew/cmd/reinstall.rb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Library/Homebrew/cmd/install.rb:370\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/install.rb"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"071384b551bf29c483c385e6fbf41a63556ca6cbb559bab5f425b94320abe9dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Library/Homebrew/cmd/install.rb:451-462 | Library/Homebrew/cmd/reinstall.rb:319-330 \u2014 before extracting anything, compare \u0060Library/Homebrew/cmd/install.rb\u0060 and \u0060Library/Homebrew/cmd/reinstall.rb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Library/Homebrew/cmd/install.rb:451\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/install.rb"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd454df184549a169fa8762bdaf169a09906f2b92e15795fa3926bd954869c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Library/Homebrew/dev-cmd/contributions.rb:478-489 | Library/Homebrew/dev-cmd/contributions.rb:525-536 \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":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4deb77b72bfe55fdc5199247e41d6126f857aafe4ec72903e9b04b0f11f34a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): Library/Homebrew/cmd/install.rb:350-360 | Library/Homebrew/cmd/install.rb:374-384 | Library/Homebrew/cmd/reinstall.rb:233-243 \u2014 before extracting anything, compare \u0060Library/Homebrew/cmd/install.rb\u0060 and \u0060Library/Homebrew/cmd/reinstall.rb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Library/Homebrew/cmd/install.rb:350\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/install.rb"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a30aa7d170cc4c7b5793e83a8eeba71dc8267954c12d039efb21b90160b661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Library/Homebrew/livecheck/strategy/page_match.rb:97-107 | Library/Homebrew/livecheck/strategy/sparkle.rb:249-260 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/page_match.rb"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5684cb558e0af5e49b0df76ae78a1c6b3060a0e869aa0b090290f30ebc39fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7): Library/Homebrew/cmd/install.rb:349-358 | Library/Homebrew/cmd/install.rb:373-382 | Library/Homebrew/cmd/reinstall.rb:184-193 | Library/Homebrew/cmd/reinstall.rb:232-241 | Library/Homebrew/cmd/reinstall.rb:248-257 | Library/Homebrew/cmd/reinstall.rb:318-327 | Library/Homebrew/cmd/upgrade.rb:693-702 \u2014 before extracting anything, compare \u0060Library/Homebrew/cmd/install.rb\u0060 and \u0060Library/Homebrew/cmd/reinstall.rb\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/install.rb"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e87b92c6c224291c69e690d4be62b78d4f2f6f167830ead4b17f4f3ba3b546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Library/Homebrew/cask/cask_loader.rb:700-709 | Library/Homebrew/formulary.rb:1267-1276 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86083f0dba885f8632003cda38e1d78c45bef0b7cddcbc364ade6b0443ab9d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): Library/Homebrew/livecheck/strategy/json.rb:111-119 | Library/Homebrew/livecheck/strategy/page_match.rb:100-108 | Library/Homebrew/livecheck/strategy/sparkle.rb:253-261 | Library/Homebrew/livecheck/strategy/xml.rb:150-158 | Library/Homebrew/livecheck/strategy/yaml.rb:109-117 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/json.rb"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"736197a10a198c9751eebfd744ce4714f4df2a5902f8f0c5dc514bcc23bdf8ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Library/Homebrew/livecheck/livecheck.rb:760-768 | Library/Homebrew/livecheck/livecheck.rb:1017-1025 \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":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"664b38bbe3b236352602a2cbc38d21f6e9cf98f8db70bc8dbf85e72363dac639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Library/Homebrew/cask/staged.rb:48-56 | Library/Homebrew/install_steps.rb:1366-1374 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/staged.rb"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b937c19525d5e50656d063e7aa122d86d67f3dfa54e2967cf715c7fffa5bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): Library/Homebrew/cli/named_args.rb:244-250 | Library/Homebrew/cli/named_args.rb:259-265 | Library/Homebrew/cli/named_args.rb:274-280 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Library/Homebrew/cli/named_args.rb:244\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/named_args.rb"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ace4f0e95c6359e7cbeee321fe80f6759afddcd74cf61aab335eafc07adebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Library/Homebrew/dev-cmd/bump.rb:147-154 | Library/Homebrew/dev-cmd/livecheck.rb:71-78 \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":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab805b0a5545c06c126e014730b47256200a075381227e276c8ea1a00cf07891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Library/Homebrew/tab/tab.rb:430-436 | Library/Homebrew/tab/tab.rb:459-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Library/Homebrew/tab/tab.rb:430\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tab/tab.rb"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9054b55efa118d2b2b2e367a3869ed141de353e2ad20f178e7af09bf8b13db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Library/Homebrew/abstract_command.rb:33-40 | Library/Homebrew/abstract_subcommand.rb:21-28 \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":"Library/Homebrew/abstract_command.rb"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cecf128d85179948d446893261cee68a458150f6fafa7991f4364978d9c1aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Library/Homebrew/bundle/extensions/cargo.rb:268-277 | Library/Homebrew/bundle/extensions/uv.rb:351-360 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/cargo.rb"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf78de3cdacfe83eb0e5d0a5a0f2b2215985f590b481121f9eaf8a3e7848f456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): Library/Homebrew/livecheck/strategy/apache.rb:103-111 | Library/Homebrew/livecheck/strategy/bitbucket.rb:114-122 | Library/Homebrew/livecheck/strategy/cpan.rb:92-100 | Library/Homebrew/livecheck/strategy/gnu.rb:107-115 | Library/Homebrew/livecheck/strategy/hackage.rb:91-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/apache.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4931618f88555ad82f90be5f66d050b8decbd8cb7d2da14154f83114f0cbc7d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Library/Homebrew/livecheck/strategy/pypi.rb:96-107 | Library/Homebrew/livecheck/strategy/ruby_gems.rb:85-96 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/livecheck/strategy/pypi.rb"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae91076a9894c340e9bb88ea66205472f2b96b3e833ade053f5bed5aa0fefea5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Library/Homebrew/rubocops/blank.rb:49-56 | Library/Homebrew/rubocops/present.rb:42-50 \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":"Library/Homebrew/rubocops/blank.rb"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c521d13fb9a54f1f0d5da7953c34487f9c823eea2c69655d3abe615df4726d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Library/Homebrew/tap/core_cask_tap.rb:78-85 | Library/Homebrew/tap/core_tap.rb:180-187 \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":"Library/Homebrew/tap/core_cask_tap.rb"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4c50ead00def211211ac4f6b24b867feaf49a209a169a86b0b36147d5f3358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Library/Homebrew/cask/dsl.rb:212-217 | Library/Homebrew/cask/dsl.rb:219-224 \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":"Library/Homebrew/cask/dsl.rb"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d875bf8fb161a21f54ff29512cde04aa8cb176fb98cdd1d35ef73a42ebb7b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Library/Homebrew/style.rb:229-233 | Library/Homebrew/style.rb:237-241 \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":"Library/Homebrew/style.rb"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb88b65c5fe1e20098205cb4d9ce4a378289f2096967f9d3d1477856ef20dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): Library/Homebrew/extend/os/linux/sandbox/landlock.rb:164-172 | Library/Homebrew/extend/os/linux/sandbox/landlock.rb:177-185 | Library/Homebrew/extend/os/linux/sandbox/landlock.rb:190-198 | Library/Homebrew/extend/os/linux/sandbox/landlock.rb:203-211 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/extend/os/linux/sandbox/landlock.rb"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f294dbc90fb1d6d73f18ba170e25dca5a8cca620a59ad4678a89514146360ab3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Pathname (LCOM4 26): Pathname\u0027s methods fall into 26 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 26 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":"Library/Homebrew/extend/pathname.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c8ca7839ec27d719c7e54bf1e01b6969b4edb4cf84c6d0d4172830f3aad6ca"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FormulaInstaller (LCOM4 20): FormulaInstaller\u0027s methods fall into 20 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 20 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":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f04e1d4c85b8224439a3a4b75d6b16d866a5a04e69244783055868b5dce2465"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Formula (LCOM4 16): Formula\u0027s methods fall into 16 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 16 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula.rb"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef56ba6823cc73bb86a870ebe97cad3ebac46944f0f531e2ed59025b5ad8d01"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DSL (LCOM4 15): DSL\u0027s methods fall into 15 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 15 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":"Library/Homebrew/cask/dsl.rb"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0a8a38d1baad5d32f9c4adc21d21972b0d89e6e93947c72a1dadcd886f63e6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Checks (LCOM4 15): Checks\u0027s methods fall into 15 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 15 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":"Library/Homebrew/diagnostic.rb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf9f5be0f2747aee38ed9f0630cc6d1ac4d9ace00391f1940e22fca628f1e89"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Service (LCOM4 13): Service\u0027s methods fall into 13 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 13 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/service.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e95cdcd8b2e51680d0dc63fc01a74904fa1a352149d07a556c65c60ac6cb4be"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Installer (LCOM4 11): Installer\u0027s methods fall into 11 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 11 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":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"334c4c277e3ba1ba14ac223903b95c5827f22e08aba03fd37c2f7634652f717a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Tap (LCOM4 10): Tap\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3087ae65632264869bd7b63af7c770cfd6bb26b2b196ebb77a79a124cfa1a1d5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TestFormulae (LCOM4 10): TestFormulae\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test_bot/test_formulae.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d04049d63c515a9435c450a31c5a8525a4de1cc88cccbaabfe72a1acad1f695"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AbstractArtifact (LCOM4 9): AbstractArtifact\u0027s methods fall into 9 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 9 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":"Library/Homebrew/cask/artifact/abstract_artifact.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"82eb3cf2825b2758e2d30c4f40a49132de2bc8b80e4dcaaf827bcddc1011b7df"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Cleanup (LCOM4 9): Cleanup\u0027s methods fall into 9 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 9 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":"Library/Homebrew/cleanup.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c80cf1277cbb413505c4acaf07961f28378b970753f6773359d0a662993229c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Requirement (LCOM4 9): Requirement\u0027s methods fall into 9 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 9 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":"Library/Homebrew/requirement.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce214d011079a5b56f60640f3849a24307d95b13907cec732730d79e50e84f5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Cask (LCOM4 8): Cask\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4147721f40c48d4f4984c39b917b8613d6240e87c7f9a91839532c474340bc40"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DependsOn (LCOM4 8): DependsOn\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/dsl/depends_on.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fc98c7e25a054f597dff60f7c3872f3e3d119d623f8712d2b8066ee03e7d45"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AbstractDownloadStrategy (LCOM4 8): AbstractDownloadStrategy\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/download_strategy/abstract_download_strategy.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"135fe53afdf2e618d9bf9167673524e601e7b79feb744fcfed4669b7bba40013"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FormulaAuditor (LCOM4 8): FormulaAuditor\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3734324ac44d106a4c62fe7aed8786f5e8fff732febf900ff9efada7184f2de"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FormulaLoader (LCOM4 8): FormulaLoader\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formulary.rb"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"376dd6cc85fce8deeff9edffe8ba00c1425b14613fbb66dcb11d3556cd82b0c4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Keg (LCOM4 8): Keg\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/keg.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13f13fa483eafa5058c78e9f852e8cccac34065ec9b7a01c3bdf18fb28f7651"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Result (LCOM4 8): Result\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/system_command.rb"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a497f7073e26130f3fce6d7baada79d96b64113ec7fc291e2e193b3c073e02b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Test (LCOM4 8): Test\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test_bot/test.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16be3ed915319e6d3c9853a99f293bbc5fdaef1800b41239001005f5b176e1b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Config (LCOM4 7): Config\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/config.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"104c99c086f80e323efc9134f23fa18adfc13ae2154f508bb7fb138e6812e4f9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Base (LCOM4 7): Base\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/dsl/base.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2b39f694a58b7ed4aeea733b33b0618f90af90bddaffbc82c9796e9d0759a2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Cleaner (LCOM4 7): Cleaner\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cleaner.rb"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4588929365518b4f0d130106daf325bc3857c522bf4334f31ea282dd7ae7ce"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VerificationCache (LCOM4 7): VerificationCache\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/downloadable.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"233283c0a4292aa6e42d2decb6933ddb1cd9e927b45277156e09025a7a770156"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FormulaCreator (LCOM4 7): FormulaCreator\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_creator.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ddebe8cd0e7260332eefed2c57bdeb5f9ef5730f400406cbc1d0180b7eca7f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FormulaVersions (LCOM4 7): FormulaVersions\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_versions.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a915c5e7faa277f3f701f4aca0efe06dcc2d2baf114088c2b561fc4f685568a9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GitHubReleases (LCOM4 7): GitHubReleases\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/github_releases.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7647038f1b9e730cb46b211009fd148d3797378a04f9c9cb1658f1015b9730"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LinkageChecker (LCOM4 7): LinkageChecker\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/linkage_checker.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"057b486ebc2ac18aa2509b2c9628a448b8cf6b5e70d67de1f4531e6015f47638"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Air (LCOM4 7): Air\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/air.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62b820a7bade99da0d4cd7869c5522b0234878952b66239729b51a5c334e214"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Bzip2 (LCOM4 7): Bzip2\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/bzip2.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"264387b9108ce4ceed3b37590665a5c0b8c4397edc9f685e5c48117e57187316"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Cab (LCOM4 7): Cab\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/cab.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1357729d84f994a2a6e05315c5d0df9953a111815c23daae2be10e917673fd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Directory (LCOM4 7): Directory\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/directory.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"db39d9f5b5284e3e75bdeeeb1496f679b710a298bfab935084f3de0d64e09799"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GenericUnar (LCOM4 7): GenericUnar\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/generic_unar.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e332c543942086b4d3c212d9c3524ab5a54ab9d0fa2628d219412d451f5519f0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Lha (LCOM4 7): Lha\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/lha.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"34751d22f6c7a946b727c1a6d2430d6b6f52edcda05c2612136a42933e8cc571"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Lzip (LCOM4 7): Lzip\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/lzip.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"595c24a58d3031149a14593ca6407e06c476282eaad4359dbd85798bc4807a94"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Lzma (LCOM4 7): Lzma\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/lzma.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadd1a0c6593ca67515cf0241a0e751b96a30c8020e233fd8820cfadb91fd9ba"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: P7Zip (LCOM4 7): P7Zip\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/p7zip.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f2eeb178bb334bc052c1a4da04878d2cbd4ab1a8a425066e88a30ddfa8c677"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Rar (LCOM4 7): Rar\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/rar.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b896705c824c42747ec6273d6f1bcafcc9c6d5663585efdc275647b6c4c72df0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Xz (LCOM4 7): Xz\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/xz.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8070451a6bc78c2924828ba2cd8583fdd18b9c955c078b79842ae209c2f7810"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Zstd (LCOM4 7): Zstd\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/zstd.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde7a788f8c625fc845d0e3385f84a0a5c9394a5ccfae17a931d4510db665f9c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StringInreplaceExtension (LCOM4 7): StringInreplaceExtension\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/string_inreplace_extension.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93c5bbfddbba17ed217680220e3084de57be5d082287dff2868b72e5c9afa91"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Vulnerability (LCOM4 7): Vulnerability\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/vulnerability.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"207f8f6a990794e393c7663f3baf44848d36a0efa5abfd594e50d1aa10faec42"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AbstractCommand (LCOM4 6): AbstractCommand\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/abstract_command.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"25356e233cb9be76ca8442b8d92ce811c699381c216518765bc99cd63dafbea5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AbstractSubcommand (LCOM4 6): AbstractSubcommand\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/abstract_subcommand.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f4e1cc29d1005bc9cb5afae3b52fe2101e9c537f4c4889bd30143887d8f342"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Alias (LCOM4 6): Alias\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/aliases/alias.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9278e5e88fa5be49da098bd1ea4e40e39ad0c7a9598dcc9c585850e36375024"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: JSONDownload (LCOM4 6): JSONDownload\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/api/json_download.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd4e5d69a790aa2b98ff178c8c54660bec61c5210134e1e5f783cf45a57dca1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SourceDownload (LCOM4 6): SourceDownload\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/api/source_download.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a921fc916e9240606d0e6739246b9527cc7bfc62cd6a152613742888ac84b8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Bottle (LCOM4 6): Bottle\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bottle.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc20ce874d42a78700fce406d07c346085bacb601779941a3c2dfd087d25f26b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BottleSpecification (LCOM4 6): BottleSpecification\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bottle_specification.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c93c7a763886208968b2c4599917ceff5a7f541e6dc33c1a8f6abe50752325"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Build (LCOM4 6): Build\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/build.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f15459505f9f615f0c8255c40bd6d440d72459062326aa680c02653c4fc014"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Auditor (LCOM4 6): Auditor\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/auditor.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f0017dbefc94476fb608eb8dfe41f81e96c436d5d7ab4bfbb33dfa2fe6212e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AbstractContentLoader (LCOM4 6): AbstractContentLoader\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fbc41fc88434c669c90ad1d0d21ab934556f9065c44259de9630e09d99e58c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FromAPILoader (LCOM4 6): FromAPILoader\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"77451a76bd071d928c1716b7abb61b82ec9b0da96fe33d718a2d2f9061cae7e3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Download (LCOM4 6): Download\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/download.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbbdb91d03e9ac2ac55bc6d3c1e627894e3f1b462ec3fd85ae4ee2ab1e1ea09"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Pkg (LCOM4 6): Pkg\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/pkg.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecb2a0627f4b28288326699f7a7aa396838f4844a286b54be285e9ff94b8baf"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Parser (LCOM4 6): Parser\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebd388c2d4cadb1eda7fa8692c1853450648576788efa269d5c28f4a10a3f28"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DependentsMessage (LCOM4 6): DependentsMessage\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dependents_message.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2467b0f62cfa3058480c0429d8be8c3b8a0340047507fbc44b75a37a1080d63d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EmbeddedPatch (LCOM4 6): EmbeddedPatch\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/embedded_patch.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd1aaecce0ee3a9be9570e0fa2f00092d9c30f8892c24720f36bfb3596c1822"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExecutablesDB (LCOM4 6): ExecutablesDB\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/executables_db.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ed2eeff7274b70e0514ebec9b1fe419c2be4f03a1c25b9023dd2297ed68188"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Sandbox (LCOM4 6): Sandbox\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/sandbox.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4659d760953f98ddf8d0c3e229b034aebcd5ee6589ff39b94e4c4f5413dd6bc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GitHubRunnerMatrix (LCOM4 6): GitHubRunnerMatrix\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/github_runner_matrix.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c4053cb75e1398e8e559c20732cd09058e7d580886ff20335974e35a039031"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Runner (LCOM4 6): Runner\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/install_steps.rb"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef431ab92002850515d96d866e09ffec3270a8c5193b293a7b50d64b7c7c66cc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LockFile (LCOM4 6): LockFile\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/lock_file.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0e6976dcf4478704c06af2296dd9dafaeac9f1d19658b16f67c6745215f893"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Messages (LCOM4 6): Messages\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/messages.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4ed0ec453b6df10d3bd73e4ac62c674579c6306214baf6ccc15dcd977f2913"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Patch (LCOM4 6): Patch\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/resource.rb"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"757f08f84eb76e796487a95e03d907074149ed6eb137e61b876c41b49c706b11"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Resource (LCOM4 6): Resource\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/resource.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c832cd80f9e7d1e5e9d5426c0039ec24ed4b8d869e20c29c05763a2fdaf0636"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RetryableDownload (LCOM4 6): RetryableDownload\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/retryable_download.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"40226bec654599d2f0146422412db4262b9f6dbb27c338606dfbb4dbf4610f0a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FormulaWrapper (LCOM4 6): FormulaWrapper\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/services/formula_wrapper.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea1022532bb29520059d16f2f43111bf2fa56820bb082346556ef048cf8aa4e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CoreTap (LCOM4 6): CoreTap\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap/core_tap.rb"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbb9d3be3a0a4a0f74dea0d9cd6d4c5b54751bbe8e58a944b6429beee1ea7ef"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PatchInclusion (LCOM4 6): PatchInclusion\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/github/patch_inclusion.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80f52525f12d075808561d92f802a9e2d45ba2e2c3bbd9e1e51a941e4ecd720"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Package (LCOM4 6): Package\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/pypi.rb"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7781842ba94131e24d7b54e1e8695a5637b8323589c9a7dd48a5249c2b5bd334"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Match (LCOM4 6): Match\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"469b48b1e263d02e4b7eba5bb34e00fd72918b9f2013ea73e30d165f8ce46540"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Audit (LCOM4 5): Audit\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1548f326e15fd97caf436e27fbec891d869aa7c5e32560881806f8d835f509"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Migrator (LCOM4 5): Migrator\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/migrator.rb"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9504b14a48632020aa5863efe4dd885fdb15d1db2f79f607f6c4fa5339d3a3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Reporter (LCOM4 5): Reporter\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/update_report/reporter.rb"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d94f9c7f80b10400ab7eb72ad0c53aa9ed71592402b53e7538293569804649"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ReporterHub (LCOM4 5): ReporterHub\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/update_report/reporter_hub.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c696f0e72dd34ecda32381825d8e0d719a25bcdcd5a211930e4ff4f1bf2139"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DownloadQueue (LCOM4 5): DownloadQueue\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/download_queue.rb"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de8b8a754c8684108859f194e11ffd6edd5e0a6ad9e0387f0e09565b1fef294"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExternalPatch (LCOM4 5): ExternalPatch\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/external_patch.rb"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc651890ffb56519d3e8a03b7aff97d2439608ac48aebe3c4b8684f06d3b7dcf"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GitHubPackages (LCOM4 5): GitHubPackages\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/github_packages.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"90da91cf7f565fbf83fde6f3b78b600ee4055ace95c875b946be1d54898fe673"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Migrator (LCOM4 5): Migrator\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/migrator.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4de9f50baaebb9a86ac19ac779a188731e8caa324f09c829858413d9af6ac7b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Mktemp (LCOM4 5): Mktemp\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/mktemp.rb"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"59acafea11f0f505b99dcf843a9acdd7bc970cbef6bea55942db1d6654882a69"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SBOM (LCOM4 5): SBOM\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/sbom.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e77f49f05b9f88b86664a5bd726ce6874ce1a4873d3766dcbd5eef4394bd631"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UnversionedCaskChecker (LCOM4 5): UnversionedCaskChecker\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unversioned_cask_checker.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e5bd633dd3d485509a356bcb99869e96b5eafa6bbf97dc0f0f8d1a279fee37"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AbstractUninstall (LCOM4 4): AbstractUninstall\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/artifact/abstract_uninstall.rb"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ba6f3b328126deb2c818cd7c887a075f21d8a98a5436d733154ef41f39f43a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CoreCaskTap (LCOM4 4): CoreCaskTap\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap/core_cask_tap.rb"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c2cd052e39e9f5a35441ac401a3df5ef0c95c458366a6e3742b01ce5672a03"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AdvisoryOverrides (LCOM4 4): AdvisoryOverrides\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/vulns/advisory_overrides.rb"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d450844622f4189e12b9a32cd915139d4e63c20c9029aa43e9333d5ee5215ce2"}},{"ruleId":"D13","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":"faeeaa17e49b6c0e603ce123bca02439a13fd0bb433402752309357c3519a205"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cmd/info.rb: Library/Homebrew/cmd/info.rb changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in Info.info_formula at line 307. 2 of those changes were fix/bug commits, and the other 32 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cmd/info.rb\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":"Library/Homebrew/cmd/info.rb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75be6f111bb9b151df2374f1d9b8c64f6fb549e189507cc05b15406ac36d2c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cask/audit.rb: Library/Homebrew/cask/audit.rb changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in Audit.audit_signing at line 629. 2 of those changes were fix/bug commits, and the other 34 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cask/audit.rb\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":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e93c39b7356adb351726e802473e078d03e6280fa876460e6a5d9b55330481"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/advisory-match.rb: Library/Homebrew/dev-cmd/advisory-match.rb changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in AdvisoryMatch.run at line 74. 3 of those changes were fix/bug commits, and the other 21 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/advisory-match.rb\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":"Library/Homebrew/dev-cmd/advisory-match.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faa67d1630510902a4ca6ede0ad83fa2efe8e8192e41a9d235d072e46d5aa7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/bump-formula-pr.rb: Library/Homebrew/dev-cmd/bump-formula-pr.rb changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in BumpFormulaPr.run at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/bump-formula-pr.rb\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":"Library/Homebrew/dev-cmd/bump-formula-pr.rb"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bf82d5f2dc2d4c8b616b25de5ce097a4fe60c05b1c9d471f0f893448babb22"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/bump.rb: Library/Homebrew/dev-cmd/bump.rb changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in Bump.retrieve_versions_by_arch at line 221. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/bump.rb\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":"Library/Homebrew/dev-cmd/bump.rb"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37786c0404b7c1f61dca55dc548af3601df409a45cfb790839e758477d57ed4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/formula.rb: Library/Homebrew/formula.rb changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Formula.eligible_kegs_for_cleanup at line 3851. 2 of those changes were fix/bug commits, and the other 70 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/formula.rb\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":"Library/Homebrew/formula.rb"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"775c5a0b70f438016576058a0da2be5d9ffc9006811216400313089041897abe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/formula_installer.rb: Library/Homebrew/formula_installer.rb changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in FormulaInstaller.finish at line 1070. 1 of those changes was a fix/bug commit, and the other 45 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/formula_installer.rb\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":"Library/Homebrew/formula_installer.rb"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19fc7ba7223761f0f746791f0765232d333615a6a1cc7c86af741c29d86e899"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/formula_auditor.rb: Library/Homebrew/formula_auditor.rb changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in FormulaAuditor.audit_specs at line 884. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/formula_auditor.rb\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":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3631d9496baeae2ec1cb0f279a631d7bd69572a233f15346fe865212c4c39f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/tap.rb: Library/Homebrew/tap.rb changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in Tap.install at line 675. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/tap.rb\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":"Library/Homebrew/tap.rb"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a821aaee4d9c1b54d08bcf9d4707088a88444c65f38d81261b3d75e2f8a89a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/install_steps.rb: Library/Homebrew/install_steps.rb changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in Runner.run_install_step at line 1002. 1 of those changes was a fix/bug commit, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/install_steps.rb\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":"Library/Homebrew/install_steps.rb"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb07588ede4abec07f10fd415bf746e245175a70a0dce09460808f13477d558"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cmd/update-report.rb: Library/Homebrew/cmd/update-report.rb changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in UpdateReport.output_update_report at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cmd/update-report.rb\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":"Library/Homebrew/cmd/update-report.rb"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c3ba41a5f2a3c1dc1040a3209146ca9e25ad72419a70918c6d59ae45063588"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/bottle.rb: Library/Homebrew/dev-cmd/bottle.rb changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in Bottle.bottle_formula at line 427. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/bottle.rb\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":"Library/Homebrew/dev-cmd/bottle.rb"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91e72897044c55e612c18f5c9e958e59a1a4fed0394d2ac72d009623d94674f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/contributions.rb: Library/Homebrew/dev-cmd/contributions.rb changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in Contributions.run at line 126. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/contributions.rb\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":"Library/Homebrew/dev-cmd/contributions.rb"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eaa77e1d22e5fb3cc1dcbbfa6404edca18dbed00ad5ed5f7f2279b8fb7ef3e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cleanup.rb: Library/Homebrew/cleanup.rb changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Cleanup.stale_formula? at line 167. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cleanup.rb\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":"Library/Homebrew/cleanup.rb"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e8b68a6c9624bd5fcfe63c1f94fefa02d6848d39d50413b1001bf87e749721"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cmd/install.rb: Library/Homebrew/cmd/install.rb changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in InstallCmd.run at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cmd/install.rb\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":"Library/Homebrew/cmd/install.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b83e42dea61b5cd39e299947fba82f0626b44cd495ea6be7b78e5b043cb862"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/livecheck/livecheck.rb: Library/Homebrew/livecheck/livecheck.rb changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 112 in Livecheck.latest_version at line 634. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/livecheck/livecheck.rb\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":"Library/Homebrew/livecheck/livecheck.rb"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"2156198721de596f00e9dc85871d2e06858f8f70f3c9a851e18aa4a3bebad1c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/utils/curl.rb: Library/Homebrew/utils/curl.rb changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in Curl.curl_check_http_content at line 590. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/utils/curl.rb\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":"Library/Homebrew/utils/curl.rb"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7f35c68ba72fc50c5be31357443c5423f19a704c0ce203f2928855d54e3032"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cmd/upgrade.rb: Library/Homebrew/cmd/upgrade.rb changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in UpgradeCmd.run at line 186. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cmd/upgrade.rb\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":"Library/Homebrew/cmd/upgrade.rb"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fe334fa2bccfb6023ea6b4d60e193e03013861958c703f7952163141add1e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cask/upgrade.rb: Library/Homebrew/cask/upgrade.rb changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Upgrade.upgrade_casks! at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cask/upgrade.rb\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":"Library/Homebrew/cask/upgrade.rb"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"de817627532298e83b6108fea2a5495cb8199a9088fa78b9f3e5d59992390b30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/utils/pypi.rb: Library/Homebrew/utils/pypi.rb changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in PyPI.update_python_resources! at line 250. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/utils/pypi.rb\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":"Library/Homebrew/utils/pypi.rb"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0158f99d4607752f86c913994d66b32b22e4a321b6728977a15ba4baad09b099"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/audit.rb: Library/Homebrew/dev-cmd/audit.rb changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in Audit.run at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/audit.rb\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":"Library/Homebrew/dev-cmd/audit.rb"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b170c782f848f9fd9eb1ce701416e744d28e22aab4d87208cc1b81a812c782"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/rubocops/lines.rb: Library/Homebrew/rubocops/lines.rb changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in Miscellaneous.audit_formula at line 954. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/rubocops/lines.rb\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":"Library/Homebrew/rubocops/lines.rb"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7d82cfd9ff4f008a9cea7fcf0f702414a452e7f6c07720fd16a6fded995f4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/keg.rb: Library/Homebrew/keg.rb changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Keg.link_dir at line 936. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/keg.rb\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":"Library/Homebrew/keg.rb"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b60c852c47b0cb303f172c481e195178a5e882482e43e90ad3f88103d439dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/vulns/match.rb: Library/Homebrew/vulns/match.rb changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Match.reconcile_history at line 968. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/vulns/match.rb\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":"Library/Homebrew/vulns/match.rb"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c65480606c1ff638ee14c8cebd95e4ebcfe53512facb1516a5c786bea4b747"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/formulary.rb: Library/Homebrew/formulary.rb changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Formulary.load_formula_from_struct! at line 236. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/formulary.rb\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":"Library/Homebrew/formulary.rb"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2084b6143e089fff5d33c58e915524d43867c3a455e5d8100b617dd46a3d8765"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/services/cli.rb: Library/Homebrew/services/cli.rb changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Cli.stop at line 230. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/services/cli.rb\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":"Library/Homebrew/services/cli.rb"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad1209db7aac92c63c11e6b22ea67b76893d360755c3934847b9a2344ef3b93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cli/named_args.rb: Library/Homebrew/cli/named_args.rb changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in NamedArgs.load_formula_or_cask at line 342. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cli/named_args.rb\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":"Library/Homebrew/cli/named_args.rb"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8b98229a6eef7a6f804aabd39b4ab762074b6175ebb343c628f7c0687619aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/tests.rb: Library/Homebrew/dev-cmd/tests.rb changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in Tests.run at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/tests.rb\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":"Library/Homebrew/dev-cmd/tests.rb"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc95e8fcd15a5b66efafc1401efd8303d6119d6717027f9e91fefb343e7d15d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/formula_creator.rb: Library/Homebrew/formula_creator.rb changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in FormulaCreator.initialize at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/formula_creator.rb\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":"Library/Homebrew/formula_creator.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f2fdbf88a3ad2a4a0e600eff15321e0f763879ddb0b58bfe7a4cc68cb3fd0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cmd/list.rb: Library/Homebrew/cmd/list.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in List.run at line 95. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cmd/list.rb\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":"Library/Homebrew/cmd/list.rb"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"107de094753c67e5ba3042dd438c075577c351aaf15e8308decac7ee51084ddf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cask/installer.rb: Library/Homebrew/cask/installer.rb changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Installer.load_installed_caskfile! at line 1027. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cask/installer.rb\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":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0ca750f13b58153927ac05873e7226e6c6a9d57827a830d991e5a6d11af5ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/api.rb: Library/Homebrew/api.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in API.fetch_json_api_file at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/api.rb\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":"Library/Homebrew/api.rb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97d18dd567a03d93e6ef6abf388db03dc285cf5a810a6b3515d9de0daaf658e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/keg_relocate.rb: Library/Homebrew/keg_relocate.rb changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Keg.relocate_build_prefix at line 325. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/keg_relocate.rb\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":"Library/Homebrew/keg_relocate.rb"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd406e82aa5ca1015cc6793eb57934265ad3026c251947774b69dc310cb85274"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cask/cask.rb: Library/Homebrew/cask/cask.rb changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Cask.auto_updates_bundle_outdated? at line 884. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cask/cask.rb\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":"Library/Homebrew/cask/cask.rb"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41a0e23c356fffad360fe318bf6784e7dad6abb7331974f4b364b6cba2c302c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/bump-cask-pr.rb: Library/Homebrew/dev-cmd/bump-cask-pr.rb changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in BumpCaskPr.replace_version_and_checksum at line 294. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/bump-cask-pr.rb\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":"Library/Homebrew/dev-cmd/bump-cask-pr.rb"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"149b1b5b43f0adf74402a92ca156dffc869f13d298cd809fa666bc88b9868989"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/download_queue.rb: Library/Homebrew/download_queue.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in DownloadQueue.fetch at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/download_queue.rb\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":"Library/Homebrew/download_queue.rb"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e88ca9c4aff2d66af5db0b7b4f4ec46dc7071b09298a84b7787b1d1afb747ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/pr-pull.rb: Library/Homebrew/dev-cmd/pr-pull.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in PrPull.run at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/pr-pull.rb\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":"Library/Homebrew/dev-cmd/pr-pull.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9f25477ba254b08984a23584bc92c7150842e3fbc7d178e152991229cb294d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/vulns/osv_export.rb: Library/Homebrew/vulns/osv_export.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in OsvExport.merge_range_transitions at line 251. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/vulns/osv_export.rb\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":"Library/Homebrew/vulns/osv_export.rb"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcdede3702259bde03660cf65e2a7e1035954e7c749b8a7c103ceff29071d57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cask/caskroom.rb: Library/Homebrew/cask/caskroom.rb changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Caskroom.migrate_caskfile_to_json 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 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cask/caskroom.rb\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":"Library/Homebrew/cask/caskroom.rb"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf41e6713f3bb31971f3b8a09d6734af55a7935fd619d08084bb52a2c6a0f02a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/download_strategy/git_download_strategy.rb: Library/Homebrew/download_strategy/git_download_strategy.rb changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in GitDownloadStrategy.env at line 123. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/download_strategy/git_download_strategy.rb\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":"Library/Homebrew/download_strategy/git_download_strategy.rb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec96f98c71288edf082e97ebe91f96816020057988983805258909222ffd71a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cask/cask_loader.rb: Library/Homebrew/cask/cask_loader.rb changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in FromAPILoader.load_from_struct at line 386. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cask/cask_loader.rb\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":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1a43f2598f659c2f7a4925127849da08f488a1acb38384d71649f750d08461"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cli/parser.rb: Library/Homebrew/cli/parser.rb changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Parser.parse at line 462. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cli/parser.rb\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":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b762ce37123864ed15412a7b9b5706bb6d34a218f4c48d11481e64425c7cc2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/utils/fork.rb: Library/Homebrew/utils/fork.rb changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Utils.safe_fork at line 145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/utils/fork.rb\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":"Library/Homebrew/utils/fork.rb"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4979e00e336e06c5ce1c0eda81db2c5708150671325e6a2fa599edd328404c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/upgrade.rb: Library/Homebrew/upgrade.rb changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Upgrade.upgrade_dependents at line 319. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/upgrade.rb\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":"Library/Homebrew/upgrade.rb"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce482856644843d1b98d4f5d062b16444228eac317fec8fc3679a78661985f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/bundle/installer.rb: Library/Homebrew/bundle/installer.rb changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Installer.homebrew_batchable? at line 248. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/bundle/installer.rb\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":"Library/Homebrew/bundle/installer.rb"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52f7510c9d9dab0580aa8ef97e1c3799723b040e36173475c3ecf8c9de4d4df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cask/artifact/app.rb: Library/Homebrew/cask/artifact/app.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in App.install_phase at line 23. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cask/artifact/app.rb\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":"Library/Homebrew/cask/artifact/app.rb"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"670dbc72c3d1981a8ef92aa5f65c52ac827d5869e0308cad790935ee58923e99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cmd/uninstall.rb: Library/Homebrew/cmd/uninstall.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in UninstallCmd.run at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cmd/uninstall.rb\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":"Library/Homebrew/cmd/uninstall.rb"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed99283dfe4503293fb7b32152c073d9a1e794beb9a925f5624d300e06e09393"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/utils/shared_audits.rb: Library/Homebrew/utils/shared_audits.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in SharedAudits.new_domain_problem at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/utils/shared_audits.rb\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":"Library/Homebrew/utils/shared_audits.rb"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"872874c1614321fc7c74bb7dce28765f7fb584cca6f36e700b1cc908223fb640"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/generate-cask-ci-matrix.rb: Library/Homebrew/dev-cmd/generate-cask-ci-matrix.rb changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in GenerateCaskCiMatrix.generate_matrix at line 220. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/generate-cask-ci-matrix.rb\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":"Library/Homebrew/dev-cmd/generate-cask-ci-matrix.rb"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c270648158655556c2f66fb38e0ce370ebb916fc3d8e583823d7f45ddb159bda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cmd/update_report/reporter.rb: Library/Homebrew/cmd/update_report/reporter.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Reporter.migrate_tap_migration at line 224. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cmd/update_report/reporter.rb\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":"Library/Homebrew/cmd/update_report/reporter.rb"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd73b7a66b28a8a07abc5d018b90ca7c196f9b16d1896bd3699a8417deecf02d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/download_strategy/curl_download_strategy.rb: Library/Homebrew/download_strategy/curl_download_strategy.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in CurlDownloadStrategy.fetch at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/download_strategy/curl_download_strategy.rb\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":"Library/Homebrew/download_strategy/curl_download_strategy.rb"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1165fe512033a43f043a20471e0555737e2ca9677f7b7ceede7de3d470026fac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cmd/reinstall.rb: Library/Homebrew/cmd/reinstall.rb changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Reinstall.run at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cmd/reinstall.rb\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":"Library/Homebrew/cmd/reinstall.rb"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"400c82b4f54f9a8624ba95294dde486938921a0a77e5d417e706cc1aecadd8d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/attestation.rb: Library/Homebrew/attestation.rb changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Attestation.check_attestation at line 222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/attestation.rb\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":"Library/Homebrew/attestation.rb"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f53be0bf0ce4f2f8a769eef9cb3a080e2024fe7e41603e49f61a9a4e8ada50b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/extract.rb: Library/Homebrew/dev-cmd/extract.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Extract.run at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/extract.rb\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":"Library/Homebrew/dev-cmd/extract.rb"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80054afbc74a0a81545023153d1e398dfd4b055fab00dfdb09457482916d054"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cmd/fetch.rb: Library/Homebrew/cmd/fetch.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in FetchCmd.run at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cmd/fetch.rb\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":"Library/Homebrew/cmd/fetch.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ee2151d69a11583a2c17df8c0ccfdac08d1bd53ec50c7b3043547dcc943f2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/system_command.rb: Library/Homebrew/system_command.rb changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SystemCommand.each_output_line at line 449. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/system_command.rb\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":"Library/Homebrew/system_command.rb"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f60080c0edc3d096eb38697f76870bad584e27b6edc166999fd6b21e194cc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/livecheck.rb: Library/Homebrew/dev-cmd/livecheck.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in LivecheckCmd.run at line 59. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/livecheck.rb\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":"Library/Homebrew/dev-cmd/livecheck.rb"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4460f7700210a53b0b24349871f963a6ab8ddf69b147e7079eb4bf5e9102b83a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/style.rb: Library/Homebrew/style.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Style.check_style_impl at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/style.rb\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":"Library/Homebrew/style.rb"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab574a6533b36f4319b5e450d68251be22c2bdd5566e845ede6eea86f0b7e9de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/test.rb: Library/Homebrew/dev-cmd/test.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Test.run at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/test.rb\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":"Library/Homebrew/dev-cmd/test.rb"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d98cd00802e8ef745025fb1c4c41f7ee3dd973ac0d3beb607983bf6cfc088b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/utils/output.rb: Library/Homebrew/utils/output.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Mixin.odeprecated at line 189. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/utils/output.rb\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":"Library/Homebrew/utils/output.rb"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"329802900250f7ed57d5164c71fa84e7157ca28b4ea57e3d00b99274185ccab5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/bundle/cask.rb: Library/Homebrew/bundle/cask.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Cask.install! at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/bundle/cask.rb\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":"Library/Homebrew/bundle/cask.rb"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"17005bcaa0ae6342619c654bc4e5274c9dfc09617c77d561bf73adc388cd8e2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/create.rb: Library/Homebrew/dev-cmd/create.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Create.create_formula at line 228. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/create.rb\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":"Library/Homebrew/dev-cmd/create.rb"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1a6ef0d0f77f81a5b859c63313baa47eeee84b0b91d78fd862af74151c966"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/vulns/history.rb: Library/Homebrew/vulns/history.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in History.walk at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/vulns/history.rb\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":"Library/Homebrew/vulns/history.rb"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ec143b0061d327cc3b449498fb74425200a245ec6fd31189761c06df90cd99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/release.rb: Library/Homebrew/dev-cmd/release.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in Release.run at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/release.rb\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":"Library/Homebrew/dev-cmd/release.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4645ec7fce01aff0b70db1bbcbce7d3c527fe890bc51fe9bd6f51d902083dbe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/rubocops/shared/url_helper.rb: Library/Homebrew/rubocops/shared/url_helper.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in UrlHelper.audit_url at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/rubocops/shared/url_helper.rb\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":"Library/Homebrew/rubocops/shared/url_helper.rb"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d3d22185a97ee1011bc8a3a91dad93d340e2fdab5df3d841e225ad2c257a5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cmd/link.rb: Library/Homebrew/cmd/link.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Link.run at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cmd/link.rb\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":"Library/Homebrew/cmd/link.rb"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08588553217de148cc9a1b0606447593e505555b19f247be7b85313eb22ff5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/utils/analytics/influx.rb: Library/Homebrew/utils/analytics/influx.rb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in Influx.query at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/utils/analytics/influx.rb\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":"Library/Homebrew/utils/analytics/influx.rb"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"167b9a84d7dc1c138bfe8f4a726bd1c17f3317d1b04248b9d212462af0e567bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/vulns/vulnerability.rb: Library/Homebrew/vulns/vulnerability.rb changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Vulnerability.range_status_for_entries at line 184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/vulns/vulnerability.rb\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":"Library/Homebrew/vulns/vulnerability.rb"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9eb03294f54d69a56d2a062019fcd648a46442119a4d1de199487fc2755f75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/utils/github/api.rb: Library/Homebrew/utils/github/api.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in API.open_rest at line 299. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/utils/github/api.rb\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":"Library/Homebrew/utils/github/api.rb"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f851107b21a99addf7dfb2dddadc4c926d8b28474892557d6cf3d2ce5619313d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cask/artifact/moved.rb: Library/Homebrew/cask/artifact/moved.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Moved.move at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cask/artifact/moved.rb\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":"Library/Homebrew/cask/artifact/moved.rb"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6379d3b9effdb9278bf1f561bfe30d60b9478bba22f559252eba14d483fd09b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/build.rb: Library/Homebrew/build.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Build.install at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/build.rb\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":"Library/Homebrew/build.rb"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e79ca7f76aa639ade28a9c33fdd4a921885b8d06af9bb6d4376ea7f2977f611"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/livecheck.rb: Library/Homebrew/livecheck.rb changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Livecheck.url at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/livecheck.rb\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":"Library/Homebrew/livecheck.rb"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8d886897caded9a67194e62c2fcfdef55cdef93a50e98f409316c6d3ef3dfe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/install/check.rb: Library/Homebrew/install/check.rb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in Install.install_formula? at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/install/check.rb\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":"Library/Homebrew/install/check.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fe1931438471788277072a30764a9757d8716e62c6780a79d0196a19bedff9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/linkage_checker.rb: Library/Homebrew/linkage_checker.rb changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in LinkageChecker.check_formula_deps at line 254. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/linkage_checker.rb\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":"Library/Homebrew/linkage_checker.rb"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3113e36895d5ffe637518bbe224574ed562f27d1f906d68882a5d67695d441"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/bundle/subcommand/cleanup.rb: Library/Homebrew/bundle/subcommand/cleanup.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in CleanupSubcommand.cleanup at line 123. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/bundle/subcommand/cleanup.rb\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":"Library/Homebrew/bundle/subcommand/cleanup.rb"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcde2a5e05149d34e06991bd26bb145a432e6cbed7d788d87bf15e96124f2e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/typecheck.rb: Library/Homebrew/dev-cmd/typecheck.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Typecheck.run at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/typecheck.rb\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":"Library/Homebrew/dev-cmd/typecheck.rb"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbafe1591bf5493fb7d6f09c24665bd78e872e889f73425743b5acd69e226f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/lgtm.rb: Library/Homebrew/dev-cmd/lgtm.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Lgtm.run at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/lgtm.rb\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":"Library/Homebrew/dev-cmd/lgtm.rb"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9e13cbbc409a926ebbb9eea259404a10fcb061a74934187de277567610dc94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/formula_cellar_checks.rb: Library/Homebrew/formula_cellar_checks.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in FormulaCellarChecks.check_binary_arches at line 370. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/formula_cellar_checks.rb\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":"Library/Homebrew/formula_cellar_checks.rb"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"04de5609b3d1bcf686efa7e0cfd8890b15e26f3a061fbc52e8aa89ddea91f708"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/rubocops/cask/on_system_conditionals.rb: Library/Homebrew/rubocops/cask/on_system_conditionals.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in OnSystemConditionals.audit_identical_sha256_across_architectures at line 389. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/rubocops/cask/on_system_conditionals.rb\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":"Library/Homebrew/rubocops/cask/on_system_conditionals.rb"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7d86f50c30a4ec61e37c181409b227f960be46ff26238604416fd2d9ca7b44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/extend/os/linux/sandbox/landlock.rb: Library/Homebrew/extend/os/linux/sandbox/landlock.rb changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Landlock.apply! at line 304. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/extend/os/linux/sandbox/landlock.rb\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":"Library/Homebrew/extend/os/linux/sandbox/landlock.rb"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc17d97b0ec813daff281deaa454729ac530b3f2a5d9cd10c8bcab7df02c6775"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/uninstall.rb: Library/Homebrew/uninstall.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Uninstall.uninstall_kegs at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/uninstall.rb\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":"Library/Homebrew/uninstall.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5413129d7b6bbf0b1b8722f31c6f6d1ea2375fafa53910504a24c4db784009"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cmd/version-install.rb: Library/Homebrew/cmd/version-install.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in VersionInstall.run at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cmd/version-install.rb\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":"Library/Homebrew/cmd/version-install.rb"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"245933dbe29cc6404e5bffad61b3336bc076b091a54c8e9bc7a719e09be1fbf1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/vulns/advisory_overrides.rb: Library/Homebrew/vulns/advisory_overrides.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in AdvisoryOverrides.initialize at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/vulns/advisory_overrides.rb\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":"Library/Homebrew/vulns/advisory_overrides.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7078b8af091c3285bd8f24948f3afea460d4a458632f5cc8d94d3670cf217de6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cmd/untap.rb: Library/Homebrew/cmd/untap.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Untap.run at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cmd/untap.rb\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":"Library/Homebrew/cmd/untap.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"691c8bf84c04ad250fc741175e599242e2c3e9e9ce7419afaa494395ac642e65"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/rubocops/class.rb: Library/Homebrew/rubocops/class.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in TestResource.audit_formula at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/rubocops/class.rb\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":"Library/Homebrew/rubocops/class.rb"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7afdbb591813442e364525561e4cdc4e217f32726047119913d413f8dcfc69d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/vulns/identify.rb: Library/Homebrew/vulns/identify.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Identify.registry_purl at line 197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/vulns/identify.rb\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":"Library/Homebrew/vulns/identify.rb"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"2238c6978e26614f20a93b9b24564699497813abeaa2acac65cee630147319c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/installed_dependents.rb: Library/Homebrew/installed_dependents.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in InstalledDependents.find_some_installed_dependents at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/installed_dependents.rb\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":"Library/Homebrew/installed_dependents.rb"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"429a2f60633d07456cce247d749ecc51ff212a78c2800514546bc3e0aa371592"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/utils/gem_setup.rb: Library/Homebrew/utils/gem_setup.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in GemSetup.install_bundler_gems! at line 197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/utils/gem_setup.rb\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":"Library/Homebrew/utils/gem_setup.rb"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5b42781b9abe966c2c28fc1a48f696cedcc11cd8bd535c2664e03b8d4d92c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/cask/artifact/appimage.rb: Library/Homebrew/cask/artifact/appimage.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in AppImage.install_phase at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/cask/artifact/appimage.rb\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":"Library/Homebrew/cask/artifact/appimage.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a06fc2dc3d6dfd66a6e60964f5f4866936a3cda28b724c188db516d9a35c7ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/pr-upload.rb: Library/Homebrew/dev-cmd/pr-upload.rb changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in PrUpload.run at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/pr-upload.rb\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":"Library/Homebrew/dev-cmd/pr-upload.rb"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca9ca0dc8cabbe1162cb5b7bb1e07bf7b3f64e1808f0b30cb2281c7171ed54d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .github/scripts/approve_stale_lead_maintainer_prs.rb: .github/scripts/approve_stale_lead_maintainer_prs.rb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in StaleLeadMaintainerPrApproval.finish at line 375. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- .github/scripts/approve_stale_lead_maintainer_prs.rb\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":".github/scripts/approve_stale_lead_maintainer_prs.rb"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"23857e380bc85c99b5316e304fb108748e07be9b33c5e9a02c5f69df581f89ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/rubocops/patches.rb: Library/Homebrew/rubocops/patches.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Patches.patch_problems at line 58. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/rubocops/patches.rb\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":"Library/Homebrew/rubocops/patches.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"350ab6991f0a2dccd43f2aa22ff32603dbe873fe9e800570c7723cb81a31edfd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/rubocops/shared/desc_helper.rb: Library/Homebrew/rubocops/shared/desc_helper.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DescHelper.audit_desc at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/rubocops/shared/desc_helper.rb\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":"Library/Homebrew/rubocops/shared/desc_helper.rb"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadf0a2f260896dad850816da3ec968bdcbd397585f427230a189f6effe6e727"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/dev-cmd/which-update.rb: Library/Homebrew/dev-cmd/which-update.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in WhichUpdate.update_and_save! at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/dev-cmd/which-update.rb\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":"Library/Homebrew/dev-cmd/which-update.rb"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4810bf17e21aa0577b417653a4404e7f6a990b445516d62f79207c37da5a44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/utils/popen.rb: Library/Homebrew/utils/popen.rb changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Utils.popen at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/utils/popen.rb\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":"Library/Homebrew/utils/popen.rb"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2998aa20eb86bf2185a4b1ddeedfa043aad7d8246dda2089bf62978be645c60e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/rubocops/cask/no_overrides.rb: Library/Homebrew/rubocops/cask/no_overrides.rb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in NoOverrides.on_system_stanzas at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/rubocops/cask/no_overrides.rb\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":"Library/Homebrew/rubocops/cask/no_overrides.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae88281da78e0e62653a44a35a59dee3c37db4f53b1efc2400cc96cc2600f1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Library/Homebrew/unversioned_cask_checker.rb: Library/Homebrew/unversioned_cask_checker.rb changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in UnversionedCaskChecker.guess_cask_version at line 184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 01:18:58 \u002B00:00\u0027 --until=\u00272026-11-14 01:18:58 \u002B00:00\u0027 --full-history --no-merges -- Library/Homebrew/unversioned_cask_checker.rb\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":"Library/Homebrew/unversioned_cask_checker.rb"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d930d6159142f156c44ec1e43fafaf4e99ca4db669014d2a93dae666db6372"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 23 significant file(s) lose their only recent owner: Library/Homebrew/rubocops/shared/install_steps_helper.rb, Library/Homebrew/rubocops/install_steps.rb, Library/Homebrew/dev-cmd/release.rb, Library/Homebrew/rubocops/cask/install_steps.rb, Library/Homebrew/install/check.rb, Library/Homebrew/utils/phase_timings.rb, Library/Homebrew/bundle/subcommand/dump.rb, Library/Homebrew/download_strategy/vcs_download_strategy.rb (\u002B15 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f715b961f3e37cd4947f5a149ca282120a51bb4a439bffadef3cfd9c6bce45a0"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: Library/Homebrew/vulns/repology.rb, Library/Homebrew/vulns/cpan_sec.rb, Library/Homebrew/vulns/cvss.rb, Library/Homebrew/vulns/purl.rb. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2efdbaaedd049c60a196860295b6b19aee75576296a4855b07513f174aea1d39"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 4 significant file(s) lose their only recent owner: Library/Homebrew/vulns/advisory_overrides.rb, Library/Homebrew/vulns/history.rb, Library/Homebrew/rubocops/cask/no_nested_os_dependency.rb, Library/Homebrew/dev-cmd/generate-bottle-ci-matrix.rb. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"17e36416a9bb96f08927ba399fd7f3a4752a7a49c31df2ccc2e29e32d4a0c220"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 7 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (39 single-owned of 508 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 508 of the 1030 production source files in this repository met that bar). They are anonymized user #4 (2 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (1 file(s)), anonymized user #9 (1 file(s)) (\u002B1 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: Library/Homebrew/rubocops/shared/homepage_helper.rb, Library/Homebrew/dependencies_helpers.rb, Library/Homebrew/livecheck/options.rb, Library/Homebrew/cask/appcast.rb, Library/Homebrew/semver.rb, Library/Homebrew/utils/github/patch_inclusion.rb, Library/Homebrew/cask/metadata.rb, Library/Homebrew/rubocops/cask/conditional_arguments_order.rb."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Work out a sensible way to clean up \u0060pip\u0060\u0027s, \u0060setuptools\u0060\u0027 and \u0060wheel\u0060\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cleanup.rb"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fd795760ec31db2d1ec94798621a07fecb0bf11289d3369b797b9b82dbe86e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this once it\u0027s no longer in the default GitHub Actions image \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/diagnostic.rb"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f43a905b8783ff6f47e0ce5ca7afe3a7ae639e3faf25c1e6f6765881dcfa34d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: This should not actually take a block. All resources should be defined \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula.rb"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"c386f8b9b09b4939fb4213e817bef386105383b2a1ae5b823e629d34ff407c69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: replace legacy \u0060replacement\u0060 with \u0060replacement_formula\u0060 or \u0060replacement_cask\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula.rb"},"region":{"startLine":5297}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ed82f3dfbff274f3efdbe1589c4347832e4dea5085e8210b849121b2304e48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: #  TODO: replace legacy \u0060replacement\u0060 with \u0060replacement_formula\u0060 or \u0060replacement_cask\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula.rb"},"region":{"startLine":5408}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b6eeac0d33efd3afcdcfececa4e14915242b39f8db45d388b735a3ad94e662"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this and check these there too. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formula_auditor.rb"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2eac8ec30a46813be57c146c0963391465e92b338e475355b4636c4be653da5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Remove the need to do this here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formulary.rb"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"563c235cbfb6aaae7f1eb9bdb90a685aaedb2db40687ff48066f0a5cd9f74744"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Remove the need to split the name and instead make \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/formulary.rb"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe4d64595cb2702e2572a9a0283fa6de735157d2a056155def83666aab12fd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: upload/add tag_hash[\u0022all_files\u0022] somewhere. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/github_packages.rb"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3622493cd8620fa31bda94cb83a966840eb6914c6fece69dc0560849c867b17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: -mcpu=apple-m1 when we\u0027ve patched all our GCCs to support it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/hardware.rb"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cf8ab76d2d4c0918d9d772d533b43648a6db4201991591adc9a8fff6be36da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Report linkage with \u0060/usr/lib/libc\u002B\u002B.1.dylib\u0060 when this link is broken. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/linkage_checker.rb"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b41ed44e45d33b95ff98e268d6188f1f5175f48d0d8d08505f24217fab59845"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX If the satisfy block returns a Pathname, then make sure that it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/requirement.rb"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d54f83dd70486c5510260665796ccc13808ae1762cfd131196cf09ca8b27ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: try remove the OS/env conditional \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/resource_auditor.rb"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc98dad14523eba41a1ef9d3edaec99041c012315beb5e64cc772a7e057e667e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this code when all users are running on versions of Homebrew \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/service.rb"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"970cc00338df95bb33fed452ffa14fe7703bc22f525de30d0f0551c2ea72e978"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this should be refactored to use FormulaInstaller new logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/upgrade.rb"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c43dd5642c323871499e323331160604c2c6206ab13348ba31f9a74ffa028d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: \u0060utils/shared_audits\u0060 requires this file in turn. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/utils/curl.rb"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e3ac98e03c3ca8c112999a62ff948328ab56e563a658e4d2ab8688005cc7ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Try generalising this by sorting dependents according to install size, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test_bot/formulae_dependents.rb"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5fb4b62083a34827d0286a6b5ec08e0fd585a3890918f5233e50946ad396fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Consider handling the following case better. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test_bot/formulae_dependents.rb"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8cc9a46adf5153d6d56530f7050cb37e0e73d12bda7909b9747d00d2f16592"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove \u0060GITHUB_EVENT_NAME\u0060 check when formulae detection \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test_bot/formulae_detect.rb"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb4bdf4cfffc479b0049ccb12ddf5e2a129e776aa813080caa8db619d210258"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: consider in future if we want to allow unsupported taps here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test_bot/tap_syntax.rb"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e519287ad6bc221513955652cc078e729db765626f4f708c1ef567b7152ee8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: re-enable this test if it can be made to take ~ 1 second or there\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/completions_spec.rb"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94d57c40100e182ece85b10f4137859d91491c178e02fbbe4af8dfd2593f35a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/formulary_spec.rb"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c3d741cd12fe5676c47a7f9228c4609753c200d5cff44a18ebac7d8667cb9b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/formulary_spec.rb"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"92deeea56a7649670078c4750455899ef956e8b2973e798d486e1df953ebc4cf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/cask/cask_loader_spec.rb"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9efcb5c47ea8fb444fae7a5c25fe53e03099c3319f9164d2546e2b193fd1232"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/cask/cask_loader_spec.rb"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ce39d821105e8030624f7af28793a9b9675bb752ad095e8cf223ec9fc1de6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Make the Incapsula test data more realistic once we can find an \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/utils/curl_spec.rb"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9e8ff5676220bb6f29f439d006d0d36411599062c253355100804505956e67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: consider reporting an offense for some of these, e.g. :postgresql \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/rubocops/uses_from_macos_spec.rb"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"73417b5ebd4c18446ed76235bca5efaa80f1d961d7ccc77ca59ba47ff6dab5da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: uncomment this when GitHub Actions has completed their macOS-26-arm64 expat 2.7.4 rollout \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/os/mac/pkgconfig_spec.rb"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f09b1cbd7a4291968fbda830205495b65e3da24daee505977feaddb153dee6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this line when removing the user agent fallback logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/livecheck/strategy_spec.rb"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7290b42cf0646931ad6bedb70074288d44259f8c5ca726385ff92f180b032553"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this line when removing the user agent fallback logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/livecheck/strategy_spec.rb"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cc1e3aad581b715df6930856013207b8fe828288e7696239e53936509f537e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this line when removing the user agent fallback logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/livecheck/strategy_spec.rb"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9c0dab6e0a86585499c72bfd48b764843b303116ed23539bfbdd7c227fca9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this block when removing the user agent fallback logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/livecheck/strategy_spec.rb"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"662cda3efd032bccf37074894f09cbdd3dbe260396f96f0e9f5b16725d650bd6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this block when removing the user agent fallback logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/livecheck/strategy_spec.rb"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf32d4a8bc69a0741523e2485d3161049cec2672875bbb79f52fd2565b4e35f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this block when removing the user agent fallback logic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/livecheck/strategy_spec.rb"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bfbb41257ee7eb2801265e66bee07f138f07c8f8ae4e3d823581ae3224d1be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Should we be comparing against an actual REXML::Document object? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/livecheck/strategy/xml_spec.rb"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc25952091633c9cd6758280f09343127b0b76d9174622350bed38afae92bd15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add deduplication tests e.g. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/dev-cmd/bottle_spec.rb"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f69f68a44ab67f855d585f5cce23ee3637c233e226e446c22573edd4cd3e0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: newer Ruby only supports history saving in interactive sessions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/dev-cmd/irb_spec.rb"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"39160e0fe3709e5fb7354d34f1931eb906d7b160e7ae4cdfd73773e830d2a653"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: Why doesn\u0027t this work? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/cmd/bundle/remove_subcommand_spec.rb"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a583067bef6a60c16b463c3c6a04771eeb93815a8227ad7f4039221ced1cf7db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this test should be named after the corresponding class, once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/test/cask/depends_on_spec.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94d3ef74936b607c6c83c61b6b36062b200ae946224fb575f6b29017fa30ff9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove the deprecated/disabled check after homebrew/core has no more \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/urls.rb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba5d8ac9a2ffc5d2362616936bc0d9f02add4b979ee5df57943ea0f5d3193c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: consider making some of these keg-only. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/uses_from_macos.rb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebc59c58887b82da1bd9ab5bb07e578ed13b4042dfaa71dbc5711d0bee96268"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: could fix corrector to handle this but punting for now. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/shared/on_system_conditionals_helper.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dd3de83fcfe8f5000cb3f845643b4d79d6e3e95552fed7d7de14878741b484"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: could fix corrector to handle this but punting for now. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/shared/on_system_conditionals_helper.rb"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24c9c71cf0b87755cea4aa95b5c81088b056b82e937d6533be26a4220a0f6ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Update this list when stanzas in \u0060Cask::DSL\u0060 start or stop calling \u0060set_unique_stanza\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/no_overrides.rb"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a50e6ed3c880b15ad98e9a0f0808ed0cb596813f681e19ab6b197484478215"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove the deprecated/disabled check after Homebrew/cask has no more \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/url.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"be085627c166d95d6378d943d08f26ade5a5cdb9e45721bd3154504f57365609"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Use \u0060StanzaBlock#stanzas\u0060 for all cops, where possible. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/cask/ast/cask_block.rb"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a5c66462b279132b6b8ad86204125590292e2381f9a55327c37d46b2e9858f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: bump version when new Xcode macOS SDK is released \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/os/mac.rb"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dad1d6147de8c3513f0d020e99aa402ba91774f56c3c287bd970b695406806e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: move all of these to other modules e.g. Utils. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/extend/pathname.rb"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"037e618a091a3d8a28161e59a924cefcfcb0bf9070c6a6b3f8d960aae577de62"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: This includes formulae that have no runtime dependency on GCC. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/extend/os/linux/diagnostic.rb"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d35d06b70b0e3e42f3407643d4a4d5e68fe4c126b57489171564ed5777f6fd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Find a nicer way to handle this. (e.g. examining the ELF file to determine the required libstdc\u002B\u002B.) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/extend/os/linux/linkage_checker.rb"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a50a4b9f3f1aaedf1e1dc8c91697b5aa66d7cdbe817efd0361559980c1540a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Call \u0060super\u0060 here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/download_strategy/local_bottle_download_strategy.rb"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a7bf66ea0cdf1accd92b75ad58c366227b51abcdf395f985d71e1c254b8a34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add support for resource URLs with options and resources inside \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump-formula-pr.rb"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45417cad80b9d8ece1c4bdce6ae4c04a61098a4b4cc68963fdc06a2f24f5dcd"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # Hack \u0060git diff\u0060 output with regexes to look like \u0060git diff-tree\u0060 output. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/update_report/reporter.rb"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"466ae145f6072543ba960c937dae9adfc04f1b7fb4cbc88171bb81fe26a6c463"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: remove once commands are all subclasses of \u0060AbstractCommand\u0060: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cli/parser.rb"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d829fac192f59ff2633b3e9d5f264075c1becd8b5852b1e70e3a2a4ee8148b0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: use argument forwarding (...) when Sorbet supports it in strict mode \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/auditor.rb"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7316db542e1fa08e11938c235c2235f01783d8a23bef934a88b6b67cb9133e87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this sort of logic would make more sense in dsl.rb, or a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/artifact/abstract_artifact.rb"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8117b959a2a83419b5cf0a2953ba4d1a00c6476a09e3de1035ec8b318e975f2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: when stanza names are harmonized with class names, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/artifact/abstract_artifact.rb"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdb18ebd5f34fe977f9b709588f66c7eb44cccaac920166c1866b7a8406166d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Create a common \u0060Script\u0060 class to run this and Artifact::Installer. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/artifact/abstract_uninstall.rb"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba98f46cbc48b6a5cde7671a4908a8162808ec127720a05246c4b000f5b7211"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Replace the line below with your script \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/aliases/alias.rb"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a328fd13eaeaffd0f0e29133e9021f72802b27ed6001a680cd6cb86a64b19873"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 3 project(s) overshoot their size bounds, lowering Project Cohesion to 3.3/10. The most over is \u0060Library/Homebrew\u0060 (141999 LoC, 2870 module-visible types across 116 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":"D28","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":"7993ef26c7f1509fb6252dc3bef115a5374240aba2bee4a3f97c6dd4872d65b1"},"properties":{"commitSha":"22162ddf23afef07184202b9a5dae76f1f4d7132"}},{"ruleId":"D28","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":"3efcb754524e97d67b8e1c7ee98b21d9e7f28cdcfcd9795b19b856710151317c"},"properties":{"commitSha":"3d6bea97290fa8d445a9256cd3ce7ec63f87b493"}},{"ruleId":"D28","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":"3b2aba7165211f13b20e2882e4b84e86abfba8211028a7315d9dbca6a41a94ab"},"properties":{"commitSha":"584588afb4ab557bcc0536f2794b4d043c333bb9"}},{"ruleId":"D28","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":"b0f4a265a93a165811d4fa294e66fc7775090529a3586401fad8a3dde627b4ed"},"properties":{"commitSha":"792ec7fc85914be0842fa495c5300007ab146558"}},{"ruleId":"D28","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":"51743ff59ff00f1fe6c9eec643616549c15a43208378009d4a8bcb61ff5aab5b"},"properties":{"commitSha":"59ebdab2b79db2edbf323a7a493a24ee69d6e6af"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"207ec73ca167bc6f228d520ef452ec865a863805a4e7dc780c753ea31f88aab7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a895b7d5de543fd60c086595e6866879bb3b4039b8126167d39ab02b48b7701a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfaa8094e64679b026e60d77d383fefb647dfc17286f7f02c120a0141e05a14d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fac67e4f9b2e9efa9b748b9474743d94345705fd20f3dbeecbc90de56e7fe84d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9523b785c007261909ef9582f92717d53b5f12e4f76d478d8aa29a60219e6099"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee1520fc2eb6d883231b7c940e8bf6598fb8bca2cc329ff805ce262fecb76729"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7401ce183c58687c386b61a798247fc7e15e14141eecc064668c41f30138587c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"437f73afa73c2aeadae17bb0598ba232ccbd1f15a97cd2b997ac2345b5a55430"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"394b2f857087f173f1afd20a216fd10fd68d5409b7ab7e92f764710c7817019a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"419b50aec5b555a19b68d00c06d4b780a191dca58a45eda0e01c38c4f8298e6b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"265c54e911d382a427e19a60a33c26a98f18ad38fe8189114061c4857734b184"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a49799e72fbc7aeddb63a35a15a986c6847181303a0d40d6ecce358cd3d83a3c"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af9229fb1e3856465e088d0ad7096f60d9f3196d611034ca00d4f67ba68357b4"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1986f0c54764212dfdc429734fa67e46a4e6c6d2705f0c6136eef12dcc451fef"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"433f650bedb59143b89d4f5e4eb753b87e8f8679ecce93cf9f23a8bbcfe504fc"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75cb1e28cc7f62f97714c792baa1090cb78f973bc67a35d27941d694825087b2"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b670661d531d6d93e2fc94b41c09d435708752729998d256e69c7f8e5bc284c"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4413915375b5203cc018730238d1dfe65d136cef97dbdbf9927522316d92c7e8"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e13628f41a3c8d7ef1b4fa261771252aa6ec5cac68166473661d181d896749b"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06601e44e5ffe9782d79ae909151aae7cc8d653229695f8bbf9ea8039f280552"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"38cef6c07caecb534cf594813f80f877edbf7104d5b817ab4ae7d74b1f234c83"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14d44206678c90567fb87a8f6d88846dfe24ab1fbe09d75a5f3083eecf75a969"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef997ecf628b1e813c7bbea40ec2e346a023a4cbf688928b54b9f3e14a7ca659"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4437c0b36720dce15d787fbff32913f9220233f757947da770807b69bc26fda2"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58a5d2fc0401f9e534b5660e86e1597fcca14382306224d723f4786af9db354b"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a908a8516bc4c09ba70ae0fd259a3fb5234d3635b5417ad69a874a827fdf076"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e8a144c04709a8c88f48f8076f8b55a858ffdf36203d9016f4e786f04f3913d"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"617d848f488301104f2aeed687bd7c2f6d5373d0296215a5d244ddae6be65284"},"taxa":[{"id":"CWE-1265","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","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":"f59e995c4fe3bc087aa1faa06eb2213e23a365ca0ad88b16f4f27474b234fe1e"}},{"ruleId":"D31","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":"135122fe19eae2a629d55651d8e5b7b10a06c0fdb1bdecfafb4ced7e1108c3fc"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"6bf2ef99d1bc64de0128e2500f9df6624ad6b667e3ef91f588321ea7fd101949"}},{"ruleId":"D31","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":"e7a83b25a59bcd25f9a77dbd4195fd83e35ec3b5e288d5c49d23576522261004"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"0dce5c76b4d2af805a1c14a2898709442a23e84a1900331e33673126123a6e00"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"5cfed0ee4e80785ce23c7083cffdead9acc6c64f9dce56a00ca7178bd3d7bee5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"66c86c684e1187dc3605dc33c65fc6b2da5b7334a51c56e9c42db96b44de22d4"}},{"ruleId":"D31","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":"9e0f3459b79638a37e60cbd02c38023fe12af07a9f4389344a1f2c17a05fb726"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 508 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 508 of the 1030 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: Library/Homebrew/extend/file/atomic.rb. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/extend/file/atomic.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e3b6b80f8393b9b15aa628d319931b185b6c75f4a8c308f266f4a9354f0b24"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: reinstall.rb \u2194 upgrade.rb: \u0060Library/Homebrew/cask/reinstall.rb\u0060 and \u0060Library/Homebrew/cask/upgrade.rb\u0060 change together 64% of the time (9 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00608c459e7e\u0060 Move API and queue helpers to owners; \u006061cef916\u0060 Fetch cask downloads with formula bottles; \u0060bd463ee7\u0060 Keep one failure from aborting a batch install \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/reinstall.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf1bcbf6557fc3f69bd4d403ac56371fd2e032f6a19b67ed4412ad9fc9a68a2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: leaves.rb \u2192 cleanup.rb, install.rb, dependency.rb, diagnostic.rb, installed_dependents.rb, autoremove.rb: \u0060Library/Homebrew/cmd/leaves.rb\u0060 changes together with 6 other files \u2014 \u0060Library/Homebrew/cleanup.rb\u0060, \u0060Library/Homebrew/cmd/install.rb\u0060, \u0060Library/Homebrew/dependency.rb\u0060, \u0060Library/Homebrew/diagnostic.rb\u0060, \u0060Library/Homebrew/installed_dependents.rb\u0060, \u0060Library/Homebrew/utils/autoremove.rb\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 6 separate couplings, not 6 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 6."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/leaves.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9867d67f5d62a990cf19fc3af7fa3db1d6de91fc60525f2df34eb8cca4e37038"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: formula_actions.rb \u2194 install_steps_helper.rb: \u0060Library/Homebrew/install_steps/formula_actions.rb\u0060 and \u0060Library/Homebrew/rubocops/shared/install_steps_helper.rb\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060431a27c1\u0060 Add Python bootstrap action; \u00600e956148\u0060 Add PHP configuration action; \u0060b312752f\u0060 Add Clang system config action \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/install_steps/formula_actions.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05423f874d35495b1c20782c7d766c5d618537c63e0f770c9fd32825d3e1ba82"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: cask_dependent.rb \u2192 cleanup.rb, install.rb, diagnostic.rb, autoremove.rb: \u0060Library/Homebrew/cask_dependent.rb\u0060 changes together with 4 other files \u2014 \u0060Library/Homebrew/cleanup.rb\u0060, \u0060Library/Homebrew/cmd/install.rb\u0060, \u0060Library/Homebrew/diagnostic.rb\u0060, \u0060Library/Homebrew/utils/autoremove.rb\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask_dependent.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3141369dcebbae40011ebc8628f33acb2562eeab52ae6256e1e7e48ee7a833fe"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: installed_dependents.rb \u2192 dependency.rb, diagnostic.rb, autoremove.rb: \u0060Library/Homebrew/installed_dependents.rb\u0060 changes together with 3 other files \u2014 \u0060Library/Homebrew/dependency.rb\u0060, \u0060Library/Homebrew/diagnostic.rb\u0060, \u0060Library/Homebrew/utils/autoremove.rb\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/installed_dependents.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a04f09dbc3680c5a8c48fd400135b7fe5b21eb273767879cfb928b1da9a9e6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cask.rb \u2194 formula.rb: \u0060Library/Homebrew/api/cask.rb\u0060 and \u0060Library/Homebrew/api/formula.rb\u0060 change together 55% of the time (12 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u00607b7c464d\u0060 Stop using unsigned per-package API data for installs; \u0060170eed9f\u0060 Harden unsigned API, trust, installer and output boundaries; \u00605ab33c9e\u0060 Parse only needed internal API payload entries \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/api/cask.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e112de81b8a9fb1ea25f721f28b3ad6e5dac2831de0cf5b1ff0674828217917b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: test.rb \u2194 formula_installer.rb: \u0060Library/Homebrew/dev-cmd/test.rb\u0060 and \u0060Library/Homebrew/formula_installer.rb\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060e29632cf\u0060 Unify sandbox temporary directory handling; \u0060f8fcbd88\u0060 Sandbox structured cask operations; \u0060dd8119e3\u0060 Harden sandboxed install phases \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/test.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04dd406a6626bcdc5ee4153876d211cfe627c1ea4a66995cbdef5c0dde4a99a0"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P6","level":"note","message":{"text":"Changelog looks stale/thin: The changelog this check read carries 0 versioned entries, against a bar of 3. Counted as either the distinct \u0060x.y.z\u0060 versions it names (a link\u0027s target is not counted) or its version-shaped section headings (\u0060## [1.2.0]\u0060, \u0060## V14.x.x\u0060, \u0060## Updates in 8.0.x\u0060), whichever is the larger \u2014 so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read \u2014 release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository \u2014 are not counted here, and this row is about what is re-findable in the tree rather than about how often you release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9a74c249fe67853238d9c15085f7f97d31f51bb82455046aa10c2cef82f67b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!HOMEBREW_CELLAR.exist? \u0026\u0026 !Cask::Caskroom.path.exist?\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cmd/missing.rb, Library/Homebrew/diagnostic.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/missing.rb"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded86451b66e9ff20b0ceaec072eee408af685cddec97889e3d78d0543cd3e50"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Homebrew::Services::System.launchctl? \u0026\u0026 !Homebrew::Services::System.systemctl?\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/bundle/brew_services.rb, Library/Homebrew/services/subcommand.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/brew_services.rb"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd26f07e23118499e59b4d2d3e98599b03e5e17420d225c1fb1b6c13194fd209"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!dep_tap.allowed_by_env? \u0026\u0026 dep_tap.forbidden_by_env?\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cask/installer.rb, Library/Homebrew/formula_installer.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e55e32be5ceed111dff9a8f4a1cb620eca0ec335231bbc8f10f892bbbdf0484"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!no_upgrade \u0026\u0026 package_outdated?(name, with:, source:)\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/bundle/extensions/cargo.rb, Library/Homebrew/bundle/extensions/uv.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bundle/extensions/cargo.rb"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cbad7d9835f9bd42442d39d089e021147d960cd9e111a09721d6431e41c6ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(status.success? \u0026\u0026 !stdout.empty?) || false\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/unpack_strategy/dmg.rb, Library/Homebrew/unpack_strategy/tar.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/unpack_strategy/dmg.rb"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"012f148dee34fbb1a5c2c1cd2df327b6fa6fe0338d8f35bec9b2c5a7df022cfd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060FromAPILoader.try_new(ref, warn:) || FromTapLoader.try_new(ref, warn:) || FromNameLoader.try_new(ref, warn:) || NullLoader.new(ref)\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cask/cask_loader.rb, Library/Homebrew/formulary.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"937b6ee6bc6e8e41e3219b68e0ba5abf0bb8d8afac543fbddc84bb4cecaa4b76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060MacOS::Xcode.installed? || MacOS::CLT.installed?\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/extend/os/mac/development_tools.rb, Library/Homebrew/extend/os/mac/system_config.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/extend/os/mac/development_tools.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccca93b436578f510b34a8994dabf884d3cd25f5af02b0eacba17e98b6ddd975"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060SharedAudits.self_submission_for_repo_owner?(repo_owner) || !SharedAudits.commit_email_domain_match(self_submission_urls).nil?\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cask/audit.rb, Library/Homebrew/formula_auditor.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/audit.rb"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"44650f7cee4edbd07d61b8e9ba5ec42f38572e8a9722955ad18ad4921198da99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Tap.allowed_taps.blank? \u0026\u0026 Tap.forbidden_taps.blank?\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cask/installer.rb, Library/Homebrew/formula_installer.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ec3812dde2bd06b9c4b919ad5c5a2ec6724ecdc0a7b62ca9eb7e67224ba565"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Utils::Shell.parent || Utils::Shell.preferred\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cmd/--env.rb, Library/Homebrew/cmd/command-not-found-init.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/--env.rb"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0065a6668a47ceeb7655ecd4799dd71e177b894d97ebbea7e6ae64430cd9303c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.debug? \u0026\u0026 !Homebrew::EnvConfig.disable_debrew?\u0060 appears character-identically in 3 files \u2014 Library/Homebrew/build.rb, Library/Homebrew/postinstall.rb, Library/Homebrew/test.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/build.rb"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf255ecb9e65a02bf95daca24e1a7865cf12e9b46213c59bd04ef56c77a2508"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.minimum_version || args.min_version\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cmd/outdated.rb, Library/Homebrew/cmd/upgrade.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/outdated.rb"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0282b5eeac89b356ecd884b62b8086de1a676a5fc67b2ad5f5f75e69427b831"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060artifact.is_a?(Cask::Artifact::Installer) \u0026\u0026 artifact.manual_install\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cmd/upgrade.rb, Library/Homebrew/dev-cmd/cask-ci.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/upgrade.rb"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2744b3541f94331335446f2c7d62f932a06a6dccc8477f75de65160ee920f2a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dep_tap.blank? || (dep_tap.allowed_by_env? \u0026\u0026 !dep_tap.forbidden_by_env?)\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cask/installer.rb, Library/Homebrew/formula_installer.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/installer.rb"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d45e4ba56fb4f578deffc00a6d60deb181c6b129735b834541430bdacd6cf45"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060download_queue || Homebrew::DownloadQueue.default\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cask/upgrade.rb, Library/Homebrew/cmd/upgrade.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/upgrade.rb"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"267ffb9d13b4460b2d897703693f2ff845e0cd2192afa46c83edfb824e2bc364"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dst.symlink? \u0026\u0026 src == Utils::Path.resolved_path(dst)\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/diagnostic.rb, Library/Homebrew/utils/link.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/diagnostic.rb"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"083bbe7a92ccbfa2f02e8c6b5d195dda425a9f417c5ffa1895d8136b4f040f44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing_path.nil? || existing_path.to_s.length \u003C new_path.length\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/tap/core_cask_tap.rb, Library/Homebrew/tap/core_tap.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/tap/core_cask_tap.rb"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd3495966b38a34a45e9b4d95940ad83dba8232c09ec57a9dbdb3ac6ac58a50"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060formula.deprecated? || formula.disabled?\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/dev-cmd/bump-python-resources-pr.rb, Library/Homebrew/formula_auditor.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump-python-resources-pr.rb"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe91ed38170b61880d321c96cfcf87bce3bcd7d3c8e9271f0faa3d6c955b80ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.is_a?(String) \u0026\u0026 key.match?(SHA256_REGEX) \u0026\u0026 value.is_a?(Symbol)\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/bottle_specification.rb, Library/Homebrew/formula_versions.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/bottle_specification.rb"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0056d7052affa0c022978b117dba2612ad93e6bc97d62f4d75e3855f6ef2630b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060minimum_version.present? \u0026\u0026 args.named.length != 1\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cmd/outdated.rb, Library/Homebrew/cmd/upgrade.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/outdated.rb"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b17fcbaf08701df66c7c41748755a81f63dc2ccb5d485e8935ff2ea9e840031"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parent.is_a?(RuboCop::AST::SendNode) \u0026\u0026 parent.receiver == node\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/rubocops/install_steps_source_independence.rb, Library/Homebrew/rubocops/no_base64.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/install_steps_source_independence.rb"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a17ae2f29be9be8d05cb4bc25a074798f3718ea815c3075b023befb4f778d26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.absolute? || path.each_filename.any?(\u0022..\u0022)\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cask/artifact/generated_script.rb, Library/Homebrew/cask/dsl/rename.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/artifact/generated_script.rb"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"930dbf44a6b3d44f207132deb8482fe379e3bd2ca6c4c5a2f31b95151198044b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060replacement_cask.presence || replacement\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cask/dsl.rb, Library/Homebrew/formula.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/dsl.rb"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"1372ddd0b9c240ac1782c993ff12da256dca058657e254a3bcafcd767f0aa545"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060replacement_formula.presence || replacement\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cask/dsl.rb, Library/Homebrew/formula.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/dsl.rb"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f962fda0a0b4a65a61eff77797e412047ed24570d2e82f54110162bc0d6c2f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target_line.match(/\\A(?:def\\s\u002B(?:self\\.)?|attr_reader\\s\u002B:|attr_accessor\\s\u002B:)(\\w\u002B[!?]?)/) || target_line.match(/\\Adelegate\\s\u002B(\\w\u002B[!?]?):/)\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/rubocops/public_api_cookbook.rb, Library/Homebrew/rubocops/shared/api_annotation_helper.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/rubocops/public_api_cookbook.rb"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a954ddfed3ae1776c49c0998e49d7d5281be1c8af369c1a681b9ee5f6d0c94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060throttle_rate.nil? \u0026\u0026 throttle_days.nil?\u0060 appears character-identically in 3 files \u2014 Library/Homebrew/dev-cmd/bump-cask-pr.rb, Library/Homebrew/dev-cmd/bump-formula-pr.rb, Library/Homebrew/livecheck/livecheck.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/dev-cmd/bump-cask-pr.rb"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4174874af62f194a2a20631122cd8fd8722ed26c82c347f0176f90ddf2a0b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type == :tap \u0026\u0026 !Tap.remote_reference?(trust_name) \u0026\u0026 Tap.fetch(trust_name).official?\u0060 appears character-identically in 2 files \u2014 Library/Homebrew/cmd/trust.rb, Library/Homebrew/cmd/untrust.rb. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cmd/trust.rb"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada9822b07b38ff3bb1ea75a8b2f2f3b69c2c888c975b3483807782c6f30914e"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/1 NRT-eligible project(s) enable \u003CNullable\u003Eenable\u003C/Nullable\u003E (projects targeting a pre-C#-8 framework are excluded \u2014 NRTs aren\u0027t available there). NRTs catch a whole class of null-deref bugs at compile time."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80b24de9378624a0ce4846d60457395befcaec8e109ea81d289a370c9f7bfd5d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060resolve_installed_artifacts\u0060 answers \u0060[]\u0060 when \u0060CaskError | MethodDeprecatedError | ParserError | KeyError | ErrorDuringExecution | SystemExit\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/cask/cask_loader.rb"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b75371869e49fa28c5591851a27f0d10b5cbc7679d757fa1c0161cfeb2ba932"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060trust_store\u0060 answers \u0060{}\u0060 when \u0060ENOENT | ParserError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the rescue or above the method, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Library/Homebrew/trust.rb"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"d018d8a4f7f78186eeac8afa37f8e974ed8d2363aaa75a61dff77bdbee00706b"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-116","guid":"c0134ca8-adc7-6959-bd17-5253a265d101","name":"Improper Encoding or Escaping of Output","shortDescription":{"text":"Improper Encoding or Escaping of Output"},"helpUri":"https://cwe.mitre.org/data/definitions/116.html"},{"id":"CWE-1265","guid":"9bfc5711-f2f2-6252-bd2e-ff21a1e98a6c","name":"CWE-1265","shortDescription":{"text":"CWE-1265"},"helpUri":"https://cwe.mitre.org/data/definitions/1265.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.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-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"Reversible One-Way Hash","shortDescription":{"text":"Reversible One-Way Hash"},"helpUri":"https://cwe.mitre.org/data/definitions/328.html"},{"id":"CWE-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"Insufficient Verification of Data Authenticity","shortDescription":{"text":"Insufficient Verification of Data Authenticity"},"helpUri":"https://cwe.mitre.org/data/definitions/345.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"}]}],"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":44,"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."]}]}