{"$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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"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":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"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":"index.fffExtension (cyclomatic 193): index.fffExtension has cyclomatic complexity 193 (threshold 15). Of this number, 107 points are the body\u0027s own statements and 86 belong to 28 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"72eb721141c8f1a740a825d24ac81148ae51ab1265b36207f2d65e2914a9f03b"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::watcher::background_watcher::handle_debounced_events (cyclomatic 88): fff_search::watcher::background_watcher::handle_debounced_events has cyclomatic complexity 88 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cff679b1782ff0332c3e101039f51db702a1d6a9c1fbd23a79f763e016c6d2"}},{"ruleId":"D1","level":"warning","message":{"text":"FffServer::perform_grep (cyclomatic 68): FffServer::perform_grep has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent 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/fff-mcp/src/server.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1574a82e37fe7e06beafa793a318b30f38d89c35fce2f3e506aeef63ded23c6c"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::score::match_and_score_in_arena_inner (cyclomatic 50): fff_search::score::match_and_score_in_arena_inner has cyclomatic complexity 50 (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/fff-core/src/score.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"31133f7362588d430d9fdd543502cda06519c69e02e0e87ca497ff49d33a40d2"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::grep::fuzzy_grep::fuzzy_grep_search (cyclomatic 44): fff_search::grep::fuzzy_grep::fuzzy_grep_search has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/grep/fuzzy_grep.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ab7cda4924f41f21d0e6c0ca4e216749b6662810418ffa108952d8d15677f1"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::walk::zlob::walk_collect_files (cyclomatic 30): fff_search::walk::zlob::walk_collect_files has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/walk/zlob.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcb8e791eef30cf4dc341a074354c32383c2183df716e8d2d9acf0ca6f3a359"}},{"ruleId":"D1","level":"warning","message":{"text":"GrepFormatter::format (cyclomatic 30): GrepFormatter::format has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/output.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c8ca5940837ecb7cabd3adfc43d956b877416e73b0b0bfccda72f4c133f115"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::grep::prefilter::prefilter_files (cyclomatic 29): fff_search::grep::prefilter::prefilter_files has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/grep/prefilter.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0476f9bcd97325ccbfc839480118c40250fc382ecd83e78b293d31a8161636e5"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchScope::patterns (cyclomatic 29): SearchScope::patterns has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent 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/fff-mcp/src/scope.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60e62adcdd42f46a923782933383cf8ee13c7c02f81b4b2db22bb44a56b85e3"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::grep::grep::perform_grep (cyclomatic 27): fff_search::grep::grep::perform_grep has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/grep/grep.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"184e5a564a9b306bde70cdef5411a2683ea31681535e7548440827ab0799750b"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_mcp::main (cyclomatic 26): fff_mcp::main has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/main.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c47b9c79bf4df4dc4ff7d9c72aa41752335874b2d1819b909586da5ae9c76b"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanJob::run (cyclomatic 23): ScanJob::run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/scan.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"492a12e2b11f719334ba252cd7b2b47efb55ef612bcccff02d3b8ba9084caf32"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryParser::parse (cyclomatic 23): QueryParser::parse has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-query-parser/src/parser.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a239fbef5e8fb104a24bd302d7738d41b51fa7a8df207e5fa25788373a680f6b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::assignment (cyclomatic 22): Parser::assignment has cyclomatic complexity 22 (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/fff-core/src/definition/parser.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2118789d84985a722525942099c1df575740804e622c70dc6ea6441faf5c7aa"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_query_parser::parser::parse_token (cyclomatic 21): fff_query_parser::parser::parse_token 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/fff-query-parser/src/parser.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf039adf0b81e4492b68e86809c15356bb06b24f3b65e7a0b10b4c744f076b7"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::c_function (cyclomatic 20): Parser::c_function has cyclomatic complexity 20 (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/fff-core/src/definition/parser.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"470cb5ae0635dfb1a836944a419a2e0030007dafa801b81ccc334f6470978b64"}},{"ruleId":"D1","level":"warning","message":{"text":"BigramIndexBuilder::compress_in_pool (cyclomatic 20): BigramIndexBuilder::compress_in_pool has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/index/bigram_filter.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"879b4a351f81e42a3db6e0b1838e7ea1b46ed17f296f0269ce583e209e0ce793"}},{"ruleId":"D1","level":"warning","message":{"text":"query.normalizePathConstraint (cyclomatic 20): query.normalizePathConstraint has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/query.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d65a1593bd6288f5fbe3da79a0721e97bbff5da0907294443af8fa59b8ab60"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_c::fff_create_instance_with (cyclomatic 19): fff_c::fff_create_instance_with has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/lib.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dbfa73364c3f1254cf515e583a91c86f977bad730029340b4aec738d487c78"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::score::fuzzy_match_and_score_dirs (cyclomatic 19): fff_search::score::fuzzy_match_and_score_dirs 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/fff-core/src/score.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"0771a07d4f842066203da30cb45ed6864f3c701e5d0751e60cc4e2e8a86c2fe9"}},{"ruleId":"D1","level":"warning","message":{"text":"FilePicker::for_each_dir (cyclomatic 18): FilePicker::for_each_dir 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/fff-core/src/file_picker.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"7116ab9c2d3ad01b8f5e891657a8bd3de0df5d45d628388a2b76a1cede2931a8"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::git_recency::compute_git_recency (cyclomatic 18): fff_search::git_recency::compute_git_recency 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/fff-core/src/git_recency.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a402469187b45510edc6d64ccdbcd75aecc142794c1c02c6e237d8c2501896"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_mcp::output::format_files_with_matches (cyclomatic 18): fff_mcp::output::format_files_with_matches 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/fff-mcp/src/output.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9893f57e9a11e2ce551238ab682c564dff42685a5e97bd9e2669046fd9a21f"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_query_parser::parser::parse_token_without_negation (cyclomatic 18): fff_query_parser::parser::parse_token_without_negation 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/fff-query-parser/src/parser.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e581561b2d246c845d1489cd45730a81eca1a67d60132e90a88790beda9359"}},{"ruleId":"D1","level":"warning","message":{"text":"ffi.ffiCreate (cyclomatic 18): ffi.ffiCreate has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0f3b99026b3cec3afdf53cedeed2c59d17f304f2a46ff33e076c64eb3f2897"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_nvim::bin::grep_profiler::main (cyclomatic 17): fff_nvim::bin::grep_profiler::main has cyclomatic complexity 17 (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/fff-nvim/src/bin/grep_profiler.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1523a93edd663854c4d6c626cd965610a29048e24d203598ae0f63875478745"}},{"ruleId":"D1","level":"warning","message":{"text":"ffi.ffiCreate (cyclomatic 17): ffi.ffiCreate has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ea9aa6a48cfe14bb176f07d1bacd591bd9bc70a61e9ad7f9e6cb58c6df9994"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_c::fff_health_check (cyclomatic 16): fff_c::fff_health_check 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/fff-c/src/lib.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a767cac3fca22b74675cf3fc8c43d421fab2323db3388590c113778b69d16611"}},{"ruleId":"D1","level":"warning","message":{"text":"SinkState::extract_context (cyclomatic 16): SinkState::extract_context 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/fff-core/src/grep/sink.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2662881cbfcbd1dffde58d2467471f4f1e72a2a25cba9c85b188df072e838f2d"}},{"ruleId":"D1","level":"warning","message":{"text":"BackgroundWatcher::create_debouncer (cyclomatic 16): BackgroundWatcher::create_debouncer 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/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e0e8d5ef9b72b23eb92ec0a9bfb36c218075bfa943b32a557ce1a57b8f3803"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::watcher::background_watcher::index_new_directory (cyclomatic 16): fff_search::watcher::background_watcher::index_new_directory has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d68f40de429f31d2927318846008498db00b34873c5df49f9c050207d83b0b9"}},{"ruleId":"D1","level":"warning","message":{"text":"FffServer::find_files (cyclomatic 16): FffServer::find_files has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/server.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd29d729da93fe92e74e7c65e491618140ceecd555c887a2e75546f359a8ac6"}},{"ruleId":"D2","level":"warning","message":{"text":"index.fffExtension (cognitive 216): index.fffExtension has cognitive complexity 216 (threshold 15). Drivers by points: if/else 102 (130 pts), ternaries 30 (42 pts), boolean chains 35, error handling 5 (8 pts), loops 1 (nesting depth added 43). Of this number, 126 points are the body\u0027s own statements and 90 belong to 28 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c6f95330a8981dad14b88c985a4355ba11836b674512a9851cd85300cabc9e"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::watcher::background_watcher::handle_debounced_events (cognitive 181): fff_search::watcher::background_watcher::handle_debounced_events has cognitive complexity 181 (threshold 15). Drivers by points: if/else 54 (119 pts), loops 10 (26 pts), boolean chains 19, match/switch 5 (17 pts) (nesting depth added 93). To reduce it, split the body into named stages: move each independent step or branch into 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/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acaa5f0a0abe19351ea4a75c6484d27ab0ae385fee36acf39a6c72b5ac6fcae"}},{"ruleId":"D2","level":"warning","message":{"text":"FffServer::perform_grep (cognitive 110): FffServer::perform_grep has cognitive complexity 110 (threshold 15). Drivers by points: if/else 47 (78 pts), boolean chains 26, loops 2 (4 pts), match/switch 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/server.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"84edc2957d0ef5a6fe6454dcdd482a4928c189c476e14f6f88090dba5262137c"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::grep::fuzzy_grep::fuzzy_grep_search (cognitive 107): fff_search::grep::fuzzy_grep::fuzzy_grep_search has cognitive complexity 107 (threshold 15). Drivers by points: if/else 38 (89 pts), loops 7 (12 pts), boolean chains 6 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into 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/fff-core/src/grep/fuzzy_grep.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"232ec66117d6c15bbe3b7f457479baddbe9b5a0126d8600d6d06b895967c9757"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::score::match_and_score_in_arena_inner (cognitive 73): fff_search::score::match_and_score_in_arena_inner has cognitive complexity 73 (threshold 15). Drivers by points: if/else 46 (54 pts), boolean chains 18, match/switch 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/score.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4af7ebdf0a4830d4a0e68a60b2d883d68a0e1a051af00bfc57729537973823"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::grep::prefilter::prefilter_files (cognitive 72): fff_search::grep::prefilter::prefilter_files has cognitive complexity 72 (threshold 15). Drivers by points: if/else 15 (48 pts), loops 6 (16 pts), boolean chains 7, match/switch 1 (nesting depth added 43). Of this number, 70 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/fff-core/src/grep/prefilter.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd151be69379dcad0be95ab4fca2bb53befc8a13b358fb85f392ee80464b9c91"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchScope::patterns (cognitive 66): SearchScope::patterns has cognitive complexity 66 (threshold 15). Drivers by points: if/else 25 (48 pts), loops 5 (10 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into 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/fff-mcp/src/scope.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"756d5cdfa5f2dce359d92a909b5dde9178ddbafc1d675480f6b08bf680691d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::grep::grep::perform_grep (cognitive 46): fff_search::grep::grep::perform_grep has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 10, loops 3 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/grep/grep.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b048664f18b684fb40c2f6ed40e563af6fd0e642f1a52bb1bc3b093598f6ddf"}},{"ruleId":"D2","level":"warning","message":{"text":"GrepFormatter::format (cognitive 46): GrepFormatter::format has cognitive complexity 46 (threshold 15). Drivers by points: if/else 26 (35 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/output.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce41a0f28ec4703b85caa228a6da502e600e680ffc3b1a08b75155d1a2370bfd"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_mcp::output::format_files_with_matches (cognitive 46): fff_mcp::output::format_files_with_matches has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 2 (6 pts), boolean chains 4 (nesting depth added 25). 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/fff-mcp/src/output.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2197e3d31592d230933d16a64ab87d0437e623685096c4d7e734e421b5bad31"}},{"ruleId":"D2","level":"warning","message":{"text":"BackgroundWatcher::create_debouncer (cognitive 45): BackgroundWatcher::create_debouncer has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 3 (7 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into 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/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dd62b9557fc9380045ef1d896d94f29849904e1a7f65d880f6dc1b789659bc"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::simd_string_utils::memmem::find_packed_pair_avx2 (cognitive 41): fff_search::simd_string_utils::memmem::find_packed_pair_avx2 has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 4 (11 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (fff_search::simd_string_utils::memmem::find_packed_pair_neon) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/simd_string_utils/memmem.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"377ccac928db3aa58f4ccee3271b7a8a24729233e39893d4390c23fa2deaea77"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::simd_string_utils::memmem::find_packed_pair_neon (cognitive 41): fff_search::simd_string_utils::memmem::find_packed_pair_neon has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 4 (11 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (fff_search::simd_string_utils::memmem::find_packed_pair_avx2) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/simd_string_utils/memmem.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d39876238d7b23084c8096c7295e6f44aaee3cc535b452969dba588a386fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_mcp::main (cognitive 41): fff_mcp::main has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (29 pts), match/switch 5 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/main.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7f72f0d7d2ba3adb9150dd657d003ba251435943fdc4aa5489eb52677e1ab9"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryParser::parse (cognitive 41): QueryParser::parse has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (33 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-query-parser/src/parser.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bd87eefc8b12a383da024fb027a062acd3e2f15d660eeb9532d6663230b97a"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::walk::zlob::walk_collect_files (cognitive 40): fff_search::walk::zlob::walk_collect_files has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (23 pts), match/switch 5 (9 pts), boolean chains 7, loops 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/walk/zlob.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"068ff6af35fcabdcc374e887c2bd1b784d6eef410ee5ef437b6b4a94212f2876"}},{"ruleId":"D2","level":"warning","message":{"text":"FilePicker::for_each_dir (cognitive 39): FilePicker::for_each_dir has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16041106e85909abc75f956ac7f811de823608eb0e25e7a416d8d855aae1455"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::index::bigram_query::expand_class (cognitive 38): fff_search::index::bigram_query::expand_class has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 4 (10 pts), match/switch 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into 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/fff-core/src/index/bigram_query.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c409f618da6655ea1939f765f33e34b4faba7b3c146b235272cb52e2abd54b9"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::git_recency::compute_git_recency (cognitive 35): fff_search::git_recency::compute_git_recency has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/git_recency.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5054c92f89cb4ffff4a977a78390f10f4e4335ab3ad8d55510ad3ceec79b3f"}},{"ruleId":"D2","level":"warning","message":{"text":"BigramIndexBuilder::compress_in_pool (cognitive 33): BigramIndexBuilder::compress_in_pool has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (6 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/index/bigram_filter.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"07945b43f89ccf8f0baed7a87450fdfbefc0053c48375e62565ac40e387de464"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::score::rank_by_frecency (cognitive 32): fff_search::score::rank_by_frecency has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/score.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f9d93cd19111df3fa2ec670055d43c6d8a843f07ad5e5aeb8d9d4d9674ea1a"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_c::fff_create_instance_with (cognitive 30): fff_c::fff_create_instance_with has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 3 (5 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/fff-c/src/lib.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fa3d35e115eb97c5124e4f8ce4358b06c414216b3f932917a22231e296c471"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_c::fff_health_check (cognitive 30): fff_c::fff_health_check has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 5 (8 pts), boolean chains 2 (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/fff-c/src/lib.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfa1aad8e093165ad75207f8238bcc0f866dc80345d4aaecd19e21b756492e1"}},{"ruleId":"D2","level":"warning","message":{"text":"SinkState::extract_context (cognitive 30): SinkState::extract_context has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (6 pts), boolean chains 5, loops 2 (4 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/fff-core/src/grep/sink.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6064c954e5bcc1218ce362e0378c067679b1399587fb0286a92e9e56f7f53f"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_nvim::health_check (cognitive 30): fff_nvim::health_check has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 6 (10 pts), loops 2 (8 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/lib.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"47483e08ba34b85fa90225d32de5174eca5493fd92bf0dddcda3c90e8dbbff84"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanJob::run (cognitive 29): ScanJob::run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 8, match/switch 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/scan.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f3ff46e5a38f0b5f7687d1a40668d74d485acfe40f55c763d72a5282589002"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchRegistry::dispatch (cognitive 27): WatchRegistry::dispatch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/watch.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0d259ccfc79b15a3be61a96fb3ede57639e93cc22d9c8a41d1b3cceb72f581"}},{"ruleId":"D2","level":"warning","message":{"text":"SharedEnv::get_or_open (cognitive 24): SharedEnv::get_or_open has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (8 pts), boolean chains 2, 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/fff-core/src/dbs/env_pool.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0844707d8d839c59050fb855583862db3202ceb011648c2ac957b118cf5244ba"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::score::fuzzy_match_and_score_dirs (cognitive 24): fff_search::score::fuzzy_match_and_score_dirs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19, match/switch 2 (3 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/score.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce9520114c530e66c75c8f0df3c14be0a470ac0f401336afc4037c12435649f"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_mcp::healthcheck::run_healthcheck (cognitive 24): fff_mcp::healthcheck::run_healthcheck has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/healthcheck.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"992bca051763366256033531efc599bf449c857e7a99baf09358cc1fb5bd53e3"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_nvim::bin::rescan_probe::main (cognitive 24): fff_nvim::bin::rescan_probe::main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (8 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/fff-nvim/src/bin/rescan_probe.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4000cc7b8e2abb3e3051a748eca6455e2bb72be31d88ebe0fdfef125c94b421c"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_query_parser::parser::parse_token (cognitive 24): fff_query_parser::parser::parse_token has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-query-parser/src/parser.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d9ce83b77ab81e0c7e214b69994dba7bd9329c59d294ae9c7f94b623b64201"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_query_parser::parser::parse_token_without_negation (cognitive 23): fff_query_parser::parser::parse_token_without_negation has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-query-parser/src/parser.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f20a0529341998d50d0d48732100b227a0e1763a2c9523c4bc4a7f76434772"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchSub::filter_mask (cognitive 22): WatchSub::filter_mask has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (10 pts), match/switch 1 (nesting depth added 11). 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/fff-core/src/watcher/watch.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44537d3713fcb18fa9a54eb79ffcd7e78a7f6923d1940651d2eed3b4f1729fc"}},{"ruleId":"D2","level":"warning","message":{"text":"PathShortenStrategy::shorten_path (cognitive 22): PathShortenStrategy::shorten_path has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 4 (5 pts), loops 1 (2 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/fff-nvim/src/path_shortening.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"594eaf2d52d8950c811b1ed36a99bcf936b1c5eb7a0ecfec0a42d8582f15cc81"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_nvim::bin::grep_profiler::main (cognitive 22): fff_nvim::bin::grep_profiler::main has cognitive complexity 22 (threshold 15). Drivers by points: loops 12 (16 pts), if/else 4 (5 pts), boolean chains 1 (nesting depth added 5). 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/fff-nvim/src/bin/grep_profiler.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"388ea5e7a92c8502bebbd772d4f4204275c50635cc7bbcc749014b181aade808"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::assignment (cognitive 21): Parser::assignment has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). 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/fff-core/src/definition/parser.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa21e77d586bf66afa32349342a3f4871a132abc1eaf5cc13f3ea649190b03e"}},{"ruleId":"D2","level":"warning","message":{"text":"FffServer::find_files (cognitive 21): FffServer::find_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, 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/fff-mcp/src/server.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb6fa2959b38417fec82f6535152b6850282585fdc421fcd2abb9c0fb2b637a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::c_function (cognitive 20): Parser::c_function has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, match/switch 2 (5 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/definition/parser.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"021d51f289ae3b6af0dbcfa808c9d9fa91b0c8f01801aa589bcdd8825a21f902"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::index::bigram_query::collect_first (cognitive 20): fff_search::index::bigram_query::collect_first has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (fff_search::index::bigram_query::collect_last) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/index/bigram_query.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dd15229e527d2148987540eb5651e6047d8e83a6ea2305940660417cfc1619"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::index::bigram_query::collect_last (cognitive 20): fff_search::index::bigram_query::collect_last has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (fff_search::index::bigram_query::collect_first) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/index/bigram_query.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d85746835539f5ec9af8d027ab217751b257bbbb1f5c4dec6a2bf9f282c61c"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::score::fuzzy_match_byte_offsets_for_page (cognitive 20): fff_search::score::fuzzy_match_byte_offsets_for_page has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/score.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5874378f85c3a88d29975a6c5e46029ab635bc883fdbed397fa754a461d683"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::watcher::background_watcher::index_new_directory (cognitive 20): fff_search::watcher::background_watcher::index_new_directory has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f4d4556245bcdc6315c4a844200bec9c7b3a3b27fa70828dde2903d21ff3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"query.normalizePathConstraint (cognitive 20): query.normalizePathConstraint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/query.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65d83610b92ec7f1876e13ac87b57d1a7850f6d793beaf1fe02d2c4d6342348"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::qualified_name (cognitive 18): Parser::qualified_name has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/definition/parser.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"410065ad185178422695b0779f2591597501444ec2d5b009513dd98ce9ad2f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::grep::grep::grep_search_parsed (cognitive 18): fff_search::grep::grep::grep_search_parsed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 3, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/grep/grep.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b17d7edf85e0d9162704dd5b61d771fc7326fe99ec44f12c0e4f973028679a3"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::index::bigram_query::decompose_literal (cognitive 18): fff_search::index::bigram_query::decompose_literal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/index/bigram_query.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bee5c99804e630e1e004fbb8aa7c9c738e20c1801498af99030e8562214e7d"}},{"ruleId":"D2","level":"warning","message":{"text":"ffi.ffiCreate (cognitive 18): ffi.ffiCreate has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9, if/else 5 (6 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4acace7d11731b2f45a6fe7353ab2415c71b006feb6ee908e314502480bd571"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::grep::grep::replace_newline_escapes (cognitive 17): fff_search::grep::grep::replace_newline_escapes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/grep/grep.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba0ce9af2ba660a11c651ecb01f41af2183bdafecc3cf602e921801df096c53"}},{"ruleId":"D2","level":"warning","message":{"text":"GrepFormatter::format_with_context (cognitive 17): GrepFormatter::format_with_context has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/output.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b74887841bd80da8f859749fcf1c3b7abe91b7a528eb2bcbc3eefb993187141"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_mcp::server::suggest_other_files (cognitive 17): fff_mcp::server::suggest_other_files has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/server.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f03e65246bc2ae61295dfc98c778e0b32b84ecd5dc2ed17b661689c276e765d"}},{"ruleId":"D2","level":"warning","message":{"text":"ffi.ffiCreate (cognitive 17): ffi.ffiCreate has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10, if/else 4 (5 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4b09fc714183ccd344ab0b9f22a394be6d8e7ef9f56ec2c45780d69d856930"}},{"ruleId":"D2","level":"warning","message":{"text":"BackgroundWatcher::new (cognitive 16): BackgroundWatcher::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b7aa97cae228a7b1c649f164199a5d115e1085015a8123d97955fa1b608c08"}},{"ruleId":"D2","level":"warning","message":{"text":"CallbackDispatcher::start (cognitive 16): CallbackDispatcher::start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/watch.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb38042e37ef707c41f7a097e980825c0c52c2c2d2606a0363879e10b54b5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::index::bigram_filter::build_bigram_index (cognitive 16): fff_search::index::bigram_filter::build_bigram_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/index/bigram_filter.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41e12a4c617946ea153dfb825a35a4bf2a4a065ad56351582ab0211cf51a39f"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::index::bigram_query::decompose_concat (cognitive 16): fff_search::index::bigram_query::decompose_concat has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/index/bigram_query.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"3866923a9ccad7b3e04fec1ccfbf3b3d64d4300c14bfcba96b494fb89451c0c7"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_nvim::hex_dump::format_hex_dump (cognitive 16): fff_nvim::hex_dump::format_hex_dump has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/hex_dump.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41a3700de9ec06354bc1d135dd2cdb4c06df00b1b3fddec5ca82c253ce2bd29"}},{"ruleId":"D2","level":"warning","message":{"text":"FileFinder::health_check (cognitive 16): FileFinder::health_check has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 7 (nesting depth added 4). 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/fff-python/src/finder.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21115cacfe64a5686b56193417be64f49c9a2e1c5ef3f607f1fce58346b4d21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.fffExtension: FunctionTooLong \u2014 fffExtension runs 875 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 775 over it, 8.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1862162280e01b2afabe4a4d97cb2ba5ba1bd6f842f83b15f973b5255cb48a99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FffServer.perform_grep: MethodTooLong \u2014 perform_grep runs 346 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 246 over it, 3.46\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/fff-mcp/src/server.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"877175dad2661bddbb56f01d10b87e5df5beda98de272ee72a5e790a370609a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/file_picker.rs: FileTooLong \u2014 1628 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 1128 over it, 3.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"260cfad006862ec64315e11031283302003139718bfcf91fbd3edc722affea09"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_search::watcher::background_watcher::handle_debounced_events: FunctionTooLong \u2014 fff_search::watcher::background_watcher::handle_debounced_events runs 281 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 181 over it, 2.81\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/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb22aa7a048bdb8ea59d755cadf4306adbd6e17a3a05eb6c3935ab3148c889c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ffi.ts: FileTooLong \u2014 1299 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 799 over it, 2.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0773995d7ba3fa8475fee56bb0a9c680a544e34ed99d90e7716ef27ecf11fa9b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FilePicker: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.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/fff-core/src/file_picker.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"17016fc91424aecb960a20ef41b46c3320dd8ab0bdc8fcedb4e5aff445b0bea2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.ts: FileTooLong \u2014 1169 significant lines (blank, comment-only and punctuation-only lines excluded), about 75% of them inside a single declaration: fffExtension (322-1640). The bar is 500 significant lines; this is 669 over it, 2.34\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":"packages/pi-fff/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ffdbaf60565da17e83ecba9c427c0eb2b904f3621c974a837c62d840ade064"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_search::score::match_and_score_in_arena_inner: FunctionTooLong \u2014 fff_search::score::match_and_score_in_arena_inner runs 225 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 125 over it, 2.25\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/fff-core/src/score.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cb50df121b11715fb5dc4f8022044051decb56c5d320ff392fa7e0b68950c1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FilePicker: ClassTooLong \u2014 898 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), 71 methods, 5 blocks, lines 687-2198. The bar is 400 significant lines; this is 498 over it, 2.25\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/fff-core/src/file_picker.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02ff63fb5c14bca8b389dba9beadb4de7b9f6665b10950eb4f61b665a3759fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.rs: FileTooLong \u2014 1087 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 587 over it, 2.17\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/fff-mcp/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3a5f390ee4421b620d89ffbd6979a45720c7589b13cca44b307c3986f73e47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_search::grep::fuzzy_grep::fuzzy_grep_search: FunctionTooLong \u2014 fff_search::grep::fuzzy_grep::fuzzy_grep_search runs 217 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 117 over it, 2.17\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/fff-core/src/grep/fuzzy_grep.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81ea059ba9843af00d5f832c0d4e4f76d9848e955f12f743919595e1a9a464f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_nvim::bin::grep_profiler::main: FunctionTooLong \u2014 fff_nvim::bin::grep_profiler::main runs 209 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 109 over it, 2.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/bin/grep_profiler.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2744d9c51d6f3393589ca367f711b7dcfa37b8dfb247711e1bf835b21f27a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ffi.ts: FileTooLong \u2014 1038 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 538 over it, 2.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29596b5325b139028fec2684d1bd6f6fbd41dc4959761d0d6cffd0ad9e67c6ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1036 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), declaring 46 free functions. The bar is 500 significant lines; this is 536 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d92717270daca1128593a123be5990569f6e03c53952628581dfa6f9c85b17"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/score.rs: FileTooLong \u2014 951 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 451 over it, 1.90\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/fff-core/src/score.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1e8c19c18c3d764d0a1cf9c02c9db6100182761d5cd58820329169993d8012"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: fff_c::accessors: TooManyFunctions \u2014 56 free functions. The bar is 30 free functions; this is 26 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/accessors.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a98c3f340aeb7fa84078e6fd1ee09d237bc27c142b1c90165029013c96a68ec"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FileFinder: ClassTooLong \u2014 720 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), 23 methods, 3 blocks, lines 152-1084. The bar is 400 significant lines; this is 320 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-python/src/finder.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c37b5b50f9ed404be12415118a516331af15a849fed7ed9511ea08cdde4ac4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 838 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), declaring 37 free functions. The bar is 500 significant lines; this is 338 over it, 1.68\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/fff-nvim/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcb572b0e3aa9a866442826ad66e1845ce6550dd8689ff1b47edebdab35ddaa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index/bigram_filter.rs: FileTooLong \u2014 837 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 337 over it, 1.67\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/fff-core/src/index/bigram_filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4e1c7c586bcd1d8481fc9e212df86749c8ed78f93c443bbebebd8ce5359b6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/finder.rs: FileTooLong \u2014 832 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 87% of them inside a single declaration: FileFinder (3 blocks, 152-1084). The bar is 500 significant lines; this is 332 over it, 1.66\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/fff-python/src/finder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc6e356a27260cae5330cddc578fd06d8080f3a96cd09538eefd02b7e80b326"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FffServer: ClassTooLong \u2014 640 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), 11 methods, 5 blocks, lines 240-1096. The bar is 400 significant lines; this is 240 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/server.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"74219c805b97c1da33171021eb3bca473e31ad5057ae3c1dd6b460a9d41a85bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_nvim::bin::grep_vs_rg::main: FunctionTooLong \u2014 fff_nvim::bin::grep_vs_rg::main runs 153 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 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/bin/grep_vs_rg.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"a842534d80eb35a4458b8ad679b84332441ec46722b7fb884cfcd5b1d103f449"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: watcher/background_watcher.rs: FileTooLong \u2014 760 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 260 over it, 1.52\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/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75eed6fedfc8e0f2dde25f1441ee0fbe7b5948e073e92d9ffd5466f43f551f10"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FileItem: TooManyMethods \u2014 43 methods, declared across 2 files: src/types.rs (37), src/file_picker.rs (6). The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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/fff-core/src/types.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68eacd73f3afd237e00368e387792784b444ab2dc48fa16623bfe049e761104"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 701 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 201 over it, 1.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/fff-core/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"840156c0cbee594388d1f7f1ea9d3dd866ccb4ae0942c85471b14ab1bdde649a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_mcp::main: FunctionTooLong \u2014 fff_mcp::main runs 137 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 37 over it, 1.37\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/fff-mcp/src/main.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"481ed84196f32367549c5ef6212f0ba0b56042c13be1109d3f0fbdce3d853911"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GrepFormatter.format: MethodTooLong \u2014 format runs 131 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 31 over it, 1.31\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/fff-mcp/src/output.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b92e6fc90e9c8bc8ce14b23308d843a65556990272e7638bc7558d7e1bf028"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_search::grep::grep::grep_search_parsed: FunctionTooLong \u2014 fff_search::grep::grep::grep_search_parsed runs 130 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 30 over it, 1.30\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/fff-core/src/grep/grep.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"05729faf3fb6cb9d5bec7c7fcc98a9dc19ee9e6caa4bee4e888e797460f714db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_c::fff_health_check: FunctionTooLong \u2014 fff_c::fff_health_check runs 123 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 23 over it, 1.23\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/fff-c/src/lib.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3efe1f959df089df68d5643a8025ccb6c79e78a55a19d6d3340f6b94cbfb0ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_search::walk::zlob::walk_collect_files: FunctionTooLong \u2014 fff_search::walk::zlob::walk_collect_files runs 122 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 22 over it, 1.22\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/fff-core/src/walk/zlob.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d41a82412a5a11e9062c04bc9bd0c2560b40174e12ee7b0eb079cd04440593"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SearchScope.patterns: MethodTooLong \u2014 patterns runs 111 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 11 over it, 1.11\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/fff-mcp/src/scope.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"525f8ea04c0210c04789b2371e41d4a97cf4e855f79cf15d4d959766a58ebaca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FileSync.walk_filesystem: MethodTooLong \u2014 walk_filesystem runs 109 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 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":2289}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b597bc7246bf3ff75a80384d8c3b9470aeb7d341efed1e0008dca1630820af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_search::score::fuzzy_match_and_score_dirs: FunctionTooLong \u2014 fff_search::score::fuzzy_match_and_score_dirs runs 109 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 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/score.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5d328d6f91eae34570fd72d228740ae095fc5f6b3f5981ad42f14906da5a74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_search::grep::grep::perform_grep: FunctionTooLong \u2014 fff_search::grep::grep::perform_grep runs 108 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 8 over it, 1.08\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/fff-core/src/grep/grep.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17ac57656dc6750e738275c5f4b3d853d759a3bf439bf6c37cc417e97ab364b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FffServer.find_files: MethodTooLong \u2014 find_files runs 108 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 8 over it, 1.08\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/fff-mcp/src/server.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25a013630feb986cae2f93ca1f01dad7c72abce608e93d3a36eaf8b556d07e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScanJob.run: MethodTooLong \u2014 run runs 103 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 3 over it, 1.03\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/fff-core/src/scan.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b7ed9b5caef579067c0ec5ed46cd47f37e99b8387032670e9c7ee295bc0cd8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FileItem: ClassTooLong \u2014 409 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), 43 methods, 6 blocks, lines 256-919. The bar is 400 significant lines; this is 9 over it, 1.02\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/fff-core/src/types.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa308666a6629e17a6a056dd29ef3b46e0eb5a344af97bcd6dd658b5e7cf8f59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: grep/grep.rs: FileTooLong \u2014 510 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 10 over it, 1.02\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/fff-core/src/grep/grep.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbf6d6050811b2d18d9126fd911462c65fe33cc86c9428ad87dc087c12b7cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 20 shared lines): crates/fff-c/src/lib.rs:370-426 | crates/fff-c/src/lib.rs:506-552 | crates/fff-c/src/lib.rs:572-627 | crates/fff-c/src/lib.rs:695-750 \u2014 These 4 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/lib.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a60d2081667f077ea31065c5731f727311d619465c7f7f22c6a76346044bdcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/fff-c/src/lib.rs:1400-1422 | crates/fff-c/src/lib.rs:1471-1490 | crates/fff-c/src/lib.rs:1582-1604 | crates/fff-c/src/lib.rs:1654-1676 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/lib.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ee2b86f29aeaad74496a715211e7116b1feb173f6ece3114773738e598310d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/fff-c/src/lib.rs:1433-1442 | crates/fff-c/src/lib.rs:1501-1510 | crates/fff-c/src/lib.rs:1614-1623 | crates/fff-c/src/lib.rs:1686-1695 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/lib.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"07199e9d377c79a269d9f6b8753b3dc56b25068bc368321c51b123cb95c21c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/fff-nvim/src/bin/bench_grep_query.rs:76-140 | crates/fff-nvim/src/bin/bench_search_only.rs:6-16 | crates/fff-nvim/src/bin/grep_profiler.rs:16-26 | crates/fff-nvim/src/bin/grep_vs_rg.rs:31-41 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/bin/bench_grep_query.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8386bd7d95039a4a7021498ccc490b2174f78cc3b3278aea58427b15cd398e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/fff-python/src/finder.rs:357-395 | crates/fff-python/src/finder.rs:413-447 | crates/fff-python/src/finder.rs:465-500 | crates/fff-python/src/finder.rs:523-588 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-python/src/finder.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"09de18bcb4d1c9de5239857ae660593f5e800554da7880e18f59420d7a7416a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (87 corresponding lines): crates/fff-core/src/simd_string_utils/memmem.rs:85-180 | crates/fff-core/src/simd_string_utils/memmem.rs:189-275 \u2014 These two members are one piece of code written twice and then edited apart: 87 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/fff-core/src/simd_string_utils/memmem.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1578cb420bc988b5c82f2064404d214ef9ca0412b7d6dfb06789b3580b5cd59a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): crates/fff-core/src/score.rs:65-154 | crates/fff-core/src/score.rs:435-503 \u2014 These two members are one piece of code written twice and then edited apart: 69 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/fff-core/src/score.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb5a608d0e0e12eb5216b2fc67ab4434e96c2df2b0ec56691d66712b2726a2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (100 corresponding lines): crates/fff-nvim/src/bin/bench_search_only.rs:18-117 | crates/fff-nvim/src/bin/search_profiler.rs:22-140 \u2014 These two members are one piece of code written twice and then edited apart: 100 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/fff-nvim/src/bin/bench_search_only.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc7a80431b81ee7ae34fac2d3e5936322a90c949c5574757a2b2e7809e271eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): crates/fff-query-parser/src/parser.rs:270-340 | crates/fff-query-parser/src/parser.rs:388-447 \u2014 These two members are one piece of code written twice and then edited apart: 60 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/fff-query-parser/src/parser.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5c2713650f422e43a252377453c450af9c153ed0b7f18ddb55d8c9b6fa4675"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/fff-nvim/src/lua_types.rs:147-178 | crates/fff-nvim/src/lua_types.rs:205-233 \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/fff-nvim/src/lua_types.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"346be7d3a39201dd300e17178a9513ae717d36c428bb7897847fd80d8fab1d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/fff-core/src/score.rs:681-716 | crates/fff-core/src/score.rs:1163-1204 \u2014 These two members are one piece of code written twice and then edited apart: 36 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/fff-core/src/score.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47897208a3baa557dff30062b36a01c72adc05abda3e2eaba2df954863822c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/fff-nvim/src/bin/jemalloc_profile.rs:7-47 | crates/fff-nvim/src/bin/test_memory_leak.rs:8-47 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/bin/jemalloc_profile.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c892004faa04e13890a6c680a1c533ae919d3fcece8bc0a93456f22cf56f59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/fff-core/src/index/bigram_filter.rs:977-1006 | crates/fff-core/src/index/bigram_filter.rs:1010-1043 \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/fff-core/src/index/bigram_filter.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dc4255c1ac415f7c96d8942d54f299c8832da5208fee72442c2c5af8449aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/fff-nvim/src/lib.rs:411-436 | crates/fff-nvim/src/lib.rs:458-485 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/lib.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"8146967ebd3a7449f77ce8653e0a276c8d2f18099b163071e44e6648beadd006"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/fff-c/src/ffi_types.rs:317-337 | crates/fff-c/src/ffi_types.rs:645-664 | crates/fff-c/src/ffi_types.rs:759-780 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 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/fff-c/src/ffi_types.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a9162f45f474876baae8e3c5129626e72fadf8aec3e5fd1efd6c35fbced756"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/fff-nvim/src/bin/grep_vs_rg.rs:160-182 | crates/fff-nvim/src/bin/grep_vs_rg.rs:185-207 \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/fff-nvim/src/bin/grep_vs_rg.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"173f62a03c0266aa871e280c3dc3486fa3979419c3702984ec7d65e90d9cd196"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/fff-core/src/file_picker.rs:1565-1589 | crates/fff-core/src/file_picker.rs:1597-1621 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"75582ac73d1c749b071956045c66e994d86ff2ceb585ef9533acb7d5ce9d261b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/fff-c/src/lib.rs:923-940 | crates/fff-c/src/lib.rs:947-965 \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/fff-c/src/lib.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"09452b0834da25a5228c9673e8a826702edd95bb0683318380b308842e8a18b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/fff-core/src/index/bigram_query.rs:545-569 | crates/fff-core/src/index/bigram_query.rs:571-595 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/index/bigram_query.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"175538ca0a7e66d58052f88b7b2c33b7b275135f76ddedd7afc421e0e2694d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/fff-core/src/file_picker.rs:363-386 | crates/fff-core/src/file_picker.rs:393-413 \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/fff-core/src/file_picker.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5212aea62007f65158862129d0af31c8210f0fffe402bfeb9a95e2bbaa17bbed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/fff-nvim/src/lib.rs:780-797 | crates/fff-nvim/src/lib.rs:827-844 \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/fff-nvim/src/lib.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b5b253a35eb89271ae50efb6ac1a2949772632e9055ff5d869b79927e799b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/fff-core/src/dbs/frecency.rs:195-218 | crates/fff-core/src/dbs/query_tracker.rs:336-355 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/dbs/frecency.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5342f17b7f4f880c3a650cf99627b06af6ea79230a7f8bec07755bd2cf171ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/fff-core/src/index/bigram_query.rs:618-632 | crates/fff-core/src/index/bigram_query.rs:634-650 \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/fff-core/src/index/bigram_query.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"90125957b750980523af5aae39c11c2201006dbce51bda263ab4c48c4136c6ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/fff-core/src/simd_path.rs:249-263 | crates/fff-core/src/simd_path.rs:291-304 \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/fff-core/src/simd_path.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54265420922c5cc459a8a6ea77eb298507bb0f3d486c2aec31d14f17772020c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/fff-c/src/ffi_types.rs:190-202 | crates/fff-c/src/ffi_types.rs:722-734 \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/fff-c/src/ffi_types.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad58a720d1a3c07fde4a101caa558cd3f3e1430b3545dc275a3435fb15743b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/fff-c/src/ffi_types.rs:222-236 | crates/fff-python/src/conversions.rs:11-25 \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/fff-c/src/ffi_types.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b54fcf4d78087bddb83c219fa476ce27d4159b3db6af07e7c2a0c7fd33fba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/fff-c/src/lib.rs:885-897 | crates/fff-c/src/lib.rs:1092-1102 \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/fff-c/src/lib.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92bb985c7ad65935baa9450fc37b9b589e5ffc4cdb4bb94a4f43cb52ecc0804"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/fff-core/src/shared.rs:159-171 | crates/fff-core/src/shared.rs:175-187 \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/fff-core/src/shared.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d563137543bbd63c9f62852b6805f7f184db7691b9b94c6ea9d36ac54e8381"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/fff-mcp/src/file_search.rs:146-151 | crates/fff-mcp/src/server.rs:1465-1470 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/file_search.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47281239755befe46000cef9d5a151cdac94f14aedd6aa75c429a15d5e91f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/fff-core/src/grep/types.rs:153-170 | crates/fff-nvim/src/bin/grep_profiler.rs:85-105 \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/fff-core/src/grep/types.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc0995aaab2303ed09198e239909a8416dabcc9135c9fa76f31484aa6d6011c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/fff-c/src/accessors.rs:351-360 | crates/fff-c/src/accessors.rs:384-393 | crates/fff-c/src/accessors.rs:417-426 | crates/fff-c/src/watch.rs:304-313 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/accessors.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ccfb204bfb79f12dadeac0ce9417c5f536493506de200f45518ce27a5a5c85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/fff-nvim/src/bin/grep_profiler.rs:133-142 | crates/fff-nvim/src/bin/grep_vs_rg.rs:230-239 \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/fff-nvim/src/bin/grep_profiler.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"88665f1a290b998f8bc154ce40476889c0c521b5ee58d6eae1f621c2edce8961"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/fff-core/src/definition/parser.rs:496-502 | crates/fff-core/src/grep/classify.rs:90-96 \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/fff-core/src/definition/parser.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c327518e4f466c70c984b0da2309b3bb823932df7f84ffbb00a4e3c87501e6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/fff-core/src/index/bigram_filter.rs:691-696 | crates/fff-core/src/index/bigram_query.rs:78-80 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/index/bigram_filter.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5e5a22dcdb213118b8b3ede889a8d6ba6be2acd678a400a654c6cae49e5c62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47\u201348 lines \u00D7 2): crates/fff-nvim/src/bin/bench_search_only.rs:67-113 | crates/fff-nvim/src/bin/search_profiler.rs:89-136 \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/fff-nvim/src/bin/bench_search_only.rs:67\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/fff-nvim/src/bin/bench_search_only.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c4604a133c4f43f32ee4e6d5b597889ed9f4ab8ea30d59b04088459e1bbe44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): crates/fff-core/src/simd_string_utils/memmem.rs:134-180 | crates/fff-core/src/simd_string_utils/memmem.rs:229-275 \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/fff-core/src/simd_string_utils/memmem.rs:134\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/fff-core/src/simd_string_utils/memmem.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e944bd92a8cf7fd268bf9f985b130e3e82f7baea483b8854641f87400079a02e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201341 lines \u00D7 2): crates/fff-nvim/src/bin/grep_profiler.rs:307-346 | crates/fff-nvim/src/bin/grep_profiler.rs:352-392 \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/fff-nvim/src/bin/grep_profiler.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"435e92082b54627a35374a9494783ed50c9e9bcf8a1c51db3721f5fd50ae85ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): crates/fff-c/src/lib.rs:374-403 | crates/fff-c/src/lib.rs:576-604 \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/fff-c/src/lib.rs:374\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/fff-c/src/lib.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc20407a0cbd9a27126ebd7d438392fb9f39c02586f25d2ca5be9968135b877"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/fff-c/src/lib.rs:1313-1342 | crates/fff-c/src/lib.rs:1352-1381 \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/fff-c/src/lib.rs:1313\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/fff-c/src/lib.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"808839a27ad9549ccd7024c2c0efbaf4700d42e08fa3af19ca5746fb68f4df07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201329 lines \u00D7 2): crates/fff-nvim/src/bin/grep_profiler.rs:238-266 | crates/fff-nvim/src/bin/grep_profiler.rs:278-301 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/fff-nvim/src/bin/grep_profiler.rs:276\u0060 calls \u0060with_mode\u0060 and \u0060crates/fff-nvim/src/bin/grep_profiler.rs:236\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/fff-nvim/src/bin/grep_profiler.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"99705bb75741d28c9395e43750e6dbcd338f62e0abdb07e55e09b6d0131f12a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): crates/fff-nvim/src/bin/bench_search_only.rs:39-63 | crates/fff-nvim/src/bin/search_profiler.rs:63-85 \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/fff-nvim/src/bin/bench_search_only.rs:39\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/fff-nvim/src/bin/bench_search_only.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"840e0d7f9ba932891e3e2d43730af21ade21995431370cf65041337f8d0e8491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/fff-nvim/src/bin/grep_vs_rg.rs:346-370 | crates/fff-nvim/src/bin/grep_vs_rg.rs:394-418 \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/fff-nvim/src/bin/grep_vs_rg.rs:346\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/fff-nvim/src/bin/grep_vs_rg.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3bac9c2084441f3780be988bf7f52b359ae09c445d3a9cca8d160e5b47bb4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/fff-core/src/index/bigram_query.rs:549-569 | crates/fff-core/src/index/bigram_query.rs:575-595 \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/fff-core/src/index/bigram_query.rs:549\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/fff-core/src/index/bigram_query.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ee393f5012291fe253f416fa92e6fd1d7c11a4f5c667fe3a2c3c5baa16902a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/fff-nvim/src/lib.rs:937-957 | crates/fff-nvim/src/lib.rs:967-986 \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/fff-nvim/src/lib.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09b9b49808f190c3f433e598faa7d45c58f41d825b8556e3e224705dede706d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/fff-query-parser/src/parser.rs:314-334 | crates/fff-query-parser/src/parser.rs:416-436 \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/fff-query-parser/src/parser.rs:314\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/fff-query-parser/src/parser.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e55bf97fe071815702892a404b66293701603816a2dc31cb718775dbc5a338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/fff-core/src/grep/grep.rs:164-183 | crates/fff-core/src/grep/multi_pattern.rs:72-91 \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/fff-core/src/grep/grep.rs:164\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/fff-core/src/grep/grep.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d855368efc94f0354c232c0d5b8d1610bd33c6b38d776ad6a7bc6c3bee5915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/fff-core/src/score.rs:122-141 | crates/fff-core/src/score.rs:475-494 \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/fff-core/src/score.rs:122\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/fff-core/src/score.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd9b18a699fb468f279706642844e6b5e187ae5a31f0af5c4c348d7e65f895c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/fff-c/src/lib.rs:1405-1422 | crates/fff-c/src/lib.rs:1587-1604 | crates/fff-c/src/lib.rs:1659-1676 \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/fff-c/src/lib.rs:1405\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/fff-c/src/lib.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2e8ba5e0daa3ef33fd2b00bb62a10be98236a3a0fa47026e0000d18cade045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/fff-core/src/simd_string_utils/memmem.rs:88-104 | crates/fff-core/src/simd_string_utils/memmem.rs:192-208 \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/fff-core/src/simd_string_utils/memmem.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7636f8b127db8d8e1162ed2e0ea60cf721fcd293e4e6c91f0969707b1e3fb61d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/fff-core/src/score.rs:682-694 | crates/fff-core/src/score.rs:1164-1178 \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/fff-core/src/score.rs:682\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/fff-core/src/score.rs:1162\u0060 calls \u0060Fn\u0060 and \u0060crates/fff-core/src/score.rs:680\u0060 does not \u2014 after which the two agree again for 2 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/fff-core/src/score.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"661bb179012dd9f861555ffcbcd56fe2e6f52addf28dc531f3bc72e9ee53622a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/fff-python/src/finder.rs:381-395 | crates/fff-python/src/finder.rs:433-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/fff-python/src/finder.rs:381\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/fff-python/src/finder.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"8683b62e08d166bceef978ba2ab9eb03e6f8bafcedc8f352c157ee4e27d6a8f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/fff-c/src/lib.rs:924-937 | crates/fff-c/src/lib.rs:948-961 \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/fff-c/src/lib.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fc0db84dd9f0759084b6c430d6d105619bdf524d89f01bfcfebba2b74fcedf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/fff-nvim/src/lib.rs:781-794 | crates/fff-nvim/src/lib.rs:828-841 \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/fff-nvim/src/lib.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f356b330d40d03943a39cfe8564c7128432749e021f76ca2a04731b089b0423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/fff-query-parser/src/parser.rs:287-300 | crates/fff-query-parser/src/parser.rs:399-410 \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/fff-query-parser/src/parser.rs:287\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/fff-query-parser/src/parser.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"308f4c34aaac257784ceb8ba1bc6d63d96d80cb022266ce560e0c0dd645e4fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/fff-nvim/src/bin/grep_profiler.rs:418-430 | crates/fff-nvim/src/bin/grep_vs_rg.rs:169-180 | crates/fff-nvim/src/bin/grep_vs_rg.rs:194-205 \u2014 before extracting anything, compare \u0060crates/fff-nvim/src/bin/grep_profiler.rs\u0060 and \u0060crates/fff-nvim/src/bin/grep_vs_rg.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/fff-nvim/src/bin/grep_profiler.rs:418\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/fff-nvim/src/bin/grep_profiler.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfe80a878ce54c3fd5ba9a430e085a44c48a09b99a731c24bee01fe4b55471c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/fff-core/src/file_picker.rs:494-506 | crates/fff-core/src/file_picker.rs:531-542 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/fff-core/src/file_picker.rs:489\u0060 calls \u0060diff_paths\u0060, \u0060unwrap_or_else\u0060, \u0060clone\u0060 and \u0060crates/fff-core/src/file_picker.rs:530\u0060 does not \u2014 after which the two agree again for 2 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/fff-core/src/file_picker.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"787ba98e34fb29e3ec914626a1992da46128c2616a3fcd21f40265c01716308c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/fff-c/src/lib.rs:454-465 | crates/fff-c/src/lib.rs:515-526 \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/fff-c/src/lib.rs:454\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/fff-c/src/lib.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab913246679ed2935aafccaca88ee4e92475e9c2d8ee1a1024e6bdf4be6d1f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/fff-core/src/file_picker.rs:453-463 | crates/fff-core/src/file_picker.rs:2535-2546 \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/fff-core/src/file_picker.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"402c99c8c04d70bf4329a930a85c813400ba89d1b89f538eb427b0bcea32ef96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/fff-mcp/src/server.rs:339-350 | crates/fff-mcp/src/server.rs:993-1004 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060\u0026GrepParams\u0060 in one and \u0060MultiGrepParams\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/fff-mcp/src/server.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"add74785074a748a84120a1bc60a221e992cbe45921a6ac3fef4c7b05d5afbca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/fff-nvim/src/bin/grep_vs_rg.rs:331-342 | crates/fff-nvim/src/bin/grep_vs_rg.rs:379-390 \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/fff-nvim/src/bin/grep_vs_rg.rs:331\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/fff-nvim/src/bin/grep_vs_rg.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb31ca6111cc7b7a78ba02f6ca65bcd34d54eb9a93b8d2f0a264263589ebe30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/fff-python/src/conversions.rs:30-41 | crates/fff-python/src/conversions.rs:56-67 \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/fff-python/src/conversions.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a2ab4763eca33f35b87a247de668c45a7970b18db383030e6015dc9d689867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/fff-c/src/lib.rs:1401-1411 | crates/fff-c/src/lib.rs:1472-1482 | crates/fff-c/src/lib.rs:1583-1593 | crates/fff-c/src/lib.rs:1655-1665 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/fff-c/src/lib.rs:1401\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/fff-c/src/lib.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84cb881bb5fca3158518f3cea1a7d7c7f30144cdf97cd4eb6dc7feb0ac49c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/fff-c/src/lib.rs:372-382 | crates/fff-c/src/lib.rs:508-518 | crates/fff-c/src/lib.rs:574-584 \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/fff-c/src/lib.rs:372\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/fff-c/src/lib.rs:383\u0060 calls \u0060default_u32\u0060, \u0060default_i32\u0060 and \u0060crates/fff-c/src/lib.rs:520\u0060 does not \u2014 after which the two agree again for 3 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/fff-c/src/lib.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42faec0a4cb3a0732b46d758c057aa7766a5ba5bb94f46520edc371e6534966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/fff-c/src/lib.rs:696-706 | crates/fff-c/src/lib.rs:815-825 \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/fff-c/src/lib.rs:696\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/fff-c/src/lib.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aad0fa0b492944ce4fa77fa03f7ddd5e010150d7842ad7d518627953d0e6730"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/fff-nvim/src/bin/jemalloc_profile.rs:50-60 | crates/fff-nvim/src/bin/test_memory_leak.rs:50-60 \u2014 before extracting anything, compare \u0060crates/fff-nvim/src/bin/jemalloc_profile.rs\u0060 and \u0060crates/fff-nvim/src/bin/test_memory_leak.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060bytes\u0060 to \u0060usize\u0060 in one and \u0060u64\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/fff-nvim/src/bin/jemalloc_profile.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ec65438bb9fb02e69dcc06b841c30fa1223c51582dd9fa9c7490fe49a8af64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/fff-c/src/lib.rs:387-396 | crates/fff-c/src/lib.rs:460-469 | crates/fff-c/src/lib.rs:521-530 | crates/fff-c/src/lib.rs:589-598 | crates/fff-c/src/lib.rs:712-721 | crates/fff-c/src/lib.rs:838-847 \u2014 all 6 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/fff-c/src/lib.rs:387\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/fff-c/src/lib.rs:383\u0060 calls \u0060default_u32\u0060, \u0060default_i32\u0060 and \u0060crates/fff-c/src/lib.rs:457\u0060 does not \u2014 after which the two agree again for 2 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/fff-c/src/lib.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e138cfdd86dde94f9101d37929934551de4cb2ede03577f5bfc518410a46f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/fff-nvim/src/bin/bench_search_only.rs:7-16 | crates/fff-nvim/src/bin/grep_profiler.rs:17-26 | crates/fff-nvim/src/bin/grep_vs_rg.rs:32-41 \u2014 before extracting anything, compare \u0060crates/fff-nvim/src/bin/grep_profiler.rs\u0060 and \u0060crates/fff-nvim/src/bin/grep_vs_rg.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060path\u0060 to \u0060\u0026std::path::Path\u0060 in one and \u0060\u0026Path\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/fff-nvim/src/bin/bench_search_only.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa900cb0a66776c406e5d9cdd4574b729a656f26cac25faffede22e366b538e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/fff-nvim/src/lua_types.rs:161-170 | crates/fff-nvim/src/lua_types.rs:189-197 | crates/fff-nvim/src/lua_types.rs:216-224 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/fff-nvim/src/lua_types.rs:226\u0060 calls \u0060set\u0060 and \u0060crates/fff-nvim/src/lua_types.rs:173\u0060 does not \u2014 after which the two agree again for 3 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/fff-nvim/src/lua_types.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"df57064d479413954cedd9f73eab00bbca15aa4a1fc59c532621f45b855c87cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/fff-c/src/ffi_types.rs:191-200 | crates/fff-c/src/ffi_types.rs:428-437 \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/fff-c/src/ffi_types.rs:191\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/fff-c/src/ffi_types.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7113778793eda7636db308a666879e37106b6a4836b4e44986045263d2100d06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/fff-c/src/ffi_types.rs:224-233 | crates/fff-python/src/conversions.rs:13-22 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/ffi_types.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d131f190000767beb53293771597485ea7076420a9c4f82663b8767282ee7c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): crates/fff-core/src/file_picker.rs:1278-1287 | crates/fff-core/src/file_picker.rs:1366-1372 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefb947ed48aea985b6cf2e57e844208d894e4e017bc1bcd7ba912c323b531ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/fff-core/src/grep/multi_pattern.rs:64-73 | crates/fff-core/src/grep/regex.rs:189-198 \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/fff-core/src/grep/multi_pattern.rs:64\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/fff-core/src/grep/multi_pattern.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"60664a6df09fc0460873b0abcab28f05ae2439e8cf4c6922063051bc8292f99b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/fff-core/src/grep/sink.rs:105-114 | crates/fff-core/src/grep/sink.rs:130-139 \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/fff-core/src/grep/sink.rs:105\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/fff-core/src/grep/sink.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"176c5f1168083c8c30d0db655b06559696ae40f2e49ea66f09ae93652e22ad91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/fff-core/src/score.rs:554-563 | crates/fff-core/src/score.rs:757-766 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/fff-core/src/score.rs:754\u0060 calls \u0060iter\u0060, \u0060any\u0060, \u0060contains\u0060 and \u0060crates/fff-core/src/score.rs:552\u0060 does not \u2014 after which the two agree again for 2 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/fff-core/src/score.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b863b5ce26d7b7e49860015bb666496a94c38882cf98b0a47a6c9dd97bb17d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/fff-c/src/lib.rs:371-379 | crates/fff-c/src/lib.rs:507-515 | crates/fff-c/src/lib.rs:573-581 | crates/fff-c/src/lib.rs:701-709 | crates/fff-c/src/lib.rs:1115-1123 \u2014 all 5 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/fff-c/src/lib.rs:517\u0060 calls \u0060optional_cstr\u0060, \u0060default_u32\u0060 and \u0060crates/fff-c/src/lib.rs:711\u0060 does not \u2014 after which the two agree again for 3 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/fff-c/src/lib.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5476062ad53b3ff024ee24feecf7e799943afa04c1e502e62386c8aaf30e61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/fff-c/src/lib.rs:1434-1442 | crates/fff-c/src/lib.rs:1502-1510 | crates/fff-c/src/lib.rs:1615-1623 | crates/fff-c/src/lib.rs:1687-1695 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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/fff-c/src/lib.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"62acf617b6b50e6b0e0efb496008f3b5e6dabbb049aa02dfeae9646bc35eefaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/fff-c/src/lib.rs:1454-1462 | crates/fff-c/src/lib.rs:1634-1642 | crates/fff-c/src/lib.rs:1706-1714 \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. 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/fff-c/src/lib.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"506b9674b5b64856f0c2310151086c0ce7b541e07556d3603e518fd63cb75011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/fff-core/src/file_picker.rs:510-518 | crates/fff-core/src/file_picker.rs:562-570 \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/fff-core/src/file_picker.rs:510\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/fff-core/src/file_picker.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fa24847f7e7cc999c2fa79864e5a58c2696c1052bb5f8e721bf5b377b7d61f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/fff-core/src/file_picker.rs:1566-1574 | crates/fff-core/src/file_picker.rs:1598-1606 \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/fff-core/src/file_picker.rs:1566\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/fff-core/src/file_picker.rs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6fb5117a85ba764438aeb08616afed057ccab424ac4bbd4c98a3c4cd6c510b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/fff-core/src/grep/grep.rs:128-136 | crates/fff-core/src/grep/multi_pattern.rs:52-60 \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/fff-core/src/grep/grep.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"563ea46a373ac3e6543ecc0c3d7253cf4cccd78a8831470eb4b79ae78e76de0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/fff-core/src/watcher/background_watcher.rs:771-779 | crates/fff-core/src/watcher/background_watcher.rs:825-833 \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/fff-core/src/watcher/background_watcher.rs:771\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/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfef4b71e95405f8cc816133d4bdaa7140f79968474e2907d5a7e06b2c550d8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/fff-nvim/src/bin/jemalloc_profile.rs:23-31 | crates/fff-nvim/src/bin/test_memory_leak.rs:28-36 \u2014 before extracting anything, compare \u0060crates/fff-nvim/src/bin/jemalloc_profile.rs\u0060 and \u0060crates/fff-nvim/src/bin/test_memory_leak.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/fff-nvim/src/bin/jemalloc_profile.rs:23\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/fff-nvim/src/bin/jemalloc_profile.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dc6f963c9298e0b7850a1bb15a4421e454fe4540387ed6cd113ef917dbd28f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/fff-nvim/src/bin/bench_grep_query.rs:117-124 | crates/fff-nvim/src/bin/bench_search_only.rs:7-14 | crates/fff-nvim/src/bin/grep_profiler.rs:17-24 | crates/fff-nvim/src/bin/grep_vs_rg.rs:32-39 \u2014 before extracting anything, compare \u0060crates/fff-nvim/src/bin/grep_profiler.rs\u0060 and \u0060crates/fff-nvim/src/bin/grep_vs_rg.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060path\u0060 to \u0060\u0026std::path::Path\u0060 in one and \u0060\u0026Path\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/fff-nvim/src/bin/bench_grep_query.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a723f6ffaaa2f762dc4e922b993fe5ebae856266f0a8a8f62279b328c5546f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/fff-c/src/lib.rs:709-716 | crates/fff-c/src/lib.rs:927-934 | crates/fff-c/src/lib.rs:951-958 \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/fff-c/src/lib.rs:709\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/fff-c/src/lib.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"aead406874f4781d72e9812615041ce800d7d735305c427dbd1987d991d1d2fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/fff-c/src/ffi_types.rs:176-183 | crates/fff-c/src/ffi_types.rs:697-703 \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/fff-c/src/ffi_types.rs:176\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 that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/ffi_types.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b7cbb1503e90577c7fd519750e525f25ba2f12b6fbb5eced784e8bd8842bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/fff-core/src/file_picker.rs:1463-1470 | crates/fff-core/src/file_picker.rs:1516-1523 \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/fff-core/src/file_picker.rs:1463\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/fff-core/src/file_picker.rs"},"region":{"startLine":1463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b2b7f1042583ee80a6755cabce042edf71dd73a3437090159c33fd3d12823c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/fff-nvim/src/bin/grep_vs_rg.rs:69-76 | crates/fff-nvim/src/bin/grep_vs_rg.rs:94-101 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/fff-nvim/src/bin/grep_vs_rg.rs:68\u0060 calls \u0060arg\u0060 and \u0060crates/fff-nvim/src/bin/grep_vs_rg.rs:93\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/fff-nvim/src/bin/grep_vs_rg.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d125ec57ed6a4dfda4445765c6282098ca3693a08c69f28f7046db3ff8532c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/fff-python/src/finder.rs:624-631 | crates/fff-python/src/finder.rs:691-698 \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/fff-python/src/finder.rs:624\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/fff-python/src/finder.rs:623\u0060 calls \u0060to_string\u0060 and \u0060crates/fff-python/src/finder.rs:690\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/fff-python/src/finder.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"87120db676419814904e941581d037e2974f4833a8e5bf113f2ebec6abba7cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): crates/fff-c/src/lib.rs:386-392 | crates/fff-c/src/lib.rs:459-465 | crates/fff-c/src/lib.rs:520-526 | crates/fff-c/src/lib.rs:588-594 | crates/fff-c/src/lib.rs:711-717 | crates/fff-c/src/lib.rs:837-843 | crates/fff-c/src/lib.rs:929-935 | crates/fff-c/src/lib.rs:953-959 \u2014 all 8 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/fff-c/src/lib.rs:386\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/fff-c/src/lib.rs:383\u0060 calls \u0060default_u32\u0060, \u0060default_i32\u0060 and \u0060crates/fff-c/src/lib.rs:457\u0060 does not \u2014 after which the two agree again for 3 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/fff-c/src/lib.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5858918ffe57f0a5ec3ab044daa31dc156b5b760f5d94ddb66e3f360d00fff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/fff-python/src/finder.rs:360-366 | crates/fff-python/src/finder.rs:415-421 | crates/fff-python/src/finder.rs:467-473 \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/fff-python/src/finder.rs:360\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/fff-python/src/finder.rs:358\u0060 calls \u0060clone\u0060 and \u0060crates/fff-python/src/finder.rs:413\u0060 does not \u2014 after which the two agree again for 3 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/fff-python/src/finder.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"f725c9f964343062dcdcfb7bc0622f50affa21654e441e8d3793fa15050a1832"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/fff-c/src/lib.rs:446-452 | crates/fff-c/src/lib.rs:820-826 \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/fff-c/src/lib.rs:446\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/fff-c/src/lib.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"beca876ee3afb9a560c7d9419a64cfe56bf9e466d738ea3fa341c821ec58ce80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/fff-nvim/src/bin/grep_profiler.rs:173-180 | crates/fff-nvim/src/bin/grep_vs_rg.rs:250-257 \u2014 before extracting anything, compare \u0060crates/fff-nvim/src/bin/grep_profiler.rs\u0060 and \u0060crates/fff-nvim/src/bin/grep_vs_rg.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/bin/grep_profiler.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5e5626ffc4bff09a9739334f24e5813bb614a50501145e433b5250fdcf5a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/fff-mcp/src/server.rs:397-402 | crates/fff-mcp/src/server.rs:799-804 | crates/fff-mcp/src/server.rs:1024-1029 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/server.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"36338fd25df543198efb83888a3c59c2189b293053a6522afcba2ca0e1c71240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/fff-nvim/src/bin/jemalloc_profile.rs:167-172 | crates/fff-nvim/src/bin/test_memory_leak.rs:68-73 | crates/fff-nvim/src/bin/test_watcher.rs:18-23 \u2014 before extracting anything, compare \u0060crates/fff-nvim/src/bin/jemalloc_profile.rs\u0060 and \u0060crates/fff-nvim/src/bin/test_memory_leak.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/bin/jemalloc_profile.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1d09d737ca89e85fc027bd5b6d83671d9300ad157c5b43c6657c6e2b402c3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/fff-python/src/finder.rs:362-367 | crates/fff-python/src/finder.rs:529-534 \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/fff-python/src/finder.rs:362\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/fff-python/src/finder.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"380e36817cd844ff3a67250a9592f3db0d8ba36f923ebe960ebe94aab400bfc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/fff-c/src/ffi_types.rs:322-327 | crates/fff-c/src/ffi_types.rs:650-655 | crates/fff-c/src/ffi_types.rs:764-769 \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/fff-c/src/ffi_types.rs:322\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 \u0060result\u0060 to \u0060\u0026SearchResult\u0060 in one and \u0060\u0026DirSearchResult\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/fff-c/src/ffi_types.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e87cea73781ed5079e2f4dfa008133e26469655f371b13929d9611aeda835f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/fff-core/src/dbs/frecency.rs:301-315 | crates/fff-core/src/dbs/query_tracker.rs:283-296 \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/fff-core/src/dbs/frecency.rs:301\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/dbs/frecency.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"0794cbe762c2990e1428e1f0b40951d9719263c707c146b69a45a2a2c605ee37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/fff-nvim/src/bin/jemalloc_profile.rs:177-189 | crates/fff-nvim/src/bin/test_memory_leak.rs:78-90 \u2014 before extracting anything, compare \u0060crates/fff-nvim/src/bin/jemalloc_profile.rs\u0060 and \u0060crates/fff-nvim/src/bin/test_memory_leak.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/fff-nvim/src/bin/jemalloc_profile.rs:177\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/fff-nvim/src/bin/jemalloc_profile.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac61cafa9704fb86c1c073e1de04b7cd8765e82bb589688b3e7f78c2616822d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/fff-c/src/lib.rs:1301-1310 | crates/fff-c/src/lib.rs:1340-1349 \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/fff-c/src/lib.rs:1301\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/fff-c/src/lib.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1eb47f90e077b3a63a41770516ff80cd368de1af981cb3de37d2abb486b031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/fff-core/src/dbs/query_tracker.rs:316-325 | crates/fff-core/src/dbs/query_tracker.rs:438-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/fff-core/src/dbs/query_tracker.rs:316\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/dbs/query_tracker.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"be75d1bb77af468481d7444640f7b893d5cab70f64e5f30c24650de95b14eb76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/fff-nvim/src/lib.rs:573-582 | crates/fff-nvim/src/lib.rs:600-609 \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/fff-nvim/src/lib.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddfa4166e37ec2dfe06e79f865a2d789a02f14ecb610a58483f18acb39142a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): crates/fff-c/src/lib.rs:371-379 | crates/fff-c/src/lib.rs:507-515 | crates/fff-c/src/lib.rs:573-581 | crates/fff-c/src/lib.rs:701-709 | crates/fff-c/src/lib.rs:1015-1023 | crates/fff-c/src/lib.rs:1115-1123 \u2014 all 6 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/fff-c/src/lib.rs:517\u0060 calls \u0060optional_cstr\u0060, \u0060default_u32\u0060 and \u0060crates/fff-c/src/lib.rs:711\u0060 does not \u2014 after which the two agree again for 3 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/fff-c/src/lib.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f931f2ea8a5c2958ed859ce45080f3c1b767e5964a2daae7fe691769a5262d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/fff-mcp/src/file_search.rs:147-151 | crates/fff-mcp/src/server.rs:1466-1470 \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. 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/fff-mcp/src/file_search.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddeda74b3a4eadb7eb5df1b69a8055c0b1673d8629c0bcbd29cf01b51258196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/fff-nvim/src/bin/test_memory_leak.rs:135-139 | crates/fff-nvim/src/bin/test_watcher.rs:63-69 \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/fff-nvim/src/bin/test_memory_leak.rs:135\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 that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/bin/test_memory_leak.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"229e082ae614300981c8064dc4409164c30617552f2dac4c8707e917eb04fcfe"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @ff-labs/fff-bun: @ff-labs/fff-bun: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2ebc6696bc8bb4df230bf74b30b4137d4d3ffb3f3583e8981d3a419ec6521af1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @ff-labs/fff-node: @ff-labs/fff-node: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7bb5919da348c0f375c5a13b11f3355ebdd324b0af1a75d1057cbaf35ba79418"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: fff-query-parser: fff-query-parser: abstractness 0.13, instability 0.00, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"16bda00a3dbc441de58c77b2ba5cf3906c237466b16ad4b5783958dc8433c98c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: fff-grep: fff-grep: abstractness 0.20, instability 0.00, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0f2af8c1a567725ca00a28c17ec5e735fe61f78ab2233c5f4f30c73caf7ea1d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/pi-fff/src/index.ts: packages/pi-fff/src/index.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 193 in index.fffExtension at line 322. 10 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- packages/pi-fff/src/index.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e40de8fab6fa9912017c87cf785aab8dd7f685ddc1f03cf0560cf8e131183e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-mcp/src/server.rs: crates/fff-mcp/src/server.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in FffServer::perform_grep at line 324. 4 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-mcp/src/server.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/fff-mcp/src/server.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcbf040a9422d0fd428ea76ffdc0adf54513c635803979e360c0f724b41f9d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/watcher/background_watcher.rs: crates/fff-core/src/watcher/background_watcher.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in fff_search::watcher::background_watcher::handle_debounced_events at line 374. 2 of those changes were fix/bug commits, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-core/src/watcher/background_watcher.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/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc74ece6ec8ee9250da328795f1ea0ba2a69ba6f8e46a0a1421ce78732b04d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/score.rs: crates/fff-core/src/score.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in fff_search::score::match_and_score_in_arena_inner at line 730. 1 of those changes was a fix/bug commit, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-core/src/score.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/fff-core/src/score.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc841f5c509b0d56443aa2805c455a0569c2c2f69555d160942fdce5a6ae17f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/grep/fuzzy_grep.rs: crates/fff-core/src/grep/fuzzy_grep.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in fff_search::grep::fuzzy_grep::fuzzy_grep_search at line 13. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-core/src/grep/fuzzy_grep.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/fff-core/src/grep/fuzzy_grep.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"554c2c10cbdddc84ae8b360d2a01726efbf1316237cf8a58b2028777e9d530fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-mcp/src/main.rs: crates/fff-mcp/src/main.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in fff_mcp::main at line 219. 5 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-mcp/src/main.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/fff-mcp/src/main.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f742c1e48f548ed541a5f5410e2ca0f510ada8eea8026c1c0673e6c452acc32f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/walk/zlob.rs: crates/fff-core/src/walk/zlob.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in fff_search::walk::zlob::walk_collect_files at line 27. 4 of those changes were fix/bug commits, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-core/src/walk/zlob.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/fff-core/src/walk/zlob.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c99c26fdebef330183964c2c16e5ec5bcc327f4635901c78ea771617805cc1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/index/bigram_filter.rs: crates/fff-core/src/index/bigram_filter.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in BigramIndexBuilder::compress_in_pool at line 463. 3 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-core/src/index/bigram_filter.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/fff-core/src/index/bigram_filter.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91160d56bd15183e84f2fdf7c0464d83d4b00d7d5a40df90fce858181dd4a41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-mcp/src/output.rs: crates/fff-mcp/src/output.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in GrepFormatter::format at line 165. 3 of those changes were fix/bug commits, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-mcp/src/output.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/fff-mcp/src/output.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"863c7f02795aa9031251ee8f10d7401006a668bed1b50207055328a147bf777f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/scan.rs: crates/fff-core/src/scan.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ScanJob::run at line 154. 1 of those changes was a fix/bug commit, and the other 6 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-core/src/scan.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/fff-core/src/scan.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3fe0a80e67d5fc4b3cdb6f736536ebc7784f00e1368b4d812c393f06dc0f73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/grep/grep.rs: crates/fff-core/src/grep/grep.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in fff_search::grep::grep::perform_grep at line 585. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-core/src/grep/grep.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/fff-core/src/grep/grep.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"825f434b788ecd86c0b4583f25ac617d4d9770630538dc747400146fc91cb8f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-c/src/lib.rs: crates/fff-c/src/lib.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in fff_c::fff_create_instance_with at line 173. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-c/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/fff-c/src/lib.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fed5073f9b76b43c9a5c7e26660fabc16dfd7b1c2d0228d0796f2157617ee6e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/grep/prefilter.rs: crates/fff-core/src/grep/prefilter.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in fff_search::grep::prefilter::prefilter_files at line 115. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-core/src/grep/prefilter.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/fff-core/src/grep/prefilter.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ee25dc6b80146e440a00bfe3e18489016efcca5d33f13dcef77f6d27f43785"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-nvim/src/bin/grep_profiler.rs: crates/fff-nvim/src/bin/grep_profiler.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in fff_nvim::bin::grep_profiler::main at line 171. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-nvim/src/bin/grep_profiler.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/fff-nvim/src/bin/grep_profiler.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d3409208f23fb0007f4a0aaa0a344e7ce0e1d8f4030d06cedd9b7a609c7024"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/fff-core/src/walk/mod.rs: crates/fff-core/src/walk/mod.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is WalkIgnoreRules::is_ignored at line 53), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(watcher): match hidden-file rules outside Git worktrees (#973)\u201D; \u201Cfix(walk): use zlob 1.8.0 to honor git exclude files (#991)\u201D; \u201Cfix: index followed file symlinks in zlob walker (#912) (#913)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:09:51 -08:00\u0027 --until=\u00272026-11-13 14:09:51 -08:00\u0027 --full-history --no-merges -- crates/fff-core/src/walk/mod.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/fff-core/src/walk/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff052656dc52450960c138c57caec72cbdeaa257c9eb12d00a6809f8590d957"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 18 significant file(s) lose their only recent owner: packages/fff-bun/src/ffi.ts, crates/fff-core/src/watcher/watch.rs, crates/fff-core/src/index/bigram_query.rs, packages/fff-bun/src/finder.ts, crates/fff-core/src/definition/parser.rs, crates/fff-core/src/grep/fuzzy_grep.rs, crates/fff-core/src/definition/languages.rs, crates/fff-query-parser/src/config.rs (\u002B10 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b16e439941b9f25954247eef5c64eb41acbf575afaa1c0f66af5b45936fafd3a"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 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 (19 single-owned of 100 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; 100 of the 123 production source files in this repository met that bar). They are anonymized user #2 (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/fff-mcp/src/handshake.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove this function and make a better way to remove all files \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/fff-core/src/file_picker.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2608843c76f6afc07829e797f6f5283b21d5ce0f82ad3a0160de157584d7f84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make this O(n) \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/fff-core/src/file_picker.rs"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"33791942a4bc4c72708d138f7533b5885274210cd32ab56e52e5ca2f71836495"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO figure this out \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/fff-core/src/file_picker.rs"},"region":{"startLine":2228}}}],"partialFingerprints":{"codehealthFindingId/v1":"942cdce90f61b8883e68a92ec1759024311f45e090c40b2ece403894ac83be7c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Skipped as potentially unsafe - figure this out later \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/fff-core/src/scan.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2eefe8be81fe82e286143a434cd55acd0916b31b26d9dd8c23163e12c47a50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO convert all the supported backend by memchr and get rid of the fallback \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/fff-core/src/simd_string_utils/memmem.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df542389295fcdcfc3eb9e4c70b58d1dbac510387488a6de7d6a37dfac52e59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // 32. TODO|FIXME|HACK \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/fff-core/src/index/bigram_query.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e70d13f19fc1620cf81489ff4469122670969ecd57029d176a79a90faafa09d"}},{"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 \u0060crates/fff-nvim/src/bin/bench_grep_query.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/bin/bench_grep_query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a943e0223392b92bfdc3ba3c307bbe9a837b97f236bbdbedc90ee454b022bef"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Free native mixed search result\u0022 repeats the code it sits on: 4 of its 5 words (free, mixed, search, result) are already in \u0060library.symbols.fff_free_mixed_search_result(hp);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d92c3a5b14d4e4c10efa7e12418811d757271529f37a03cabe6036cdb856db"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Test multiple instances\u0022 repeats the code it sits on: 3 of its 3 words (test, multiple, instances) are already in \u0060console.log(\u0022Testing multiple instances...\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/test.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff35e2f4e6aca6062337c356ecc3b5b36fb0141627165a2717f28a5dac20a3a5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 5 comments in this file only repeat the code they sit on (lines 975, 1072, 1150, 1198, 1529), for example \u0022Read FffSearchResult struct\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5ef9d233f3cf37314a1242ad346b8b3cfa142866e8fab64438c10434cbe659"}},{"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":"0f01623a02d1690a4327108ca2f43508b102178941442226905aba49b561d711"},"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":"faa20f8f0a3ea01ebf8aeea7f9a86f831b64c6718f7e1346d687fd12e38fe4ec"},"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":"d15e3ea949150b44ec17bfcc0d30851c4885e83bfdb3d33b9eb62b9c85046605"},"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":"44f9c26c3040faded63f8098707d9d40ad932c82824ee46a945000f641260cbc"},"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":"f7d55f49ccc1e4b6d64ff748a38cf37424977e9596d5c5533ff1b2c2e2269439"},"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":"41702a1cec38461b9ba639fe3fb90de1f9c6885219bfaee07d1ab2fcae8b233c"},"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":"897e39b55bfa587423eb6cc3cedda132c5464b9fb28691854489f7d8c2f77c26"},"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":"42611b371071838d3087068977cf485c603bc50b57b736a8136e6dc4e834dfd1"},"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":"7b9c9b9af42ebee2a627a251338c9b792f1ce9fe6c49d0fdfc13b5295452b7c4"},"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":"844362503a62e01c5ffdaaef669c7fac74c79d2573cf2b9af934d23c295a7410"},"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":"a1e4fcf1a3594e5e77aa3fa1105c30008664650fe20910210b8a07eb038d0c2c"},"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":"4cd5dc0ec1dbae78872a376508f7e3092df8b88044dc49a43f3abfe950cfe6e8"},"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":"590204155b52fcde8e709e4263944892d0c8bfa66c2fc8eac4d29d01d2b9f250"},"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":"7f7c5d99f78db340bcd64cb189d59fdceb8704eff465bb26d7fb4c10fb4b25f9"},"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":"7c61c577ec8f89bad38f72228c6b366b0f60e1a85ddd0fece949d40d50d4e8ea"},"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":"88ad2d673034aa1658c01f4e21a1a6ccc0850f67ee81b09dad328be7d9b0d1f9"},"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":"b2af489240184a6abbda74b76af559e7be8f3f699800b30321bfdbcb71c0cba4"},"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":"725b9c2737f318dc935629bc71085c988e39af019cf2a88b5dcbfec0f71825e4"},"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":"e859a81b08423b8250e17107a1bf00f39f3e4b292a428cfec512f0a260f6ca15"},"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":"6d5667241d4c8ce0f2841dcb962efb924dbe6abb91dd0ee6e798aab53d13f320"},"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":"f7d8f414161586c41ef494d4a9cbf19e98618acb223506b37310ba97d4cfb878"},"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":"8e9b2222660710d35143150b884dbd9a90fb774b1acc4d5afdd97f7847ef944d"},"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":"265ca95736f2b0a5dcf17f0d65333ea4d03805ea9123c3691c945b796456c04f"},"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":"bc2d57658192d0b2b73e0a99ff21f8f25a9fc570359dcbad2fd129f320dc078b"},"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":"ec6dbde3bede756a5ca471f4065fdcfd5e228dc9780849388ba7ae4b0f335e89"},"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":"47a86609828fa00daab4d46d3e748175450892af62364b575d21e144d67823a1"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"6876ed0a10be2876a0581d056e1e8ea1dfd6fe65df3e13bd3ad438984b97af59"},"taxa":[{"id":"CWE-269","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"5214654fb532d173e9847e405e7008ed36b31a1ecb5c24c82fb80786828109f2"},"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":"07cb28f4562521f64a97c9d4ebaaebff65faab4d88946730de52a723c46f48ed"},"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":"0b6d00dcc9b9b0b69f17cc70ad7eb120db170e7e3224b4ec6e48ed243aebc3be"},"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":"38f4d95e699071e362a36fcd817088efabbe14627d4d7b2e1a3801982b6befdf"},"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":"2d2529c141b2241ec8691c1994d8f9faa22e1110a010c08219e56d9d106ceaa4"},"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":"63d16575f68c13aa64de5539d98ac2d3af234919b8cca5eeea7d1fa066470ffa"},"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":"ee07363acd2935dc42f2a20b3178ce0d8a6056a1e1f5eb4ffd07c0785f1c60cf"},"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":"3334cfb1d06e9ff7158ac22261eaa939e461419949e7b9a13ea6b0cd08c0be79"},"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":"cd697d1e1f127091c40cba1b6ce69661aae9aad7eff8b4bd791d0ea54241ff3d"},"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":"0387c69ef1676d6b63e60b29db48ab6fec2b2b989ffdf38d3fb195cf4689b6cc"},"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":"a9e968cbe10da89cf0d84c0b1daf1b428e0aed09cc8aeb6f88cbdf0098f36df4"},"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":"8f749e12cfed9c2af7f979afe7029943a1d614dad20ebc52cf9a8d2a94b0a497"},"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":"20de6bb388a37e59b6d4110115c72f39270ecee2c51ba13edb1154afc674e812"},"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":"63d14a6fde7ef3bf80dd6936277e445939b92616880179a0747a134f883477c4"},"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":"36b055a3767f93bd0cadc2597a664cefaba98b3823e60ff392317fbbafca34ff"},"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":"2a45281ec76e3620646b765dec1faecfcaa88a35d4f8565fc99d81d09817ea68"},"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":"46626a9f273884af1573285ccf9ba41107f5583380e0de0c8d0e0b8bc43330d0"},"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":"bb5e76c08c5ef1a8c881e111ddeacd827f038fc55e552847a96f43cfcf315a7d"},"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":"9c7832bbe436845d1d3fbff2418e91d6a20270b9e00ab0e90fed99450e291093"},"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":"0d39bf170dbba48e93c5b719786f73d0837db4a43d75a8c6b4dfd8c57b1c3c90"},"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":"79e806228a009482e6122cc61b651e3d0c8d452c18de74233e9a74aa264f65e9"},"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":"7ab4931653683d2078f16b34c4188be2b43a3802441788c5b5078b349233b1fb"},"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":"f949706b60fbaaba308935688afb0404c0fd9c4bb690bfd3060f7206461687bd"},"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":"53ef9e89312dce3f537e86f3be93df04e8a315781c32c2c808cc145544de288c"},"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":"e08c81048e38e3fa9e3ec96f7b1ba45eb9f2882bedf6e028947f22c8464df7db"},"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":"8a087b9f2ad3f2c1d69b7355662beea29e64d288931ef22821f64ddccdaa131a"},"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":"37d7ff3e5bc02e36034ca4ec88ca217e32aec75a70b49f0265f846348b08ede8"},"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":"9f18b25a3d799a845af6ab032917898d123521e92a0a551457d5f21b964ef2d4"},"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":"dda56541f3d7488a5a7b008d1a3fb4dcb83506de61db69bfd685279b581c3bb5"},"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":"20d473a951b8272d255d068effd63d9e3c54045f17cd6075e6b2d2348f4c3b81"},"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":"57c748c831e5a524ace07e64af86a33abd44b404a2e136b85e1e840033cd7048"},"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":"e7b22d3b96334fe84466f6a1994986cf5de4c209a1ca2ae1267de721123e2819"},"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":"b395912817f42206477f204845c937ae583ecda8303d7dd68628bee2646bbac1"},"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":"6df91d65492f3708b83d9bc5ce5cb0f3a22f5b44bda3787591d910661ebb116d"},"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":"953037dfbf0befc32dcef2f6461e838a6aafe1f2a00e9d887e5628e0c494ba3d"},"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":"8b809cc58e4e99b030ec4aa55475106e3dd78cf3e0b0eea83af14425f4571c80"},"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":"bb47991a930a38a7b17ed2fef315b2e2ab7c8cb32ef5efcef77a3b3b040c64a6"},"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":"1334d4c3e7e1de2afced6f72606ae09ecbd9eba11020cd95f5ed371d5559ef8c"},"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":"9b181a5df2b32cee77a309e843111cdc41ec52e92c943b0bf997cc1a00b15958"},"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":"61080582863ceb6fac695bf611394c3f8b2cec28803a76c02ea9442c41c0c2c2"},"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":"d71004d918625fbf074888ab8d971f15aa92e4fe2b007f220523add0fad463dc"},"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":"0f1fa29ed89f1d9aa4c070b835d944648b7d2f0a274aed2e3073410876da2f0f"},"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":"97568ec32bfe7aa4fa8fae51a0c6903a47d28665e93ed5bc090abf890aedcd38"},"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":"b6c6a038bc9bb4d081e97828791395a05cd8a36dc0804215607a68fab63414fd"},"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":"fa6a1f282ff87d17aa70d22b87624b3dc8e2503e152c1c2b9e9136aeb0f8f12f"},"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":"5c31537a3621dfc5fe32cffeb07cbe01877440bbcca08982af3bffbf21082a76"},"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":"c8c71cb55399872572db247be3f41f0f1b8385ecf8faa90fe45c5c103496bbd3"},"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":"04a2560fa5d37bec506eb17382b3a47a4ed5c3e6a81453860dc843d5d84d20b2"},"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":"081ea88ed644c0a45cb77c57145489f768c26c9581a948af73d2351eb71827b7"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"a33c6e9942619fee48583df1bff1abba2cf1e380051dfcec681256bc358e8884"},"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":"512f75f05be5ee4480b93a9f9b34d4efdad93c1e0378ba3d015d38fc7691ed1a"},"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":"7ecceca09100c45072b81806cf1c195cb07f8bfb63f7a74c23be25990f80371e"},"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":"607a1f29ea1dba6c0c703ed731961710c317f5978baf10e5d65536a1dce4f8f3"},"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":"ee9a6e3878e0d8a72575a685371c4be896d6c343aa5186aaa56059e78053f01b"},"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":"db44dd6625d8bebef92c2b2dd6615471c7d6a44d809816deb27c3f1c2f30981e"},"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":"7863e863514b3e5c564ae5e3f49f5747f4d370eddeab6cbf38fc22a1436cc7b2"},"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":"d060dd2ee49c7e43bef6b4e26733f8cf3b5bde4ccb9cba8746caf06e879b10f2"},"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":"5dbaac886b9fda4d0a648ffd4a6d9300fa2ce5d8b49a8997ef8042d7843725f5"},"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":"ed31c38d7a340765f3937508c228e7bb6039be1ec85b89bced884789df6b2b27"},"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":"8b8de6586da9cde866f86ac31f364d3177c557375e307eb1e99fe805e2423662"},"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":"95c53ca85e56b5b149deb21e12b7820581c1df468ea1773a48140e5bf2f70c53"},"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":"e1202221d29836341117d6bd332c98f3f9c059f2f32b4da051fb0fa711f89ba6"},"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":"9547ffe1fe450c6c27db818620d208444635fcb2b5e8020d78e0fe53a6e209e3"},"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":"3598f5073c7da97262c74eacde71562b59997f6f2e67a06ffa359671f77dc593"},"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":"c5a83f0a5c984db9c352a3204442263fedc055bac28cb9b9e412ccf163bb8809"},"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":"a5a6817c3e60c068daec7ddb91c2a4f576f381c0014d98cb939b918705a9f811"},"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":"89bb37b903bc30f61450a2205ec954e925681e960fc56e28dec9f39c9a5a6c25"},"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":"a9389384992cc373c43f9cf4c1a9927a59d81042ed0efee3071e82e079d4f4fc"},"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":"76133750691d3ccba3d856a5c60589306e1751ad72ecc5222ff3b40861a7e3de"},"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":"9657fccad78c31fd25c17ebcb1057da2502001eb52c741200d0e693ea29e6e88"},"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":"5e1d3aed0d86beef622d7015473a888fed00c867599aa68c46d9b26894072084"},"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":"d131c32785c6d67895c6817bf9921917ceefb33faf83aef2f41038eb6e979d92"},"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":"fb4ddab1a395c5494b1a1c8bb79b9c6a0b04e96f72ef8016fa80b62f86a40a3b"},"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":"ce63639a05bba5c090368298a65f5b6edb4d4426e32ebb069535b0db47ab8a06"},"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":"dd8c2b9a880923d4dec86420d863f6e81bf7657c845ceb51cea60fbb9d4a444f"},"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":"875873404fc6478b866f3685235ace9d20dae13eff25a361b9e758a28e113bd6"},"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":"3577b5d460a45f2f85a34c317d2bbdc39946750e4d239c3a196c4aa170cf5403"},"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":"ead666924f88e022f1b43b6fc721cb11149a301d020f95f0533bf713f2daf7a9"},"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":"c52de93b97f26665dabe5a7a4032c7f98099aa1707d8ec3a019dc63edadc7b6a"},"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":"7ab41876bcbc1f6810e8d329c6473cb79f65e022e2ba9ea3cce7213d7b3b1519"},"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":"f270c330aa1e5400c4d7018f0b7fa897b6868153cfa70cbadd4614dd6ddee198"},"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":"ab4c984bb852b3e43dbd8dee74f3c3f7346404514bc599820077d319e3752ecb"},"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":"35d6b81432a363cb0ba38f94a20ebbc557740322a6b20749e1de5464e482e913"},"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":"159bc4adab7670d352e7477a5d649ed151c69c87aa68e9081f20b718edfcd638"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"6368403b74b6cb7b78443236afa60f823bd437bdaae47c1c83b1fd1dbdcc4408"},"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":"5cf80f796b3b2743d0a28c3666a68c7aab562513026ff4a0da39a43c13ad7bdd"},"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":"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":"f4f31f32baa5724bfa8a7cbb773ea104c08bcf7f1d7d6ae785a3531d6c1bf04d"},"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":"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":"c2bc1bb0065fb16eb641faf68b92cb15dabe1cc09d77a317ad85ae1fc451b771"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7074b82a069a66ab4d4964c6302dbdb5bdecfd49e0477c505c2d5e2e04e2216"},"properties":{"dependency":{"package":"tinypool","version":"2.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ed384055dc716a282d5e05d367f817795de1f0324f3b20b12b91701c74092f0"},"properties":{"dependency":{"package":"rmcp","version":"1.7.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0462"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c96a325a77576d0cb385f65bb77872721c4e7852cf87245aee432aab68fbab5"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18ad03e830953fef6edaf7a4432ff0a858416164dedaf2d70748c6f940d55a0b"},"properties":{"dependency":{"package":"undici","version":"8.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"728758c9d3428053e1082b5fb9832c05e2e04dab40233f2ffbfd7792b93201ec"},"properties":{"dependency":{"package":"libz-sys","version":"1.1.25","advisory":"RUSTSEC-2026-0418","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d44a25813d8a9e18eb42fa5350a972c298292d454155c6472f091bfb670363df"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"RUSTSEC-2026-0097","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.50.0","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4a70a4130b0f36a4a7f53180d0bb5cf15ef46a80b33899af4cfa7d945143310"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"67936173d756121ef7e3ac910c45ae9509d4b06f5d436f2ae8ec9e17d925c939"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"880c5a9e3754ff2f8b6ebe629520afecbaa8208a75ab43985dc95bf538bfa60c"},"properties":{"dependency":{"package":"xxhash-rust","version":"0.8.15","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da8f8d853ea902df39bf63b7986f0b4b6247d86839487ec97663d65b55c68b19"},"properties":{"dependency":{"package":"fast-xml-parser","version":"5.7.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b0807aede2359055d554c1f3dba200bc001224eaf1cd27f9d40cb04ecdc0b6f"},"properties":{"dependency":{"package":"esbuild","version":"0.27.7","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 100 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; 100 of the 123 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/fff-python/src/conversions.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/fff-python/src/conversions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2865996861ba4247ab782fd480b6afdb02cdce4217a9da27551023f56ad13692"}},{"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":"f19c32af9fe515b7bf79ceada028ee2266610c4581befe88a332a38fcfcf2166"}},{"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":"abc33bc517c8f840d2b518978f1cd919f65c0c21f1049baed213e44797b24741"}},{"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":"c50b4510445fb6f0efdf07f62e8cd6a71a335b95e4b0fa3e202d894dc0098694"},"taxa":[{"id":"CICD-SEC-4","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":"8055413fdf19026ce0a5c43c7f0bc8006275c3a1092158a51d60a98685d40fd1"},"taxa":[{"id":"CICD-SEC-4","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":"cfe49d422d01ee696ca65f47f9cc1c547aede3c7e5536229e5de4a078ae351cb"},"taxa":[{"id":"CICD-SEC-4","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":"1b3856dc48c94a2ef2fb1ec98294eb281aa479096b2de4ad945576786b374c23"},"taxa":[{"id":"CICD-SEC-4","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":"P2","level":"note","message":{"text":"Logging is not universal: Only 5/6 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060packages/fff-python\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060packages/fff-bun/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/package.json"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"23621deb26a778f7ecbd3a8264ae701cc89bec92dbcd256649960d3a676fb713"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 2 sibling directories (8 clone groups): 8 duplicated blocks under packages/ have copies in at least two of the sibling directories fff-bun, fff-node \u2014 6 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 8 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 8 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 8 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/finder.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f8782049a0239e460d9720ed98a1b772f145ac77a6e7397046ca7c3e8461ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (193 identical lines \u00D7 2 files): packages/fff-bun/src/finder.ts:37 \u00B7 packages/fff-node/src/finder.ts:35 \u2014 these 2 files are line-for-line copies of one another \u2014 193 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/finder.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"63687fe908179328bf856169427c7b2047773c29abcb948703439155baca8af3"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (70 identical lines \u00D7 2 files): packages/fff-bun/src/platform.ts:5 \u00B7 packages/fff-node/src/platform.ts:5 \u2014 these 2 files are line-for-line copies of one another \u2014 70 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/platform.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5371af0f896641190ceca68a7a65f2f05903e4ebf10c5843e358e6a1b8da3497"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (57 identical lines \u00D7 2 files): packages/fff-bun/src/download.ts:11 \u00B7 packages/fff-node/src/binary.ts:11 \u2014 these 2 files are line-for-line copies of one another \u2014 57 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/download.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5aa5c1a52dfe8ea50dbb75a0394614235055027d2d66f40df6dadb1b261f60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2 locations): packages/fff-node/src/ffi.ts:1223 \u00B7 packages/fff-node/src/ffi.ts:1333 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ded8e3119d8b59f14ea11d415619d2a74ab577d5f6a1645aeca05e2dc58f59c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): packages/fff-bun/src/ffi.ts:1254 \u00B7 packages/fff-bun/src/ffi.ts:1294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b162f775bdccb16e4fc6e369d4573c6cc8ce47522a99d0584811575c3f2f28c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): packages/fff-node/src/ffi.ts:1366 \u00B7 packages/fff-node/src/ffi.ts:1429 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fe3e2b8c93d85a567afb85173abb639e013db73401152323b10a5cb14ba629"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): packages/fff-node/src/ffi.ts:972 \u00B7 packages/fff-node/src/ffi.ts:1147 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"6737c6855106e4e58757c4fb5a2866aa38de16f032a8f4bdede5ba1058ebdb2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4 locations): packages/fff-node/src/ffi.ts:876 \u00B7 packages/fff-node/src/ffi.ts:944 \u00B7 packages/fff-node/src/ffi.ts:1041 \u00B7 packages/fff-node/src/ffi.ts:1119 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94adc108e6740a18648a6e05aeee7d5b64b23f5bab3a27a657256af4247c242"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/fff-bun/src/ffi.ts:518 \u00B7 packages/fff-node/src/ffi.ts:353 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a013a2ba7d7973feab40844388058055e4d6622c1b1a43743b9fbe504ced89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/fff-bun/src/ffi.ts:1153 \u00B7 packages/fff-bun/src/ffi.ts:1227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac6844c60b1ef2fda631aa5bc5095e46b2dc01ce8403d369a31667cb00903ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/fff-bun/src/ffi.ts:737 \u00B7 packages/fff-bun/src/ffi.ts:927 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3aad1ad90e07233a5fc6d28bf6f2f959751d3fb4370d6e3c10c54c7fe1d46f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/pi-fff/src/index.ts:985 \u00B7 packages/pi-fff/src/index.ts:1258 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33a2520ecb8c94e2931bbbf72a275351147ca4218e4d29b2e98a91d03373f39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/pi-fff/src/index.ts:106 \u00B7 packages/pi-fff/src/index.ts:134 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06f65ebe9a0b8e97ca5db546a9687f59cea2cfe9242d84fb24e3bc9d752fd19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/pi-fff/src/index.ts:1585 \u00B7 packages/pi-fff/src/index.ts:1619 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d361fae5e7707b53405a1d645db72fd8cc05a8d9ca7e5fc6ca08388dcac101"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/fff-bun/src/ffi.ts:828 \u00B7 packages/fff-bun/src/ffi.ts:957 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b914c6ae8cccd8cbb06bf5330b44e9a5ba1893d0d7600be067060d27e1254f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/pi-fff/src/index.ts:1008 \u00B7 packages/pi-fff/src/index.ts:1270 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b618dfd583405959bb1561b18468887993c86b4b23455f03167632f7727484"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): packages/fff-bun/src/ffi.ts:432 \u00B7 packages/fff-bun/src/ffi.ts:667 \u00B7 packages/fff-bun/src/ffi.ts:863 \u00B7 packages/fff-bun/src/ffi.ts:1029 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d5a97ae1edaa4a8e85feeeb239c8072d925957ee74bf9e1f78cdb4b1e9e9fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/fff-node/src/ffi.ts:278 \u00B7 packages/fff-node/src/ffi.ts:291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8c9517cc69615ee7affa49a0fb56b970edd011bbeb67048b4b58086881ec05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/pi-fff/src/index.ts:1226 \u00B7 packages/pi-fff/src/index.ts:1370 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd717775f9704a193c5a65d7e30e0831f7918056be80d2e03e8bfe95c629b55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/fff-node/src/ffi.ts:713 \u00B7 packages/fff-node/src/ffi.ts:764 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4bded7e4a30ee30e509d609271381eeb2beb6ef522169cd884f182b252a957"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): packages/fff-node/src/ffi.ts:911 \u00B7 packages/fff-node/src/ffi.ts:1002 \u00B7 packages/fff-node/src/ffi.ts:1081 \u00B7 packages/fff-node/src/ffi.ts:1177 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"773b76290e82577781bb94ed488b464392d12bfe395eab29cc3c86ba729128ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/fff-bun/src/ffi.ts:502 \u00B7 packages/fff-node/src/ffi.ts:331 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b28f58d4c3720f0bc60367d3232f4ae8c51ddc65d9fb39a499b018fa580744"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/pi-fff/src/index.ts:1243 \u00B7 packages/pi-fff/src/index.ts:1384 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"412ddf628cf92ebd0915817c6a067f134a4f2e946f7de6caa78476dac1de6c27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/fff-bun/src/ffi.ts:392 \u00B7 packages/fff-node/src/ffi.ts:155 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84c2d58d6047e5adf57cc7c20280c6263792c641e4ed7f5812332754f3a7e87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/fff-bun/src/ffi.ts:688 \u00B7 packages/fff-bun/src/ffi.ts:898 \u00B7 packages/fff-bun/src/ffi.ts:1074 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce40295991191bc65980a490881f961d30f883c71718dabd5aaf890adc23864e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/pi-fff/src/paths.ts:45 \u00B7 packages/pi-fff/src/paths.ts:53 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/paths.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7138f60e1f5221c53a9e1d268fde71864e675d36b3b1f0beaa7288460cf1fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/fff-node/src/ffi.ts:308 \u00B7 packages/fff-node/src/ffi.ts:324 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19ec47817f4fcfda5db5e2205c57507ed2580834e54f5f836a50269e984c400"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 64, cognitive 67): execute has cyclomatic complexity 64 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"2603bf1b905e2756e2545418cb9bfce2542d4d1fdb89b2f1f9a1e7222fd8afe6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 26, cognitive 25): execute has cyclomatic complexity 26 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b68e0e2234d0ce299b7b0bc3516dba6426b4e71cc4dce37e318aa52f0e1e45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 23, cognitive 23): execute has cyclomatic complexity 23 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b15b5038d2421a29881e033125f96256ae67de916894f8f1f641e1ecfba116"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizePathConstraint (cyclomatic 21, cognitive 21): normalizePathConstraint has cyclomatic complexity 21 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/query.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"011b9349f8fe6303153adaf19cf59260cd0832c6fe6a9b411ac96a3c133affa7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 21, cognitive 19): create has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/finder.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"45de9a1cfa86ef2f5fd4a9c1eff80f748a453380e441bc4e9c420415af0054d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 20, cognitive 18): create has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/finder.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"199b9931d67b9ff226c291aca77c96af1bdb463fd3739be169b5345109fec8e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 18, cognitive 27): main has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/test.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d218abd40a85ce2a3fd9fe77fb10d6c201c33db9d8a466c197aa8e67dfe5cb34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ffiCreate (cyclomatic 18, cognitive 18): ffiCreate has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"f369a90fd0d2ddff8e9d8ea0f4d017e037d8e1a4e81656b8faa4c2859da545dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ffiCreate (cyclomatic 17, cognitive 17): ffiCreate has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fc81ce85a0ad9da20dc90757d6f5a378f7ca26a442c19255a5daa3ee16ea76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function multiGrep (cyclomatic 15, cognitive 14): multiGrep has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/finder.ts"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"a629aa14812485bfbeaaf799954c92e4348637dc6858abb2b27c81f65b6b2711"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function multiGrep (cyclomatic 15, cognitive 14): multiGrep has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/finder.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef440851d1bcc296357bd6d43faba4b33d5b8629ddda58ecdad81460aecb8732"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMixedSearchResult (cyclomatic 13, cognitive 14): parseMixedSearchResult has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d0120e7010d0132a4e3b2b5d7c77b35578a5adc71aec66703bc2bcabcc4b96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function grep (cyclomatic 13, cognitive 12): grep has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/finder.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"24193061e79d5ca868666c198065cb46e33cc8a43cbd18aca62f21bbe260eeef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function grep (cyclomatic 13, cognitive 12): grep has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/finder.ts"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7ac0ba39a7f6a22420b186965ec594e3a545501f4382a6760ec2de1197ed5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 12, cognitive 12): handler has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"369ee83773d7f27d31875e37ef458a36c432c130e997027af9957e03bf1565de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function declaresWord (cyclomatic 11, cognitive 9): declaresWord has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"08612ec6a15d97550b5d63a3eca931329415dc934ec6772226d4f542e599442f"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/fff-node/src/ffi.ts: 1741 lines of code: packages/fff-node/src/ffi.ts has 1741 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a4ce0e2ed8cc2da34b1dac33f7152bf02c90a749130ef6b22278407ddbce0e"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/pi-fff/src/index.ts: 1576 lines of code: packages/pi-fff/src/index.ts has 1576 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f12b32f702212b662b2c82665e49a2ddf07dc0b5d8215acc0a5e441681ad1ad"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/fff-bun/src/ffi.ts: 1437 lines of code: packages/fff-bun/src/ffi.ts has 1437 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/ffi.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"767ab0a54ea06ef1e97d54fce8c33a1df50400a649364dff125e7b0b7d4ebe97"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/fff-bun/src/finder.ts: 694 lines of code: packages/fff-bun/src/finder.ts has 694 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/finder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"693c1db475adb16f127ea54b7bc444b5ae90085ca4778e638be26e3b5a37b023"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/fff-node/src/finder.ts: 673 lines of code: packages/fff-node/src/finder.ts has 673 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/finder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd405a8a276f65ff62554bef05c6b484ed3149c11242619031ebbf80513e615d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/shared/fff-api.ts: 634 lines of code: packages/shared/fff-api.ts has 634 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/shared/fff-api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a1a6b224e8a30ed0bcccf997cabd0f363eccfc80ecaabe825cb09db523e067"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"190064f2c7bf4596b25d92ea7f97d59c17c83b36d5711787ebe86c080e1092cb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/scripts/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ed5ff49433f1010cd0010bea6f9d3512343ca28a4d44c1994234a0ca5dc7ac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/scripts/postinstall.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e68e7e949b841419502a6e095d752298d151ef2df79d5b0a006cecaf58cce8d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~156 LoC): no import path from any entry point (11 application, 3 tooling, 16 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ba4fa90f5dd9d43cd8a40f2164ea11f300e7ad1c543ce9117fd05d51381a4a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~122 LoC): no import path from any entry point (11 application, 3 tooling, 16 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/scripts/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c3726bec2925c17a946b3668f1572a0a5622ee82b4ad0f46e3eeb54dcc6e01"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~50 LoC): no import path from any entry point (11 application, 3 tooling, 16 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/scripts/postinstall.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff82a48d0d84a5f20b0117671d3aae0a8b72acde717d7194ff8cebe3a734d66"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!options.patterns || options.patterns.length === 0\u0060 appears character-identically in 2 files \u2014 packages/fff-bun/src/finder.ts, packages/fff-node/src/finder.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/finder.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7154f1bcd3e56f9d6950832a353321cffeb13df1bc96c9c8b0e362ca300bd37c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!progress.value.isScanning \u0026\u0026 progress.value.isWarmupComplete\u0060 appears character-identically in 2 files \u2014 packages/fff-bun/src/finder.ts, packages/fff-node/src/finder.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-bun/src/finder.ts"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a8c0ff9b008a063000586c2fdb0f9ad04f9c51d4938293f14bbbd04fc5a060"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.matches.is_empty() \u0026\u0026 result.next_file_offset == 0\u0060 appears character-identically in 2 files \u2014 crates/fff-core/src/grep/grep.rs, crates/fff-mcp/src/server.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/grep/grep.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb03859887b645c0aebc55a953f9c134d0831e2b95ce052a91a4ebf8e9645cb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 58 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2ca7c0651fac7b1c18f651121182282eb7cacf548a97287ce89c0cd37c2fac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 63 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/lib.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b61a3a100f1d29734909c21062cd599b2673527c5d785cf365d028abf60b6d9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 97 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/path_shortening.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c288bae2cb6f75ba1424bb07d8cd9a5959d293a0cf1b6499ccce40ca3dba48"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 253 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/main.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63e34dc78dae7c828b175f0298b3a8521a0edaf3d264637bdeefc30366a607c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 256 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/main.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d8b0eaa92545e4f51028662926539f27e64e2577bd632f6c0baee26f5283a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 261 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/main.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ce2ed234b47ccddf9e625f46ca6982cc4dc3112dc6ef955e5ec08d616b0847"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 337 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/main.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa2640bc6f6b1d43851868a36fa47fe1d521825df578fb0464a5cc8a4b476b0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 356 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/main.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45693385305034e2318adaf40b3a9e33dbc2614a4acdd2ad18b4e54d98e754a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 382 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/main.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3bbc870389e8a40cd7225311b493ccb60f356247f35ae456e87f188bed9914"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1011 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"0300df6766398d23fbf3433b492d3f74702f25345ed63dbb64c2d0d187c017b2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1026 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a025c3ba8083ad00248c63d4a0d177fb76d50d70905281be4862a80edb8773f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1031 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba0554c53682e5f7cea7f3e8be048b34400a7b6ac33b14f9df823f02463fb63"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1115 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd05c1105ff1a35e486122fa0034a5c367985219b21bbd23b814bbcbca57699"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2270 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":2270}}}],"partialFingerprints":{"codehealthFindingId/v1":"80960878a7ced6be33d4932a7745d984f3984e1164fbd01b204575f390ab88c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2403 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e9082bbedcd87b5c9774991eaedac1cb9b1c4c98932c940f53c7ca21c758d2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 143 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/git_status_worker.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8ac871778d1d6082f3e581275d0fcc9a31d7e1c8e49cf109559516de27fcfa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 148 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/git_status_worker.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6205a7e08ceac2d4017b2a58e67c72cb8ad15d89c0ba3e43cb8a2144b7cb61"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 75 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/ignore.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8162128c33a5b381dd24bb1c21a35680ce4ed0a81bf41fb0f888c8f660f12797"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 272 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/log.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95a1a1c9ba15b12db917a8f74ce5a44e9aef574630a8a30db044098b482964d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 40 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/shared.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc8012e22fb7a5d197cb7dc779af083c4d37ddbe05acc0bff05706a27b1ccd6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 66 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1b47a2ca20c943b70f0bcb0c665afdce11074a14cc42d63eca02a42fabd11b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 240 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa8574edfbbbf835f2de72707b928647e3deb8228ed0db430afd62a5b32419c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 254 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbcc2820ff1f5d61e9dffd88a8b99b2ed1dcb871c350fab85b227333318c266"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 417 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ca47c75a2461c7d20cfb5d6592b1926fa4644468f60c1b4f1a789abf0f0435"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 479 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a364ed3e5fe58b28171732a9e0852f39457d4324fee9c2d620232ae19b5821"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 577 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"9192d87fe598545dc7d6942143385eaa59de1a77595eb28d4b6bf8038bfde3a1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 609 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a3160dd75e81b9d4fc459c5ee767d1de26f09195839c846c3cf1e6ebd7dc4b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 758 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2869ac64f86ab5fa673512c4f928f280a6956b6746cf55b76cb0e77e8ab8506e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 812 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"399cab317c17249acb011274f173125c36ead88e41474a9e967e368b5aeefe36"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 818 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca178c2034ec93ca27fd1820b54135e085857069882417ac0254e859d20adf2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 977 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"079c610abd9f3b4bb16d49d6ab092226258255ea0afd63d9864a9b2a8bcb0aeb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1113 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e34d8a457463091d1e72695ae7cf14a295352327c73fc75f5bb06dbb488e580"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1125 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba1042cd9123a0a69e5cc7f36a75bf22467fb50d5d2e516aa23768316a0508a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 369 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/grep/grep.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"241f0c6303d573c9cd0620c110721df5b9963834e0dcc29995b39800a91ce43c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 132 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/dbs/env_pool.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abca4142d23d0959813826d8abadcf092e603c075b3d76af10d9b45db07540e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 80 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/dbs/lmdb.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde1f46fe47efc967e341f411a9b1acd7ae265072d993cc01480a076ede7d873"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 94 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/dbs/lmdb.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9620ec668b7e15936e85cd6ccebf31278cb26b547f2abb5ba7111fe0e1eb28e"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~0.3 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 3 assertion(s) across the 9032 source line(s) of the 21 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: packages/pi-fff/src/index.ts (3). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060get_comm\u0060 swallows every exception into \u0060return \u0027?\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/diagnose_lockmdb.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1656a6200d22b357775883472abac80d1edfb4206aea7787381868970c1e00a2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060get_cmdline\u0060 swallows every exception into \u0060return \u0027?\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/diagnose_lockmdb.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be931ab8a7676d52d7e892f16ed16e72cfe6bf543cb2ce8d99fdbce6cc396c8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060get_wchan\u0060 swallows every exception into \u0060return \u0027?\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/diagnose_lockmdb.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f9acd1d765fd89af4c9eb13f6188466f286015cf695033fa01f0c50804e22cb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060decayed_accesses\u0060 turns every \u0060Err\u0060 into \u00600.0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/dbs/frecency.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"9594109a91a641139cee3ba198be57bc0b88e334262087a5fd85d96045cbe984"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_into_buf_std\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/types.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae38df969649a48f63e16f338de37dea40cda6887e7af400547fd15a6fbab4a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060check_latest_release\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/update_check.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"31545abe3fb4bf5c3f7453a60e262ada8ef1f24128118ae8a2a08a9385333e90"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060m.line_content.contains(\u0022abc_\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060m.line_content.contains(\u0022abc_\u0022)\u0060 also satisfies \u0060m.line_content.contains(\u0022abc\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/tests/grep_integration.rs"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d85eebe3ae7b37600aeb4a091aedee60819aea7ba845c0c71d510920f80332"}}],"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-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-269","guid":"70e1f5f6-81e5-4e5a-ba40-b541c3a346e2","name":"Improper Privilege Management","shortDescription":{"text":"Improper Privilege Management"},"helpUri":"https://cwe.mitre.org/data/definitions/269.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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-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":138,"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."]}]}