{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"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":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"HiArgs::from_low_args (cyclomatic 30): HiArgs::from_low_args has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/hiargs.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"17abd99291d4e0ff7b90ba4f46ddd35eda5a778f0f5bb5da40ec095bafab447c"}},{"ruleId":"D1","level":"warning","message":{"text":"Ignore::matched_ignore (cyclomatic 25): Ignore::matched_ignore 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":"crates/ignore/src/dir.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a464371ada453be9d671b64d749d1cf9070afd4b5c44d46755c615ea098ed3"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker::run_one (cyclomatic 21): Worker::run_one 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":"crates/ignore/src/walk.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"4116e5dca080fccd7db7ad997cb8cd9fd9f97a19196b35cb97e06437e96e8639"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobSet::new (cyclomatic 19): GlobSet::new 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":"crates/globset/src/lib.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d659ceba2a21c3fd2360189db383e5507bd348064d81d22e42f8feb32b628bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Ignore::add_child_path_with_found_ignore_files (cyclomatic 19): Ignore::add_child_path_with_found_ignore_files 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":"crates/ignore/src/dir.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c81c92ddb24b617f9c8c9d29a57f2817d3ff7e825311ac4c6fde8b74a241a4"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokens::tokens_to_regex (cyclomatic 18): Tokens::tokens_to_regex 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":"crates/globset/src/glob.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bdcebb7a8ca33c59f316819fc9b0741d2d6a325d2e34a935da73f9108b5978"}},{"ruleId":"D1","level":"warning","message":{"text":"grep_regex::ban::check (cyclomatic 18): grep_regex::ban::check has cyclomatic complexity 18 (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":"crates/regex/src/ban.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6831bd2b2c304ce951b64a990c5f1da796991995767ad6a07dca65f88aee267a"}},{"ruleId":"D1","level":"warning","message":{"text":"grep_regex::non_matching::remove_matching_bytes (cyclomatic 18): grep_regex::non_matching::remove_matching_bytes has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/regex/src/non_matching.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"189a71ad7900da4681297191c156cc88697c9d6446440bd85119ac2827b344ea"}},{"ruleId":"D1","level":"warning","message":{"text":"IncrementalIgnore::matched_with_errors_impl (cyclomatic 17): IncrementalIgnore::matched_with_errors_impl 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":"crates/ignore/src/incremental.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3376cbc18a3cec2755ac41c3f7c11713413bd8c7ba5d8fd215328a93406a7801"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker::generate_work (cyclomatic 16): Worker::generate_work 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":"crates/ignore/src/walk.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"52546006568f817d350a3169269dc7231c838f82b926fa45340d5e3f5fc9c7c1"}},{"ruleId":"D2","level":"warning","message":{"text":"HiArgs::from_low_args (cognitive 35): HiArgs::from_low_args has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 8, match/switch 7 (8 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":"crates/core/flags/hiargs.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb00a8e6259aeafd228794b2c778b7acf0ca9685e88aac8b5283d1ad1b1378ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Ignore::matched_ignore (cognitive 35): Ignore::matched_ignore has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 8, loops 3 (5 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":"crates/ignore/src/dir.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"0911e4c64709ca6e3e0d18489571b9eb3773b3318c648104c6b05fb320b84ea9"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokens::tokens_to_regex (cognitive 33): Tokens::tokens_to_regex has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 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":"crates/globset/src/glob.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"362eef292402cbe1fab7865c141d90c6ad530d39b38298d1bade0cebcf466cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::next (cognitive 32): Walk::next has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 5 (11 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ignore/src/walk.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcac7de6521f1017fa479a0d66eb9ba4ff5610103ffc908b52f1f5ece71a3a43"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::run_one (cognitive 30): Worker::run_one has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 3 (4 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ignore/src/walk.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9350bd3d891412236c43befdc36bb57d395ecf60ce0f06619fe3036564a096f"}},{"ruleId":"D2","level":"warning","message":{"text":"Core::match_by_line_fast (cognitive 28): Core::match_by_line_fast has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/searcher/src/searcher/core.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"989f74a4ea6db4f16a2c83f860a444e99fb73d634c164c3802fb9e84085dddc7"}},{"ruleId":"D2","level":"warning","message":{"text":"Ignore::add_child_path_with_found_ignore_files (cognitive 27): Ignore::add_child_path_with_found_ignore_files has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 10, match/switch 2 (4 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":"crates/ignore/src/dir.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fa05349e98f7186652d1a5c02c478a510d4e5fead137f597fa6779fbddd61b"}},{"ruleId":"D2","level":"warning","message":{"text":"HyperlinkFormat::from_str (cognitive 27): HyperlinkFormat::from_str has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (4 pts), loops 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":"crates/printer/src/hyperlink/mod.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00f10bf69d94e24d01461661ac1c99ebb5fe5ad37dd7ce5d4769d9a740b943c"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiLine::run (cognitive 27): MultiLine::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 1 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/searcher/src/searcher/glue.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51472a09568abc834cec4dd4afa4d40e4563217a9f53a564dc00e0a56461152"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_class (cognitive 26): Parser::parse_class has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 10). Of this number, 24 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/globset/src/glob.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"167e7a53d7172a00970827ea55c40a9c0d2c3a2173f19bf5b8a3cbc86ff39245"}},{"ruleId":"D2","level":"warning","message":{"text":"WalkParallel::visit (cognitive 26): WalkParallel::visit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (7 pts), loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ignore/src/walk.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b352eedc03afdd913c1620eeb9cd1cdfca67c7a091c7d3734309ccfe412bb17"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalIgnore::matched_with_errors_impl (cognitive 23): IncrementalIgnore::matched_with_errors_impl has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ignore/src/incremental.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacde06730f1eaaf004dfd6d0f1e00051aced99b7bd5734bb072f012f4d620bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::generate_work (cognitive 23): Worker::generate_work has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ignore/src/walk.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"53522bdcfcd86742c3f2e2d0ae6bcf8674a50b6c0d8c9f72fb1df09d498bad7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Core::match_by_line_slow (cognitive 23): Core::match_by_line_slow has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/searcher/src/searcher/core.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f4c6b536ca2c66fa60a38842842663aca60265ed9705cbbfcc02e5a8de236f"}},{"ruleId":"D2","level":"warning","message":{"text":"StandardImpl::sink_slow_multi_per_match (cognitive 22): StandardImpl::sink_slow_multi_per_match has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (6 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":"crates/printer/src/standard.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c1ab7881c8ff2f09c4c7fecac4af88931bc3040567df325c541cbc96fc7e9a"}},{"ruleId":"D2","level":"warning","message":{"text":"StandardImpl::write_exceeded_line (cognitive 21): StandardImpl::write_exceeded_line 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":"crates/printer/src/standard.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ac462f78825f407d8eb7f867a5c305d8242dfd3c64acb7ffc09439f6847e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"Patterns::from_low_args (cognitive 20): Patterns::from_low_args has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (9 pts), match/switch 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":"crates/core/flags/hiargs.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cc8d2bccdc2c1ef8d2563f73e3fc6b045b1e75040fd7958757a142dc64f6e8"}},{"ruleId":"D2","level":"warning","message":{"text":"StandardImpl::sink_slow_multi_line_only_matching (cognitive 20): StandardImpl::sink_slow_multi_line_only_matching has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/printer/src/standard.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ead28d89f4ddb20f5831e02223823245362f8b3aef6e5e3d95f0c2e184203b"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::is_fixed_strings (cognitive 20): Config::is_fixed_strings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 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":"crates/regex/src/config.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd4c98b0b7ef26fdf13ad5a682ef12f9b9f2a5c5307989b4a91dbc2ae50fa1c"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::get_work (cognitive 19): Worker::get_work has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (4 pts), match/switch 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":"crates/ignore/src/walk.rs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc7738dc88706c481b59188d3dabcc5b81cfe059d4d48d7b9f4fdd39ae28776"}},{"ruleId":"D2","level":"warning","message":{"text":"grep_regex::ban::check (cognitive 19): grep_regex::ban::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/regex/src/ban.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a57fe36a8a97d7469772bf0e8ef5454b738219f620b5551c249d052962514a"}},{"ruleId":"D2","level":"warning","message":{"text":"LineBuffer::fill (cognitive 19): LineBuffer::fill has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/searcher/src/line_buffer.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e9bc8407b202ba1bfa74867dcf9153def7e069b78720ba10bf150294d51f45"}},{"ruleId":"D2","level":"warning","message":{"text":"ripgrep::crates::core::flags::doc::help::generate_long_flag (cognitive 18): ripgrep::crates::core::flags::doc::help::generate_long_flag has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 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":"crates/core/flags/doc/help.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda55287ef28a5aba1021b47f62a5a0518ec0dd85025fc3d8f6931414aea6bf5"}},{"ruleId":"D2","level":"warning","message":{"text":"GitignoreBuilder::add_line (cognitive 18): GitignoreBuilder::add_line has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 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":"crates/ignore/src/gitignore.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"b084b96ecd862b008ebb46f6b899801afb369b0bdcad953d42125a8ed16575c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor::extract_repetition (cognitive 18): Extractor::extract_repetition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/regex/src/literal.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7143924be19b6645b7e9a669f6d4bb478a2e2e16c24f194e11e4fd470557e0d7"}},{"ruleId":"D2","level":"warning","message":{"text":"grep_regex::non_matching::remove_matching_bytes (cognitive 18): grep_regex::non_matching::remove_matching_bytes has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (17 pts), match/switch 1 (nesting depth added 10). 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":"crates/regex/src/non_matching.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fece16b33cf4859d5456229cdb0ac2c696c182c397411db55675c5df3b6326c2"}},{"ruleId":"D2","level":"warning","message":{"text":"grep_cli::decompress::try_resolve_binary (cognitive 17): grep_cli::decompress::try_resolve_binary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts) (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/decompress.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"811b6c1c90e4c29822decf7cad18f3c455795738fbb986c63787af50942a03f4"}},{"ruleId":"D2","level":"warning","message":{"text":"HiArgs::matcher_rust (cognitive 16): HiArgs::matcher_rust has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 3 (4 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":"crates/core/flags/hiargs.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"df918f04ebc2fef0bcf5625ba30afcabae04652770081089ead33628f9249e73"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flags/defs.rs: FileTooLong \u2014 3702 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 3202 over it, 7.40\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":"crates/core/flags/defs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18204b6deaa6c99a0d75abe5c85b65598c05b19398030c2658becfee67d663b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LowArgs: TooManyFields \u2014 74 stored fields. The bar is 30 stored fields; this is 44 over it, 2.47\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/lowargs.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"105d92fe6c32b652aec411ab61a4a1d72a853d123b3a09781691d3e18137a60e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: HiArgs: TooManyFields \u2014 69 stored fields beside 24 methods. The bar is 30 stored fields; this is 39 over it, 2.30\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/hiargs.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad87baced5244c371826b16c1b9f7a7b8267f8aef2a9c1088cd698de7c4be531"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/walk.rs: FileTooLong \u2014 1092 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 592 over it, 2.18\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":"crates/ignore/src/walk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"027673f9983850bcc1568b4a56908030b3f747b2dfdd737af5d19b0b7991baa3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/standard.rs: FileTooLong \u2014 956 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 456 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":"crates/printer/src/standard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf3d1577a4269470d6d2f2904799061eb80a27f919a1e29e7231b49a6930c62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: flags/hiargs.rs: FileTooLong \u2014 850 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: HiArgs (2 blocks, 36-919). The bar is 500 significant lines; this is 350 over it, 1.70\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/hiargs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3659cf10aa7ab77b6c85a885117c84d059ba1660cb8d6ad484031f38da252de5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HiArgs.from_low_args: MethodTooLong \u2014 from_low_args runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/hiargs.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa554f981096a33aaedef10b772c84d3acd2d85411085115b60bb7ae9429e975"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HiArgs: ClassTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 2 blocks, lines 36-919. The bar is 400 significant lines; this is 153 over it, 1.38\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":"crates/core/flags/hiargs.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0191682f0e32272282cd8c95d32006b398e4246af0cadc0ab36d81d1eed6eedc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StandardImpl: 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":"crates/printer/src/standard.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d4c1f9aa4c73d3d50064977fe653a892eaa326a08254b99214a9337ce4b64c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 155 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/globset/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac13df51da8dde1158645a58bc54df6744d84308a9d0b95262f10a2f34dcbac2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dir.rs: FileTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). 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":"crates/ignore/src/dir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1416857303572e537f6396f84a26fa20634fe92240b781614585cb680f0bbdc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StandardImpl: ClassTooLong \u2014 488 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 41 methods, 2 blocks, lines 876-1589. The bar is 400 significant lines; this is 88 over it, 1.22\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":"crates/printer/src/standard.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba1240da8b8e57c1668e5d56400840862e4e5d0719e1e0f470b68b44d6f8578"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 100 over it, 1.20\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":"crates/matcher/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b6997cfa2efdecf7834c1032e8467ff1c14412962e763db8df5e170f907bda"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WalkBuilder: 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":"crates/ignore/src/walk.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbec2ae65bac176be3f910f1834f9f28376740ccfb8eb1ddf05a0ae9da728fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/glob.rs: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 48 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":"crates/globset/src/glob.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32da8151a0f5ad1ecef052ab67104c275dc1679c23a569de4f87db73c5c3e470"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Core: 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":"crates/searcher/src/searcher/core.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60cfcb994671fb2912f770eb0753d12d38c387f88b8678a9d48744ee018fc54"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ignore.add_child_path_with_found_ignore_files: MethodTooLong \u2014 add_child_path_with_found_ignore_files runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ignore/src/dir.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"495d38716bec8218785a673fe93026591bda2dbeaac16ac7a910d7621cc4c939"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HyperlinkFormat.doc_long: MethodTooLong \u2014 doc_long runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/defs.rs"},"region":{"startLine":2916}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe1da18c0881c43fa6831ad3dc29020a5a0d0fc0dd792a9312fc1dac72ea1de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ignore.matched_ignore: MethodTooLong \u2014 matched_ignore runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ignore/src/dir.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8af8017fef6db1d4bdb5f8583e3d6644fb26a7ed0edb267f6d5ef7ef8d8551"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/core/search.rs:385-412 | crates/core/search.rs:422-449 \u2014 These two members are one piece of code written twice and then edited apart: 28 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":"crates/core/search.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bde9871d1e9c7df48c8cbf4c26a299378ab5b5896ad4ab72b1c4741c22103a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/searcher/src/searcher/core.rs:433-473 | crates/searcher/src/searcher/glue.rs:260-297 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"crates/searcher/src/searcher/core.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db78d58199934d12d9bf357ee6b770c14189c8e9a5184cdb3d6b56544044d3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/core/flags/doc/version.rs:83-116 | crates/core/flags/doc/version.rs:129-158 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"crates/core/flags/doc/version.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d29af519fa5609eefebbd9736b08e948b9c16772f0c407aae0eb43755c2c5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/matcher/src/lib.rs:700-732 | crates/matcher/src/lib.rs:829-861 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"crates/matcher/src/lib.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf5b0fc64e953270597bbad54b9d36a12e24c35ec1979dc2ac29ba478d01f3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/printer/src/json.rs:652-680 | crates/printer/src/standard.rs:703-735 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"crates/printer/src/json.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"3888b692ce99d2a383cfee3e81412e85b66324602cccd065bec0394243c21ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/searcher/src/searcher/core.rs:560-583 | crates/searcher/src/searcher/core.rs:589-615 | crates/searcher/src/searcher/core.rs:621-644 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 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":"crates/searcher/src/searcher/core.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26c0f02ffab35b78c42866cbe7d329a5bc17157da9c998ed449138695397c63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/core/flags/doc/help.rs:111-128 | crates/core/flags/doc/man.rs:27-43 \u2014 These two members are one piece of code written twice and then edited apart: 17 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":"crates/core/flags/doc/help.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7409e6371eeb25afad04e4763473919f182f704e58c4501682aa94aaf0d78a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/ignore/src/lib.rs:207-225 | crates/ignore/src/lib.rs:232-250 \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":"crates/ignore/src/lib.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67a86c9a66c0577157c76cc26310e8a5a27efd473016cf6048d9760ba6c9a80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/globset/src/lib.rs:686-700 | crates/globset/src/lib.rs:725-739 \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":"crates/globset/src/lib.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7472aa8c64c3cc0b85e171eb0bd54268cb661122efe6752ebf9adb2b3f50ba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/printer/src/standard.rs:549-571 | crates/printer/src/summary.rs:425-448 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"crates/printer/src/standard.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ad61e5f5359a9229301f848bb934b8be2b0a4b1059c7ca932dedee7f01320f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/globset/src/lib.rs:271-285 | crates/globset/src/lib.rs:287-304 \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":"crates/globset/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d5c4198ef5c8f8d4de5485622deade239c9f9ce54e4229585f1d24f8ab51a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/ignore/src/pathutil.rs:19-39 | crates/ignore/src/pathutil.rs:56-79 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"crates/ignore/src/pathutil.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b599f0d79a2a28503582f46840d90cd2621136a15a7167ac8695808453179c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/ignore/src/gitignore.rs:622-630 | crates/ignore/src/gitignore.rs:643-652 \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":"crates/ignore/src/gitignore.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce765f8adbbb5ed68e382223c9e8cf45b068b9a9e80346a047bca9fe2ca1195f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/core/flags/defs.rs:6358-6372 | crates/core/flags/defs.rs:6460-6474 \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":"crates/core/flags/defs.rs"},"region":{"startLine":6358}}}],"partialFingerprints":{"codehealthFindingId/v1":"554dc6ea5f72a9aa3a62599d70d2dc574f769a056728bd932816510bac408773"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/searcher/src/sink.rs:554-567 | crates/searcher/src/sink.rs:602-621 \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":"crates/searcher/src/sink.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f985ce89e48fc987d6f07179d9ac3cbc413c5ccf2e5dd95320cc330b353829"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/pcre2/src/matcher.rs:350-360 | crates/regex/src/matcher.rs:446-455 \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":"crates/pcre2/src/matcher.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b9420293b3cb2aeb2d44ed860f972511385d58e680fffd5c5c046d2bbc25f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/core/search.rs:342-351 | crates/core/search.rs:366-375 \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":"crates/core/search.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd631f0d1104b3728cfa5419727aa5e07d67bd72814e8617461991ca5c1aea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/regex/src/literal.rs:320-332 | crates/regex/src/literal.rs:336-348 \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":"crates/regex/src/literal.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"079227b7bd058118d03bf3d1c0044aa5d4e025514e05e109709bd580985fd422"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/printer/src/standard.rs:518-535 | crates/printer/src/summary.rs:393-411 \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":"crates/printer/src/standard.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b85bcd420728a6fdeb68c3bf7d5b765789d2c993789968d8616902fddcbc23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/printer/src/json.rs:691-705 | crates/printer/src/standard.rs:746-760 \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":"crates/printer/src/json.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0bdfdefa81468742a9c48e32c58c3b76d42db0e7682ee429e8c1d84cbb1a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/ignore/src/walk.rs:330-336 | crates/ignore/src/walk.rs:343-355 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ignore/src/walk.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"803eb5aec16bc74d0962b21ad68ee773ecf3af8e3d0c50144199d5871bfd761a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/printer/src/standard.rs:1681-1688 | crates/printer/src/standard.rs:1692-1702 | crates/printer/src/standard.rs:1706-1715 \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":"crates/printer/src/standard.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c982b6145e0840b2fb2b3a2b65d00a65153e09512923811ced447310acd38a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/ignore/src/walk.rs:393-403 | crates/ignore/src/walk.rs:410-422 \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":"crates/ignore/src/walk.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef3cdf4055fe4007809390363bcd30c047e1aa7133673f65ca320b7fd096a8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/globset/src/lib.rs:935-949 | crates/globset/src/lib.rs:956-967 \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":"crates/globset/src/lib.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"e157e01abad996f500db1f22e8b573aab221c3469410c824d891b1f802a1b45b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/ignore/src/types.rs:385-394 | crates/ignore/src/types.rs:399-408 \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":"crates/ignore/src/types.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a491faf9c5309ca94581e9dfdd487ff4563ff38cf36b6a426e42918c385bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/matcher/src/lib.rs:910-919 | crates/matcher/src/lib.rs:958-968 \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":"crates/matcher/src/lib.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1ddee81e0e4b50336962d920d02c1e48ba391b73da25c644e8f8dbdd3e3253"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/printer/src/summary.rs:548-558 | crates/printer/src/summary.rs:564-574 \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":"crates/printer/src/summary.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc29536b9648c2be3691595e770294143dc2b938c9d2ad055c189ff23413092a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/printer/src/path.rs:169-175 | crates/printer/src/standard.rs:1459-1466 | crates/printer/src/summary.rs:594-602 \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":"crates/printer/src/path.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c27e92bb94d17048b61c9facf34c89a911cf842c079d92c9a885707e53751d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/globset/src/glob.rs:344-354 | crates/globset/src/glob.rs:571-582 \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":"crates/globset/src/glob.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"937bff10cbfbac45a5809e0e305d353500fac001d2ae19442172ce4498a13b1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/core/flags/lowargs.rs:359-373 | crates/core/flags/lowargs.rs:380-393 | crates/core/flags/lowargs.rs:400-413 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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":"crates/core/flags/lowargs.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc49a60e9778c1ab775b032629f7d99db27ad9a5144fb37f02e523f7e360cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/printer/src/json.rs:789-800 | crates/printer/src/standard.rs:827-839 | crates/printer/src/summary.rs:683-694 \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":"crates/printer/src/json.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"f035b4695d20a383a663cede72fdda89f94b55c3a0d9a4aad92d4d16131d4082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): crates/core/flags/doc/version.rs:95-116 | crates/core/flags/doc/version.rs:141-158 \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 \u0060crates/core/flags/doc/version.rs:95\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/doc/version.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8465ff12e397fc087291c4265faf48eb2be938425028354d86d3cadbc7309993"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/matcher/src/lib.rs:712-732 | crates/matcher/src/lib.rs:841-861 \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 \u0060crates/matcher/src/lib.rs:712\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/matcher/src/lib.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b28017c6eb168d29152a0440a4d4f43528674a23d227dea3627ed0ebbd7872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/printer/src/json.rs:661-674 | crates/printer/src/standard.rs:716-729 \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":"crates/printer/src/json.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e3dc5f22c34d58efd02b91f1b38501202da63a980159939a06553836743c12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/searcher/src/searcher/core.rs:561-571 | crates/searcher/src/searcher/core.rs:592-602 | crates/searcher/src/searcher/core.rs:622-632 \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 \u0060crates/searcher/src/searcher/core.rs:561\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":"crates/searcher/src/searcher/core.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"00db72d64893ec09102c84892b9c4af922fea170397d8383c12e776a164a95aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/core/flags/defs.rs:6359-6369 | crates/core/flags/defs.rs:6461-6471 \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":"crates/core/flags/defs.rs"},"region":{"startLine":6359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dede2083374caa06265cb9bd07e054fc89409538f030dac7a8337a1ab1054ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/regex/src/literal.rs:322-332 | crates/regex/src/literal.rs:338-348 \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 \u0060crates/regex/src/literal.rs:322\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060cls\u0060 to \u0060\u0026hir::ClassUnicode\u0060 in one and \u0060\u0026hir::ClassBytes\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/regex/src/literal.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7191650cf0335a522dbf6164673a84efe93e8b70dfab3c77d9af52e9da4163be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/ignore/src/dir.rs:1106-1113 | crates/ignore/src/dir.rs:1122-1129 \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 \u0060crates/ignore/src/dir.rs:1106\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":"crates/ignore/src/dir.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"610c17a8e9db387347f9c53f29f3342ff7dbef5f2e3aa00e1db4fc320e442b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pcre2/src/matcher.rs:353-360 | crates/regex/src/matcher.rs:448-455 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/pcre2/src/matcher.rs:353\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/pcre2/src/matcher.rs:352\u0060 calls \u0060map_err\u0060 and \u0060crates/regex/src/matcher.rs:447\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pcre2/src/matcher.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b7eb9be7476ab33e88fac30ed2b3f8591da011ea3c7366d3a7d14d9088441a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/regex/src/literal.rs:281-290 | crates/regex/src/literal.rs:297-306 \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":"crates/regex/src/literal.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6488341c33d6730363e9316479bb0b7696f157e70e9143cb0e9239d403acf01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/search.rs:390-396 | crates/core/search.rs:427-433 \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 \u0060crates/core/search.rs:390\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":"crates/core/search.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef2d0c2480cdc61d082a3843ecc6f0bb095e83507d727cef5098c26495d3bf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/search.rs:398-404 | crates/core/search.rs:435-441 \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 \u0060crates/core/search.rs:398\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":"crates/core/search.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded00ddcd0373606a1fcb4a6c7489f0ba6efb23c3ff98c766072e078c5dfc868"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/searcher/src/searcher/core.rs:285-291 | crates/searcher/src/searcher/core.rs:316-322 \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 \u0060crates/searcher/src/searcher/core.rs:285\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn after_context_by_line( \u0026mut\u0060 in one and \u0060crate) fn other_context_by_line( \u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/searcher/src/searcher/core.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d61040b1d44bd594ddaead33b805984132e73cec938e25d3496f2f59ab779d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/printer/src/standard.rs:1040-1046 | crates/printer/src/standard.rs:1067-1073 \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 \u0060crates/printer/src/standard.rs:1040\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":"crates/printer/src/standard.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c242af72447ff65ad51d9917a432112f7a6eec6166402cc4082c4392ab29c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/printer/src/color.rs:332-336 | crates/printer/src/color.rs:340-344 \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":"crates/printer/src/color.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd9eff419ce17c80174d60251df3281bc974bb56a3ac2fbc0ce58a87d9a50e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/printer/src/jsont.rs:99-108 | crates/printer/src/jsont.rs:124-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/printer/src/jsont.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e589b744fafa65dbc00a3a50ae30cff0809659b491d9696fbcea48a89424dbf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/searcher/src/searcher/glue.rs:118-122 | crates/searcher/src/searcher/glue.rs:167-171 \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 \u0060crates/searcher/src/searcher/glue.rs:118\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":"crates/searcher/src/searcher/glue.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b469d7e8844407b27861878950c4740c1455b117fff697ec38b6236a47b6eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/ignore/src/dir.rs:423-433 | crates/ignore/src/dir.rs:437-447 \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 \u0060crates/ignore/src/dir.rs:423\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":"crates/ignore/src/dir.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2828275cb7725387c76b08eea122f913f803b295cbb6f9459733029324bd6a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/printer/src/standard.rs:1395-1404 | crates/printer/src/standard.rs:1407-1415 \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":"crates/printer/src/standard.rs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80d2b092a97d90d75b45c78dcd3462a88909e5c7933e591daee83c8a161da20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/flags/doc/help.rs:159-166 | crates/core/flags/doc/man.rs:76-84 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/flags/doc/help.rs:159\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060flag\u0060 to \u0060\u0026dyn Flag\u0060 in one and \u0060\u0026\u0027static dyn Flag\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/doc/help.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a302416d694d4344cb7fe05ac1fa41fe6307917c58a1c77883afa87f80886365"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: globset: globset: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9d2ce0683e175cc8834c766da5c2655645dcd49e3a110dfdc683e8280d5726b8"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: grep-matcher: grep-matcher: abstractness 0.22, instability 0.00, distance 0.78 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f59209125e7bb17956a8b288abdb6250ca5f8ef6eadbb7fa96582b25197f9319"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/cli/src/decompress.rs: 38.0% line coverage (78/205)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/decompress.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0509fe118aaf6077faef808c34fafc3718caab513d8093acad29163e9a90e70"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/cli/src/wtr.rs: 10.5% line coverage (6/57)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/wtr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"353922b5080d11cf83db6c13570f63ed796b07386d8713c8c9765e0849c83b99"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/flags/complete/bash.rs: 0.0% line coverage (0/39)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/complete/bash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ce3f1803d4ec66d9e2804a11cbdfbfd7ac1b67f079daf5d700099c603f0ccc"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/flags/complete/fish.rs: 0.0% line coverage (0/55)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/complete/fish.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1746254dd582a23716999b26857ad543cacfcc122720fea1d590003b62cca08"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/flags/complete/powershell.rs: 0.0% line coverage (0/38)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/complete/powershell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09844da3f356c8c9a7f59b43bd880965c36eff6e695e08d94a49a04e4beda2ba"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/flags/complete/zsh.rs: 0.0% line coverage (0/12)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/complete/zsh.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9ff841179f5984a1994e265aab8a32b67c730e4beb2497289d8904b1400478"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/flags/config.rs: 37.7% line coverage (20/53)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"099e6d2f1345b8be03c41444e65fea93789a6289aeccd6c299eeabcf790ed501"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/flags/defs.rs: 40.9% line coverage (1670/4085)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/defs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cafd50cac8c7dfabae8af61ca15462dfe30c64c443c0a1cc2ae4ca00095ca5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/flags/doc/help.rs: 0.0% line coverage (0/179)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/doc/help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61df43a51da53f1efc2e5d3959d20875c66793f56438cc90f60840ce44f4ab8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/flags/doc/man.rs: 0.0% line coverage (0/64)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/doc/man.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9906447be13c64fd23fb2cbc7e664310ed50b9dd5c88be644d7308d7402db086"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/flags/doc/mod.rs: 0.0% line coverage (0/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/doc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"036b13004f5cdd70e693e3765e25ab0d68742e65a40ac060571df9512794da49"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/flags/doc/version.rs: 0.0% line coverage (0/61)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/doc/version.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b99fee4a7ddb6907a76f11472d66e14e8c8189104239d211d7cfdf05936560"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/flags/hiargs.rs: 0.0% line coverage (0/744)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/hiargs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd42d308ae45a1fcc1cb0e9deb1664adbb52d573b7cf255016e013757d6ae74"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/flags/parse.rs: 43.2% line coverage (96/222)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/flags/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"750ace65642a8d8c460b21bee56b85692b7b77d60841b6d33900431f106e1cab"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/haystack.rs: 0.0% line coverage (0/62)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/haystack.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3946b6fffa4958999eb16c5aa59254665d9e117c293eefd46e0221de300b3cec"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/logger.rs: 0.0% line coverage (0/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/logger.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5623a0182a4b78a2f6b8cee75a4fbc9409203f80da40a44f7c9336a0b13d15a6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/main.rs: 0.0% line coverage (0/266)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"258bb0b55b25ae8809dafc2ee96a238b9534f1ca0f86a262384cb2483f0cb0c0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/messages.rs: 0.0% line coverage (0/18)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/messages.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc05243ae519a22f6fd0a8e1e920fb428013bf2f2bcee0f6f92ca455ce00e54"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/core/search.rs: 0.0% line coverage (0/232)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1fece8e87566d481669d5a976adc9cbd97ec3b11da0517b1f1239fc535bb06"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/pcre2/src/error.rs: 0.0% line coverage (0/14)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pcre2/src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf4a42e96088fe210ed4fa4c4acaef4109d3a005d97c12f6decb1a518b8bfec"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/pcre2/src/matcher.rs: 44.1% line coverage (78/177)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pcre2/src/matcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"432e78622d2ad55bb00f4f504ace0dd9c395e697c0f50dafd04d84794248e116"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: crates/printer/src/hyperlink/aliases.rs: 0.0% line coverage (0/20)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/printer/src/hyperlink/aliases.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c2fbb579b2e9fa6a72dd6a65d8961c535b7513ab6176538bf7973b40599e5b"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: ignore.incremental::tests::parent_loading_can_be_disabled: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/ignore/src/incremental.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cc1099ec0d6f8699aabb35f6d1da537869edd00d82e774c5adfd2d959a8932"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/ignore/src/dir.rs: crates/ignore/src/dir.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Ignore::add_child_path_with_found_ignore_files at line 369. 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 15:53:12 -05:00\u0027 --until=\u00272026-11-09 15:53:12 -05:00\u0027 --full-history --no-merges -- crates/ignore/src/dir.rs\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":"crates/ignore/src/dir.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5463f1b520fa10afe14ba5aa89df7f2c29c793c000bf8011645ab6af35a75696"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/globset/src/lib.rs: crates/globset/src/lib.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in GlobSet::new at line 461. 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-11..2026-11-09, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-11 15:53:12 -05:00\u0027 --until=\u00272026-11-09 15:53:12 -05:00\u0027 --full-history --no-merges -- crates/globset/src/lib.rs\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":"crates/globset/src/lib.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"45835d1d188190536908509853b118022910204fe110dd68c47b528e52567ac8"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: crates/printer/src/summary.rs, crates/ignore/src/types.rs, crates/core/flags/config.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dbd22d9d897606e6d9a212b13ba40b33e3cbbbc87109d0f5b19e6a8a9642d34b"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (5 single-owned of 65 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; 65 of the 78 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/searcher/src/searcher/mmap.rs, crates/searcher/src/lib.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(burntsushi): Darwin doesn\u0027t like this test for some reason. Probably \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":"tests/regression.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d0cec16b327eb79593f4c90a8b7b1be038c2aa49826a0dcefcfa80c2cff54e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(burntsushi): Figure out how to make this test work on Windows. Right \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":"tests/regression.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cf7909801e9b604fede20af8b37d859d342fd85dbfe2260ab9820962d002cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In theory, it should be possible to amortize \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":"crates/searcher/src/sink.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b34e7b1a0bbbbb15935c52b025330424be4b3132162c19c57b2ed96ed131e0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This works around a bug in grep-regex where it does \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":"crates/searcher/src/searcher/core.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4ecd8479c45290a150a5514d6b5c9c7abf7f9ba2226cebe56c3912347abb12"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Re-enable this test once inner literal extraction works. \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":"crates/regex/src/matcher.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace4df44fbd98ef01a904f2bffe5ccd3a2e6c0bacf797ec0cd0bd36f9e99cd03"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is wrong, but not doing this leads to incorrect \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":"crates/regex/src/non_matching.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d60d4a85e8c25005fff53e849ee34c7eba21814d26f2546a6db8bc1edb7f446"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The first four tests below should correspond to a full set \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":"crates/regex/src/non_matching.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2206857e20d428a7fc83de773a4b5eab308263bda0d5a2912eb5f8999d4567b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should not return a \u0060Result\u0060. Fix this in the next semver \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":"crates/ignore/src/gitignore.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ac68a257a89dc319adc0162cd5fb24cca9149da3f3a0c54df640a51cf96ece"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should not return a \u0060Result\u0060. Fix this in the next semver \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":"crates/ignore/src/overrides.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1b5af1db54dfffa986efc4d0126d2968ae9a6ed7f40a0b8e31e642f2973822"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In the next semver breaking release, we should drop this pool and \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":"crates/globset/src/lib.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2161304cbdbacfe96574ef096133f896f7e326911811e2f3b9b1b676bc117b8"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060Cargo.toml\u0060 makes this repository a deployable product (line 29)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1f320edebd162aecb630322055fab9fa4bd5274ac8a03cd339206970700a5"}},{"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":"703b990f6d9a60db46de372b4bc3713bc769740b61be7dfed2b23b523664ac12"},"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":"0984eabafd67a8b6e60a93d4640d3de9213aaba4e11257f5cc43ee654aeb4b14"},"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":"7850ea9e8179531389bfa2debfa5883eb354454d32b0dba110be899f88bd849d"},"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":"dd65e2f04abdf477e5d882fff12a00d1ee228e0a527014aeb9b4139224ebe812"},"taxa":[{"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":"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":"bc26593caf509b487cb3dff9d1a587737a02c72fc5e13e59c1a151f7d6412ad4"},"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":"739aba50c2202d8610042c78e67dcc0b8bf8b843e2101ae1543a28454827d20e"},"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":"6bc3b539f953f180f304780b633bbb65e6d2911ce57503f2f0e4a05dfd504060"},"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":"ab23c85e93624ae9562a005093ec7654ca2d931a76859bbd011f1fb02af874f0"},"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":"28fb95c74cf7e51a3f6e58d6d5d9aaba698bdc10ef21fbd45c72dc90736c26c6"},"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":"2af95c12f3c1ea89385cfc48dc29f37c45243f4f678813a45e56bcba7665cfc7"},"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":"a5ff6c36cc77c52281fa395ac6b9e1e18754b22fb93caffb8d30a7715d1e22e8"},"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":"a4e4dc41b2951adb95b298fac0913d1ce8bd00a8de3d7fe2087e44d2e1798725"},"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":"1375048b9ca8ef192c23faf83af425d2e99a11eb2f6e7951f3d837d8c63c990e"},"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":"3c70ed0f5a51be34c577483387b3783f573adcdf4137566e200501398c2966fd"},"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":"482e3b19efd040fb2215efbc5e65f5b9996234817368c5a9198eb89910e46231"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"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":"5be03ab325ce0dd57044d4e411f1428508ecf7870bea56774afff406be2e7ce3"},"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":"dcd1e2dcb2fd739db1a6722eff1fbc3a2f9a75dde34e7ca8982dde7b0003fe11"},"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":"17f54fb2cbcb3a3ac79db6ee63e1de2d72883c1f15bc6adcd1384335d0b9f95e"},"taxa":[{"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":"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":"75369c09bb288495c1ec96550eb2aa9585bb73f2d0abcdd876376a94900b52cc"},"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":"e6b04ceabd48b850b4e88aa2e1d9437334d08e2b59fbb9597a5d1c093db92f18"},"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":"338407871e9c53d2625a5754ccc8f84f16e799149817c1d1e310aef9e6213485"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 65 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; 65 of the 78 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: crates/globset/src/serde_impl.rs, crates/printer/src/hyperlink/aliases.rs. 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":"crates/globset/src/serde_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e38ebe43f5d0f248bd50f35d8e50f723b0c72b408305ae92f959c49d9531c13"}},{"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":"crates/printer/src/hyperlink/aliases.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a63aecfa5af51294e0a37a102a8ea4573f0266ea7f8f1121ce612d003a720cf"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61d9c64c1de88e7edb9c757178d6ec3103868cef4ae7e825aeeac5d15e61fb7d"}},{"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":"db02e6492231578e3817ac8880f1f13ebd3c9a30b7bda979918342d1dce5f2dd"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 2 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"X5","level":"note","message":{"text":"Ruby\u0027s type checker does not check nil everywhere: This repository commits no Sorbet configuration (\u0060sorbet/config\u0060) and no \u0060Steepfile\u0060, so nothing type-checks its 1 Ruby product file(s): a nilable value reaches a method call silently and raises \u0060NoMethodError: undefined method \u2026 for nil\u0060 the first time it is nil. A \u0060# typed:\u0060 sigil does nothing without a \u0060sorbet/config\u0060 beside the code; a Steep run configured only on a command line is not something this check can read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"32b27113b1bc22f400935e8620d19eae7fd3ef145cc36018609c445ea8cd4af1"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-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-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":27,"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."]}]}