{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"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":"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 148): index.fffExtension has cyclomatic complexity 148 (threshold 15). Of this number, 108 points are the body\u0027s own statements and 40 belong to 11 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"72eb721141c8f1a740a825d24ac81148ae51ab1265b36207f2d65e2914a9f03b"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::watcher::background_watcher::handle_debounced_events (cyclomatic 85): fff_search::watcher::background_watcher::handle_debounced_events has cyclomatic complexity 85 (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":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cff679b1782ff0332c3e101039f51db702a1d6a9c1fbd23a79f763e016c6d2"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::score::match_and_score_in_arena_inner (cyclomatic 46): fff_search::score::match_and_score_in_arena_inner has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/score.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"31133f7362588d430d9fdd543502cda06519c69e02e0e87ca497ff49d33a40d2"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::grep::fuzzy_grep::fuzzy_grep_search (cyclomatic 43): fff_search::grep::fuzzy_grep::fuzzy_grep_search has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/grep/fuzzy_grep.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ab7cda4924f41f21d0e6c0ca4e216749b6662810418ffa108952d8d15677f1"}},{"ruleId":"D1","level":"warning","message":{"text":"GrepFormatter::format (cyclomatic 39): GrepFormatter::format has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/output.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c8ca5940837ecb7cabd3adfc43d956b877416e73b0b0bfccda72f4c133f115"}},{"ruleId":"D1","level":"warning","message":{"text":"diagnose_lockmdb.main (cyclomatic 34): diagnose_lockmdb.main has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/diagnose_lockmdb.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"015f49963b2b7f6a729b96ddc06864f5bf118aefa612fe6d0fbb808ae2b75762"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_search::grep::prefilter::prefilter_files (cyclomatic 31): fff_search::grep::prefilter::prefilter_files has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/grep/prefilter.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0476f9bcd97325ccbfc839480118c40250fc382ecd83e78b293d31a8161636e5"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_mcp::output::format_files_with_matches (cyclomatic 29): fff_mcp::output::format_files_with_matches 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/output.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9893f57e9a11e2ce551238ab682c564dff42685a5e97bd9e2669046fd9a21f"}},{"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":550}}}],"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":278}}}],"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":152}}}],"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":"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":"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":"BigramIndexBuilder::compress (cyclomatic 19): BigramIndexBuilder::compress 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-core/src/index/bigram_filter.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"1948d1bf26a531ec883dfa8770932347fa8f8a2539d6bfe6568fc7a480551efd"}},{"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":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"0771a07d4f842066203da30cb45ed6864f3c701e5d0751e60cc4e2e8a86c2fe9"}},{"ruleId":"D1","level":"warning","message":{"text":"fff_c::fff_create_instance_with (cyclomatic 18): fff_c::fff_create_instance_with 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-c/src/lib.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dbfa73364c3f1254cf515e583a91c86f977bad730029340b4aec738d487c78"}},{"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":773}}}],"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_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":"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":"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":1169}}}],"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":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2662881cbfcbd1dffde58d2467471f4f1e72a2a25cba9c85b188df072e838f2d"}},{"ruleId":"D1","level":"warning","message":{"text":"FffServer::perform_grep (cyclomatic 16): FffServer::perform_grep 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-mcp/src/server.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"1574a82e37fe7e06beafa793a318b30f38d89c35fce2f3e506aeef63ded23c6c"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze-results.load_stream_trace (cyclomatic 16): analyze-results.load_stream_trace 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":"scripts/analyze-results.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b215822e9f33deef6cabb0c650fe8f3664899a65679d294150f44a09fbe38231"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::watcher::background_watcher::handle_debounced_events (cognitive 177): fff_search::watcher::background_watcher::handle_debounced_events has cognitive complexity 177 (threshold 15). Drivers by points: if/else 54 (119 pts), loops 10 (26 pts), boolean chains 18, match/switch 4 (14 pts) (nesting depth added 91). To reduce it, split the body into named stages: move each independent step or branch into 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":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acaa5f0a0abe19351ea4a75c6484d27ab0ae385fee36acf39a6c72b5ac6fcae"}},{"ruleId":"D2","level":"warning","message":{"text":"index.fffExtension (cognitive 163): index.fffExtension has cognitive complexity 163 (threshold 15). Drivers by points: if/else 87 (102 pts), ternaries 24 (29 pts), boolean chains 24, error handling 5 (8 pts) (nesting depth added 23). Of this number, 121 points are the body\u0027s own statements and 42 belong to 11 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/pi-fff/src/index.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c6f95330a8981dad14b88c985a4355ba11836b674512a9851cd85300cabc9e"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::grep::fuzzy_grep::fuzzy_grep_search (cognitive 104): fff_search::grep::fuzzy_grep::fuzzy_grep_search has cognitive complexity 104 (threshold 15). Drivers by points: if/else 37 (86 pts), loops 7 (12 pts), boolean chains 6 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into 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 75): fff_search::score::match_and_score_in_arena_inner has cognitive complexity 75 (threshold 15). Drivers by points: if/else 47 (58 pts), boolean chains 12, loops 2 (4 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/score.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4af7ebdf0a4830d4a0e68a60b2d883d68a0e1a051af00bfc57729537973823"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_search::grep::prefilter::prefilter_files (cognitive 75): fff_search::grep::prefilter::prefilter_files has cognitive complexity 75 (threshold 15). Drivers by points: if/else 18 (51 pts), loops 6 (16 pts), boolean chains 7, match/switch 1 (nesting depth added 43). Of this number, 74 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/grep/prefilter.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd151be69379dcad0be95ab4fca2bb53befc8a13b358fb85f392ee80464b9c91"}},{"ruleId":"D2","level":"warning","message":{"text":"diagnose_lockmdb.main (cognitive 71): diagnose_lockmdb.main has cognitive complexity 71 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 9 (15 pts), ternaries 3 (12 pts), error handling 4 (10 pts), boolean chains 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/diagnose_lockmdb.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b18d0d73e320ddbb1f050e7e231d58bf288e4083a4cca783a1ba1e470c03728"}},{"ruleId":"D2","level":"warning","message":{"text":"GrepFormatter::format (cognitive 65): GrepFormatter::format has cognitive complexity 65 (threshold 15). Drivers by points: if/else 31 (46 pts), loops 6 (12 pts), boolean chains 7 (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-mcp/src/output.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce41a0f28ec4703b85caa228a6da502e600e680ffc3b1a08b75155d1a2370bfd"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_mcp::output::format_files_with_matches (cognitive 62): fff_mcp::output::format_files_with_matches has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (49 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/output.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2197e3d31592d230933d16a64ab87d0437e623685096c4d7e734e421b5bad31"}},{"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":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b048664f18b684fb40c2f6ed40e563af6fd0e642f1a52bb1bc3b093598f6ddf"}},{"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":278}}}],"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":"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":773}}}],"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":"FffServer::perform_grep (cognitive 37): FffServer::perform_grep has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-mcp/src/server.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"84edc2957d0ef5a6fe6454dcdd482a4928c189c476e14f6f88090dba5262137c"}},{"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 (cognitive 32): BigramIndexBuilder::compress has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (6 pts), boolean chains 3, 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":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41b546221a1bb7eff35a5b46b2953b3f13bef616f444dabf10f0532cc42b5be"}},{"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":1169}}}],"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":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6064c954e5bcc1218ce362e0378c067679b1399587fb0286a92e9e56f7f53f"}},{"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":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f3ff46e5a38f0b5f7687d1a40668d74d485acfe40f55c763d72a5282589002"}},{"ruleId":"D2","level":"warning","message":{"text":"fff_c::fff_create_instance_with (cognitive 27): fff_c::fff_create_instance_with has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 3 (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-c/src/lib.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fa3d35e115eb97c5124e4f8ce4358b06c414216b3f932917a22231e296c471"}},{"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":"fff_nvim::health_check (cognitive 27): fff_nvim::health_check has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 5 (9 pts), loops 2 (8 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/lib.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"47483e08ba34b85fa90225d32de5174eca5493fd92bf0dddcda3c90e8dbbff84"}},{"ruleId":"D2","level":"warning","message":{"text":"BackgroundWatcher::create_debouncer (cognitive 25): BackgroundWatcher::create_debouncer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (4 pts), loops 1 (2 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/background_watcher.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dd62b9557fc9380045ef1d896d94f29849904e1a7f65d880f6dc1b789659bc"}},{"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":455}}}],"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":"analyze-results.load_stream_trace (cognitive 23): analyze-results.load_stream_trace has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-results.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e22e811195560ebbe329b98ab18e1d132868bbc472ad1d3a7d243ad35fcf14"}},{"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":"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":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5874378f85c3a88d29975a6c5e46029ab635bc883fdbed397fa754a461d683"}},{"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":"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":"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":274}}}],"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":"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":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba0ce9af2ba660a11c651ecb01f41af2183bdafecc3cf602e921801df096c53"}},{"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":46}}}],"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_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":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21115cacfe64a5686b56193417be64f49c9a2e1c5ef3f607f1fce58346b4d21"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-results.load_iter_results (cognitive 16): analyze-results.load_iter_results has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/analyze-results.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43de5097c3438e1dcaa4355ede1da8ab9865933471019b244523eedaf67cd51"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.fffExtension: FunctionTooLong \u2014 fffExtension runs 770 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 670 over it, 7.70\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":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1862162280e01b2afabe4a4d97cb2ba5ba1bd6f842f83b15f973b5255cb48a99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/file_picker.rs: FileTooLong \u2014 1455 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 955 over it, 2.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/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 262 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 162 over it, 2.62\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":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb22aa7a048bdb8ea59d755cadf4306adbd6e17a3a05eb6c3935ab3148c889c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ffi.ts: FileTooLong \u2014 1279 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 779 over it, 2.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/fff-node/src/ffi.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0773995d7ba3fa8475fee56bb0a9c680a544e34ed99d90e7716ef27ecf11fa9b"}},{"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 215 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 115 over it, 2.15\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":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cb50df121b11715fb5dc4f8022044051decb56c5d320ff392fa7e0b68950c1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FilePicker: TooManyMethods \u2014 64 methods. The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"17016fc91424aecb960a20ef41b46c3320dd8ab0bdc8fcedb4e5aff445b0bea2"}},{"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 212 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 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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":"ClassTooLong: FilePicker: ClassTooLong \u2014 822 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), 64 methods, 5 blocks, lines 589-1987. The bar is 400 significant lines; this is 422 over it, 2.06\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":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02ff63fb5c14bca8b389dba9beadb4de7b9f6665b10950eb4f61b665a3759fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ffi.ts: FileTooLong \u2014 1017 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 517 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"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 990 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 490 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d92717270daca1128593a123be5990569f6e03c53952628581dfa6f9c85b17"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.ts: FileTooLong \u2014 960 significant lines (blank, comment-only and punctuation-only lines excluded), about 80% of them inside a single declaration: fffExtension (305-1501). The bar is 500 significant lines; this is 460 over it, 1.92\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":"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-1082. 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/score.rs: FileTooLong \u2014 858 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 358 over it, 1.72\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":"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-1082). 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":"FileTooLong: src/lib.rs: FileTooLong \u2014 778 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 32 free functions. The bar is 500 significant lines; this is 278 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcb572b0e3aa9a866442826ad66e1845ce6550dd8689ff1b47edebdab35ddaa"}},{"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: index/bigram_filter.rs: FileTooLong \u2014 743 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 243 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/index/bigram_filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4e1c7c586bcd1d8481fc9e212df86749c8ed78f93c443bbebebd8ce5359b6b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GrepFormatter.format: MethodTooLong \u2014 format 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/output.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b92e6fc90e9c8bc8ce14b23308d843a65556990272e7638bc7558d7e1bf028"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_mcp::main: FunctionTooLong \u2014 fff_mcp::main runs 136 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 36 over it, 1.36\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":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"481ed84196f32367549c5ef6212f0ba0b56042c13be1109d3f0fbdce3d853911"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: watcher/background_watcher.rs: FileTooLong \u2014 674 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 174 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75eed6fedfc8e0f2dde25f1441ee0fbe7b5948e073e92d9ffd5466f43f551f10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 666 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 166 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"840156c0cbee594388d1f7f1ea9d3dd866ccb4ae0942c85471b14ab1bdde649a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FileItem: TooManyMethods \u2014 39 methods, declared across 2 files: src/types.rs (33), src/file_picker.rs (6). The bar is 30 methods; this is 9 over it, 1.30\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":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68eacd73f3afd237e00368e387792784b444ab2dc48fa16623bfe049e761104"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fff_search::grep::grep::grep_search_parsed: FunctionTooLong \u2014 fff_search::grep::grep::grep_search_parsed runs 129 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 29 over it, 1.29\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":274}}}],"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":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3efe1f959df089df68d5643a8025ccb6c79e78a55a19d6d3340f6b94cbfb0ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FffServer.perform_grep: MethodTooLong \u2014 perform_grep runs 113 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 13 over it, 1.13\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":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"877175dad2661bddbb56f01d10b87e5df5beda98de272ee72a5e790a370609a6"}},{"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":455}}}],"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":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17ac57656dc6750e738275c5f4b3d853d759a3bf439bf6c37cc417e97ab364b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 20 shared lines): crates/fff-c/src/lib.rs:346-402 | crates/fff-c/src/lib.rs:482-528 | crates/fff-c/src/lib.rs:548-603 | crates/fff-c/src/lib.rs:670-720 \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":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68b47f43f2d187845ce460a40fe1ad75d3007cacbc822596cd4b90476109579"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/fff-c/src/lib.rs:1357-1379 | crates/fff-c/src/lib.rs:1428-1447 | crates/fff-c/src/lib.rs:1539-1561 | crates/fff-c/src/lib.rs:1611-1633 \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":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb8ec46ee53e1184194c0c521e80df164f5652a880d247a37a01b2d1260ff6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/fff-c/src/lib.rs:1390-1399 | crates/fff-c/src/lib.rs:1458-1467 | crates/fff-c/src/lib.rs:1571-1580 | crates/fff-c/src/lib.rs:1643-1652 \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":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"735a143027c6d45a158cafeba110819c9091b191ea8265cc20506d02f58fb3ce"}},{"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":"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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/bin/bench_search_only.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4578d5dcc0e21233984e1c3b2113dec7c97c41d120bb6f170ac61c4cbeb16b76"}},{"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."},"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:350-379 | crates/fff-c/src/lib.rs:552-580 \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":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc20407a0cbd9a27126ebd7d438392fb9f39c02586f25d2ca5be9968135b877"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/fff-c/src/lib.rs:1270-1299 | crates/fff-c/src/lib.rs:1309-1338 \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":1270}}}],"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."},"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 (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."},"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 (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."},"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 (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."},"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:951-971 | crates/fff-nvim/src/lib.rs:981-1000 \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":951}}}],"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."},"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 (18 lines \u00D7 3): crates/fff-c/src/lib.rs:1362-1379 | crates/fff-c/src/lib.rs:1544-1561 | crates/fff-c/src/lib.rs:1616-1633 \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-c/src/lib.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"65215064b5a60fd73e49fac47eb549ae4bb41e4a03b6210529abca049f71880b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/fff-core/src/score.rs:118-135 | crates/fff-core/src/score.rs:422-439 \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/score.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd9b18a699fb468f279706642844e6b5e187ae5a31f0af5c4c348d7e65f895c"}},{"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:629-641 | crates/fff-core/src/score.rs:1110-1124 \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/score.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"661bb179012dd9f861555ffcbcd56fe2e6f52addf28dc531f3bc72e9ee53622a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/fff-c/src/lib.rs:889-902 | crates/fff-c/src/lib.rs:913-926 \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":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"a739ef5474d53f98a130a3c58e8c7f4c2a2b2e31b7a1d9dc42d5261103f3875b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/fff-nvim/src/lib.rs:801-814 | crates/fff-nvim/src/lib.rs:848-861 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-nvim/src/lib.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db2a99d0ef9107f066522aa61797959e6c5e317b199bf9456b9992612d03a64"}},{"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."},"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 38 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":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:418-430 | crates/fff-core/src/file_picker.rs:454-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/file_picker.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7e97227ab4508fe7efeaa64d41b45f3d8ae9bc069cb37473f5205a05a025a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/fff-core/src/grep/grep.rs:128-140 | crates/fff-core/src/grep/multi_pattern.rs:52-64 \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":"c2f1b12f10f5b2a0482c2a3c0b55417d8e1eec207ef39d1259ffdac9f435dda7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/fff-mcp/src/server.rs:322-334 | crates/fff-mcp/src/server.rs:411-423 \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-mcp/src/server.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"419bcb780510fe695d84e46e2dd94a75ab45ee7ed89efed47597a62ad5c387c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/fff-c/src/lib.rs:430-441 | crates/fff-c/src/lib.rs:491-502 \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":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab913246679ed2935aafccaca88ee4e92475e9c2d8ee1a1024e6bdf4be6d1f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/fff-core/src/file_picker.rs:377-387 | crates/fff-core/src/file_picker.rs:2313-2324 \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":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"402c99c8c04d70bf4329a930a85c813400ba89d1b89f538eb427b0bcea32ef96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/fff-mcp/src/server.rs:415-426 | crates/fff-mcp/src/server.rs:661-672 \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-mcp/src/server.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9831d19aaf0a260967444fb410f214a083c337a60d8dde2d9e44da03896ffc"}},{"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."},"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."},"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:1358-1368 | crates/fff-c/src/lib.rs:1429-1439 | crates/fff-c/src/lib.rs:1540-1550 | crates/fff-c/src/lib.rs:1612-1622 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/lib.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84cb881bb5fca3158518f3cea1a7d7c7f30144cdf97cd4eb6dc7feb0ac49c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/fff-c/src/lib.rs:348-358 | crates/fff-c/src/lib.rs:484-494 | crates/fff-c/src/lib.rs:550-560 \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-c/src/lib.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42faec0a4cb3a0732b46d758c057aa7766a5ba5bb94f46520edc371e6534966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/fff-core/src/dbs/frecency.rs:278-286 | crates/fff-core/src/dbs/frecency.rs:337-347 \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/dbs/frecency.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeaf4943d77b7945c989696a2d744e2289efc9520ccb99d9a4c6b9cc70038387"}},{"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."},"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:363-372 | crates/fff-c/src/lib.rs:436-445 | crates/fff-c/src/lib.rs:497-506 | crates/fff-c/src/lib.rs:565-574 | crates/fff-c/src/lib.rs:682-691 | crates/fff-c/src/lib.rs:803-812 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/lib.rs"},"region":{"startLine":363}}}],"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 38 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/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."},"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:166-175 | crates/fff-c/src/ffi_types.rs:403-412 \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/ffi_types.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7113778793eda7636db308a666879e37106b6a4836b4e44986045263d2100d06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/fff-c/src/ffi_types.rs:199-208 | 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":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d131f190000767beb53293771597485ea7076420a9c4f82663b8767282ee7c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): crates/fff-core/src/file_picker.rs:1105-1114 | crates/fff-core/src/file_picker.rs:1193-1199 \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":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefb947ed48aea985b6cf2e57e844208d894e4e017bc1bcd7ba912c323b531ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/fff-core/src/grep/sink.rs:115-124 | crates/fff-core/src/grep/sink.rs:140-149 \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/grep/sink.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"176c5f1168083c8c30d0db655b06559696ae40f2e49ea66f09ae93652e22ad91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/fff-core/src/score.rs:501-510 | crates/fff-core/src/score.rs:697-706 \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/score.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b863b5ce26d7b7e49860015bb666496a94c38882cf98b0a47a6c9dd97bb17d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/fff-python/src/finder.rs:386-395 | crates/fff-python/src/finder.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-python/src/finder.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18f50fa025da4942d1a017ae45182a6103fe8f8155609d651167ce9ca142b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/fff-c/src/lib.rs:347-355 | crates/fff-c/src/lib.rs:483-491 | crates/fff-c/src/lib.rs:549-557 | crates/fff-c/src/lib.rs:671-679 | crates/fff-c/src/lib.rs:1075-1083 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/lib.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0f2ee99a486efbe44cd52e4a20f327562b066939ef1248b21707b699485da5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/fff-c/src/lib.rs:1391-1399 | crates/fff-c/src/lib.rs:1459-1467 | crates/fff-c/src/lib.rs:1572-1580 | crates/fff-c/src/lib.rs:1644-1652 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/lib.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a89c6c46aa0b89270d5491d7c1e1512cacf86ec3dc599ab0febffacd4c3e87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/fff-c/src/lib.rs:1411-1419 | crates/fff-c/src/lib.rs:1591-1599 | crates/fff-c/src/lib.rs:1663-1671 \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-c/src/lib.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"1294678e77c468c3d88663fa17c928aec273addb4a8913088b46959fc9facc40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/fff-core/src/file_picker.rs:1393-1401 | crates/fff-core/src/file_picker.rs:1425-1433 \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":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6fb5117a85ba764438aeb08616afed057ccab424ac4bbd4c98a3c4cd6c510b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/fff-core/src/grep/multi_pattern.rs:68-76 | crates/fff-core/src/grep/regex.rs:96-104 \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/multi_pattern.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"60664a6df09fc0460873b0abcab28f05ae2439e8cf4c6922063051bc8292f99b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/fff-core/src/watcher/background_watcher.rs:713-721 | crates/fff-core/src/watcher/background_watcher.rs:758-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/watcher/background_watcher.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfef4b71e95405f8cc816133d4bdaa7140f79968474e2907d5a7e06b2c550d8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/fff-mcp/src/server.rs:405-413 | crates/fff-mcp/src/server.rs:651-659 \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-mcp/src/server.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecb923b5c991f1116d54af031644f638342e41238ec7eaf2ec1a75da22d9273"}},{"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."},"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 38 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/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:679-686 | crates/fff-c/src/lib.rs:892-899 | crates/fff-c/src/lib.rs:916-923 \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-c/src/lib.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bdd8dd031d18234e87a98d7750db7d9219cc3f0e9290a468d5accc21f9107f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/fff-python/src/finder.rs:359-366 | crates/fff-python/src/finder.rs:414-421 | crates/fff-python/src/finder.rs:466-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-python/src/finder.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d3250d3439bd98dbd0cddd4b7760a177edca3a8aee5fef4dbb7d3b9e0ce917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/fff-c/src/ffi_types.rs:151-158 | crates/fff-c/src/ffi_types.rs:672-678 \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/ffi_types.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b7cbb1503e90577c7fd519750e525f25ba2f12b6fbb5eced784e8bd8842bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/fff-core/src/file_picker.rs:1290-1297 | crates/fff-core/src/file_picker.rs:1343-1350 \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":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b2b7f1042583ee80a6755cabce042edf71dd73a3437090159c33fd3d12823c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/fff-mcp/src/output.rs:345-352 | crates/fff-mcp/src/output.rs:469-476 \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-mcp/src/output.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d6345322d55da802a9ea975db63816fc556dcc46ca1d17811b160cb59cb492"}},{"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."},"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-nvim/src/lib.rs:766-773 | crates/fff-nvim/src/lib.rs:822-829 \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":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c91eb9d7e987bd4bd893419338aeae8d3c68fd9fc7a3eb53e0412f01f67e2bc"}},{"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."},"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:362-368 | crates/fff-c/src/lib.rs:435-441 | crates/fff-c/src/lib.rs:496-502 | crates/fff-c/src/lib.rs:564-570 | crates/fff-c/src/lib.rs:681-687 | crates/fff-c/src/lib.rs:802-808 | crates/fff-c/src/lib.rs:894-900 | crates/fff-c/src/lib.rs:918-924 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/lib.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3841cd3233710807715ddb0becb85766a41d6b9f2a096691a384a51d876cba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/fff-c/src/lib.rs:422-428 | crates/fff-c/src/lib.rs:785-791 \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":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b696cdd085240a0ac6f1c2d5d73c9d96b37126e094ce7cad1978d06bb6396ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/fff-core/src/index/bigram_filter.rs:615-621 | crates/fff-core/src/index/bigram_filter.rs:650-656 \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/index/bigram_filter.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dca3811e476be86cef750acf4d88530469b9a7ca62c36aa339da5b8af637893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/fff-nvim/src/bin/grep_profiler.rs:174-180 | crates/fff-nvim/src/bin/grep_vs_rg.rs:251-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 38 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":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5e5626ffc4bff09a9739334f24e5813bb614a50501145e433b5250fdcf5a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/fff-mcp/src/server.rs:287-292 | crates/fff-mcp/src/server.rs:461-466 | crates/fff-mcp/src/server.rs:637-642 \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":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82f0e805a8211a093bec8c7e7bf05fc7d827f380ea40f5a192e0f2ad3333b48"}},{"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":"d188f4350b5baae7a75cda1cf0fea3fe34d82ec31ba836d69dcdd3b4fc3e63d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/fff-core/src/index/bigram_filter.rs:626-631 | crates/fff-core/src/index/bigram_filter.rs:662-667 \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/index/bigram_filter.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cdb381ec918d5a0d5ce8ffb4b1781f2b253b9520c0670bddefda23d6d3b46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/fff-c/src/ffi_types.rs:297-301 | crates/fff-c/src/ffi_types.rs:625-629 | crates/fff-c/src/ffi_types.rs:739-743 \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-c/src/ffi_types.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a9ecd3dbe6d241702fc1dce877d31f848bddcd21c5c1ae50d9b6abe2f7bb99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/fff-core/src/dbs/frecency.rs:286-300 | 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-core/src/dbs/frecency.rs"},"region":{"startLine":286}}}],"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."},"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:1258-1267 | crates/fff-c/src/lib.rs:1297-1306 \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":1258}}}],"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."},"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 (9 lines \u00D7 6): crates/fff-c/src/lib.rs:347-355 | crates/fff-c/src/lib.rs:483-491 | crates/fff-c/src/lib.rs:549-557 | crates/fff-c/src/lib.rs:671-679 | crates/fff-c/src/lib.rs:980-988 | crates/fff-c/src/lib.rs:1075-1083 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/fff-c/src/lib.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21bc8152afbebdb84710c70b686a66b0b10c68b622401f9f2af33442f3c69a2"}},{"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."},"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-search: fff-search: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dbd5aa0c49c5625aeb0c398aed469f275184e6418440884211bce5bf0cecdd41"}},{"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 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"16bda00a3dbc441de58c77b2ba5cf3906c237466b16ad4b5783958dc8433c98c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/pi-fff/src/index.ts: packages/pi-fff/src/index.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 148 in index.fffExtension at line 305. 18 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07: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":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e40de8fab6fa9912017c87cf785aab8dd7f685ddc1f03cf0560cf8e131183e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/watcher/background_watcher.rs: crates/fff-core/src/watcher/background_watcher.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in fff_search::watcher::background_watcher::handle_debounced_events at line 328. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07: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":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc74ece6ec8ee9250da328795f1ea0ba2a69ba6f8e46a0a1421ce78732b04d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/score.rs: crates/fff-core/src/score.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in fff_search::score::match_and_score_in_arena_inner at line 672. 2 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07: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":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc841f5c509b0d56443aa2805c455a0569c2c2f69555d160942fdce5a6ae17f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/grep/grep.rs: crates/fff-core/src/grep/grep.rs changed 9 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 550. 3 of those changes were fix/bug commits, 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07: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":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"825f434b788ecd86c0b4583f25ac617d4d9770630538dc747400146fc91cb8f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/grep/fuzzy_grep.rs: crates/fff-core/src/grep/fuzzy_grep.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in fff_search::grep::fuzzy_grep::fuzzy_grep_search at line 13. 1 of those changes was a fix/bug commit, 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07: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 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in fff_mcp::main at line 278. 5 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07: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":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f742c1e48f548ed541a5f5410e2ca0f510ada8eea8026c1c0673e6c452acc32f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/scan.rs: crates/fff-core/src/scan.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ScanJob::run at line 152. 1 of those changes was a fix/bug commit, 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07: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":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3fe0a80e67d5fc4b3cdb6f736536ebc7784f00e1368b4d812c393f06dc0f73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-core/src/index/bigram_filter.rs: crates/fff-core/src/index/bigram_filter.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in BigramIndexBuilder::compress at line 376. 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07: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":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91160d56bd15183e84f2fdf7c0464d83d4b00d7d5a40df90fce858181dd4a41"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-c/src/lib.rs: crates/fff-c/src/lib.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in fff_c::fff_create_instance_with at line 183. 2 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07: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":183}}}],"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 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in fff_search::grep::prefilter::prefilter_files at line 53. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07: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":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ee25dc6b80146e440a00bfe3e18489016efcca5d33f13dcef77f6d27f43785"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/pi-fff/src/query.ts: packages/pi-fff/src/query.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in query.normalizePathConstraint at line 3. 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07:00\u0027 --full-history --no-merges -- packages/pi-fff/src/query.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/query.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb1bc1b7d8c43dec35a13390c225b69d5bcdba6809d23623ca1231fcbbc5428"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/fff-nvim/src/bin/grep_profiler.rs: crates/fff-nvim/src/bin/grep_profiler.rs changed 2 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07: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: packages/pi-fff/src/aux-finders.ts: packages/pi-fff/src/aux-finders.ts changed 8 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is aux-finders.resolveAuxRoot at line 126), 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(pi): New database files are not created (#780)\u201D; \u201Cfix(core): share one LMDB env per path within a process (#775)\u201D; \u201Cfix(pi-fff): make home-dir scanning configurable, warn when indexing $HOME (#743) (#749)\u201D; \u201Cfix: Reduce amount of rescans in giant /Users/neogoose like folders (#751)\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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07:00\u0027 --full-history --no-merges -- packages/pi-fff/src/aux-finders.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/aux-finders.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffa17dabf3deef98b23ecbcf1c36f45245158cf3b4e7782c4011612cfff9955"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/fff-node/src/ffi.ts: packages/fff-node/src/ffi.ts 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 11 (its worst body is ffi.ffiCreate at line 355), 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(sdk): decode FffGrepMatch and FffScore with the real C layout in fff-node and fff-bun (#891)\u201D; \u201Cfix(grep): enforce_time_budget option for zero-match searches (#826) (#827)\u201D; \u201Cfix: Reduce amount of rescans in giant /Users/neogoose like folders (#751)\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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07:00\u0027 --full-history --no-merges -- packages/fff-node/src/ffi.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/fff-node/src/ffi.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"316fe4446fd048c4b157ac04e60b7e94ff83a32eada665e2712d2ea814434ee4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: packages/fff-node/test/watch.mjs: packages/fff-node/test/watch.mjs changed 4 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 4 (its worst body is (anonymous) at line 79), 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(windows): rename events paths arrive correctly (#881)\u201D; \u201Cfix(bun): Add a proper build step for fff-bun (#766)\u201D; \u201Cfix(fff-mcp): compare CARGO_PKG_VERSION to stable release tag (#721) (#729)\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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 16:43:19 -07:00\u0027 --until=\u00272026-09-27 16:43:19 -07:00\u0027 --full-history --no-merges -- packages/fff-node/test/watch.mjs\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/fff-node/test/watch.mjs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f55a9d947e2e60c306e7fa8cc9a70090f6e50dd272239ec5cf7000f9eab79b"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 24 significant file(s) lose their only recent owner: crates/fff-core/src/score.rs, crates/fff-core/src/watcher/background_watcher.rs, 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/scan.rs, crates/fff-c/src/watch.rs (\u002B16 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 (25 single-owned of 92 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 92 of the 114 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"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":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2eefe8be81fe82e286143a434cd55acd0916b31b26d9dd8c23163e12c47a50"}},{"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":280}}}],"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":1823}}}],"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":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"942cdce90f61b8883e68a92ec1759024311f45e090c40b2ece403894ac83be7c"}},{"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":"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: // TODO: figure out a better optimized way for zlob to rerun the directory walk using existing \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/watcher/background_watcher.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b10711ff6cdde477d054f9c04986d4a3f854904bbe27e16be2dc8223a49b12a"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent return type for path lookup. One returns the item directly (implying it always exists or panics/returns default), while the other returns an Option. This creates confusion about whether the item is guaranteed to exist.: Standardize on returning \u0060Option\u003CFileItem\u003E\u0060 for both, or ensure the non-Option version has a clear invariant (e.g., \u0027must exist\u0027) and document it. Given the mutable variant returns Option, the immutable one likely should too. (signatures: FilePicker.get_file_by_path(path: impl AsRef\u003CPath\u003E): FileItem | FilePicker.get_mut_file_by_path(path: impl AsRef\u003CPath\u003E): Option\u003CFileItem\u003E)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"155d24dfc3491caee4087e03ee471bbd91c5ad4e9e183056731f65199ecaec51"}},{"ruleId":"D22","level":"warning","message":{"text":"Two constructors with significantly different signatures for the same type. \u0060new_with_shared_state\u0060 is a specialized factory method that duplicates the intent of creating a FilePicker but requires internal shared state objects that are not present in the standard \u0060new\u0060 constructor. This suggests \u0060new\u0060 might be a convenience wrapper or that the shared state pattern is inconsistently applied.: If \u0060new_with_shared_state\u0060 is the primary constructor, \u0060new\u0060 should likely delegate to it or the API should expose a builder pattern that handles shared state internally. If they serve distinct lifecycle purposes, the naming should reflect that (e.g., \u0060new\u0060 vs \u0060from_shared_state\u0060). (signatures: FilePicker.new(options: FilePickerOptions): Result\u003CFilePicker, Error\u003E | FilePicker.new_with_shared_state(shared_picker: SharedFilePicker, shared_frecency: SharedFrecency, options: FilePickerOptions): Result\u003CFilePicker, Error\u003E)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e64a00516fa43acb23e434a527045e03575332df03aa38667d1cbfc517d840"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent method naming for search variants. \u0060fuzzy_search\u0060 is the default, but \u0060fuzzy_search_directories\u0060 and \u0060fuzzy_search_mixed\u0060 are explicit. However, \u0060fuzzy_search\u0060 takes a \u0060query_tracker\u0060 while \u0060fuzzy_search_directories\u0060 does not. The naming doesn\u0027t clearly indicate that \u0060fuzzy_search\u0060 is \u0027files only\u0027 vs \u0027mixed\u0027.: Rename \u0060fuzzy_search\u0060 to \u0060fuzzy_search_files\u0060 for symmetry with \u0060fuzzy_search_directories\u0060 and \u0060fuzzy_search_mixed\u0060, or use a single \u0060search\u0060 method with an enum parameter specifying the scope (Files, Dirs, Mixed). (signatures: FilePicker.fuzzy_search(query: FFFQuery, query_tracker: QueryTracker, options: FuzzySearchOptions): SearchResult | FilePicker.fuzzy_search_directories(query: FFFQuery, options: FuzzySearchOptions): DirSearchResult | FilePicker.fuzzy_search_mixed(query: FFFQuery, query_tracker: QueryTracker, options: FuzzySearchOptions): MixedSearchResult)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3917127720ff151c232ca65ca534b896c2dad568db2c3d3e193fd4ac33baa0ad"}},{"ruleId":"D22","level":"warning","message":{"text":"Duplicate function signatures in the same module. The second signature uses an underscore-prefixed parameter \u0060_bytes\u0060, which in Rust usually indicates an unused variable, but having two functions with the same name and signature in the same scope is a compilation error or indicates a copy-paste error in the API surface provided.: Remove the duplicate signature. If one is intended to be a no-op or stub, it should have a different name or be removed entirely. (signatures: path_utils.nativize_slashes_in_place(bytes: \u0026mut [u8]) | path_utils.nativize_slashes_in_place(_bytes: \u0026mut [u8]))"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c4d6b77eb5c07df3e80d9ee91f62432e51cd4d6bf23ca51d936a381569045b21"}},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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":"ecaab293486ea021e279c537440677d1839fa2bc13af5e36736f79f25b390df2"},"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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"}}]},{"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]"],"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":"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":"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":"f8ea38212112d2fa86037de710c571d3187cbeaac7a555c68eed83bea82a4a13"},"properties":{"dependency":{"package":"undici","version":"8.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8979178c2e4f898eb6409d2872c0d5658ac1e9caa652ae0b4ec8d7ab69326c41"},"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 92 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 and example/demo trees and test files identified by path convention, largest first; 92 of the 114 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":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"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":"R10","level":"warning","message":{"text":"Duplication concentrated across 2 sibling directories (7 clone groups): 7 duplicated blocks under packages/ have copies in at least two of the sibling directories fff-bun, fff-node \u2014 5 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 7 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 7 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 7 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 (190 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 190 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":"b0ea10a3a4b38ed8fff0d2f2694543164abcf5cb3cf124842bf94e50d41261b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (68 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 68 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":"b5bb77c2f0af76ee02e04a0834edce552bd99f78a76986fcfa1f9315c4cf7fca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2 locations): packages/fff-bun/src/download.ts:38 \u00B7 packages/fff-node/src/binary.ts:53 \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/download.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b276df70c2e6fa0cda2bb571e9b985bc8f16af2a22611c10291bdeffe452e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2 locations): packages/fff-node/src/ffi.ts:1206 \u00B7 packages/fff-node/src/ffi.ts:1316 \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":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"61da834a120bd27f1edfd9bc78a88e3bcf69dbc666796b6acb5c45f48433dd4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): packages/fff-node/src/ffi.ts:955 \u00B7 packages/fff-node/src/ffi.ts:1130 \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":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"6737c6855106e4e58757c4fb5a2866aa38de16f032a8f4bdede5ba1058ebdb2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4 locations): packages/fff-node/src/ffi.ts:859 \u00B7 packages/fff-node/src/ffi.ts:927 \u00B7 packages/fff-node/src/ffi.ts:1024 \u00B7 packages/fff-node/src/ffi.ts:1102 \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":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94adc108e6740a18648a6e05aeee7d5b64b23f5bab3a27a657256af4247c242"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): packages/fff-node/src/ffi.ts:1349 \u00B7 packages/fff-node/src/ffi.ts:1409 \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":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fe3e2b8c93d85a567afb85173abb639e013db73401152323b10a5cb14ba629"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): packages/fff-bun/src/ffi.ts:1144 \u00B7 packages/fff-bun/src/ffi.ts:1218 \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":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac6844c60b1ef2fda631aa5bc5095e46b2dc01ce8403d369a31667cb00903ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): packages/fff-bun/src/ffi.ts:728 \u00B7 packages/fff-bun/src/ffi.ts:918 \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":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3aad1ad90e07233a5fc6d28bf6f2f959751d3fb4370d6e3c10c54c7fe1d46f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): packages/pi-fff/src/index.ts:959 \u00B7 packages/pi-fff/src/index.ts:1161 \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":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33a2520ecb8c94e2931bbbf72a275351147ca4218e4d29b2e98a91d03373f39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/pi-fff/src/index.ts:85 \u00B7 packages/pi-fff/src/index.ts:117 \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":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06f65ebe9a0b8e97ca5db546a9687f59cea2cfe9242d84fb24e3bc9d752fd19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): packages/pi-fff/src/index.ts:1446 \u00B7 packages/pi-fff/src/index.ts:1480 \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":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d361fae5e7707b53405a1d645db72fd8cc05a8d9ca7e5fc6ca08388dcac101"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/fff-bun/src/ffi.ts:819 \u00B7 packages/fff-bun/src/ffi.ts:948 \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":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c916726bc170da5757b7c8b882d7f90c1af964e457a498bb4849b2705bb553"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): packages/pi-fff/src/index.ts:982 \u00B7 packages/pi-fff/src/index.ts:1173 \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":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b618dfd583405959bb1561b18468887993c86b4b23455f03167632f7727484"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): packages/fff-bun/src/ffi.ts:427 \u00B7 packages/fff-bun/src/ffi.ts:658 \u00B7 packages/fff-bun/src/ffi.ts:854 \u00B7 packages/fff-bun/src/ffi.ts:1020 \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":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d5a97ae1edaa4a8e85feeeb239c8072d925957ee74bf9e1f78cdb4b1e9e9fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/fff-node/src/ffi.ts:273 \u00B7 packages/fff-node/src/ffi.ts:286 \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":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8c9517cc69615ee7affa49a0fb56b970edd011bbeb67048b4b58086881ec05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): packages/pi-fff/src/index.ts:1129 \u00B7 packages/pi-fff/src/index.ts:1273 \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":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ec12027798e89fb8a885ec83f5ad54882d7142810b7aab1ae1115dd15a1908"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): packages/fff-node/src/ffi.ts:696 \u00B7 packages/fff-node/src/ffi.ts:747 \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":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4bded7e4a30ee30e509d609271381eeb2beb6ef522169cd884f182b252a957"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): packages/fff-node/src/ffi.ts:894 \u00B7 packages/fff-node/src/ffi.ts:985 \u00B7 packages/fff-node/src/ffi.ts:1064 \u00B7 packages/fff-node/src/ffi.ts:1160 \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":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"773b76290e82577781bb94ed488b464392d12bfe395eab29cc3c86ba729128ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/fff-bun/src/ffi.ts:497 \u00B7 packages/fff-node/src/ffi.ts:326 \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":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b28f58d4c3720f0bc60367d3232f4ae8c51ddc65d9fb39a499b018fa580744"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): packages/pi-fff/src/index.ts:1146 \u00B7 packages/pi-fff/src/index.ts:1287 \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":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4227a1d533a304e8d9a5b613c22fe39d9b451044c07c18ec159f2f9f125a43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/fff-bun/src/ffi.ts:391 \u00B7 packages/fff-node/src/ffi.ts:150 \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":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84c2d58d6047e5adf57cc7c20280c6263792c641e4ed7f5812332754f3a7e87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): packages/fff-bun/src/ffi.ts:679 \u00B7 packages/fff-bun/src/ffi.ts:889 \u00B7 packages/fff-bun/src/ffi.ts:1065 \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":679}}}],"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:303 \u00B7 packages/fff-node/src/ffi.ts:319 \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":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b64a23db97510f82ed1f2507e1d3f469a88781b331f5f9c690345ec65a6723"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execute (cyclomatic 25, cognitive 25): execute has cyclomatic complexity 25 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 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":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d123ccf6fd5a798688d7e7bad96e47aef64fcff27814da119e7d63620f22724"}},{"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":1198}}}],"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 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 create (cyclomatic 18, cognitive 16): create has cyclomatic complexity 18 and cognitive complexity 16; 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":"f4fcd84c2cc7bda3e67c166fb880f01f8c809feb0306a1d626713b0578b13058"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create (cyclomatic 17, cognitive 15): create has cyclomatic complexity 17 and cognitive complexity 15; 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":"74c1eb6e255ebbeddc5c70930b83a69b1bd481d6bd0ac0d4effac5ded25b128c"}},{"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":408}}}],"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":414}}}],"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":905}}}],"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":362}}}],"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":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7ac0ba39a7f6a22420b186965ec594e3a545501f4382a6760ec2de1197ed5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ffiCreate (cyclomatic 12, cognitive 13): ffiCreate has cyclomatic complexity 12 and cognitive complexity 13; 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":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"f369a90fd0d2ddff8e9d8ea0f4d017e037d8e1a4e81656b8faa4c2859da545dd"}},{"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":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"369ee83773d7f27d31875e37ef458a36c432c130e997027af9957e03bf1565de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ffiCreate (cyclomatic 11, cognitive 12): ffiCreate has cyclomatic complexity 11 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/fff-node/src/ffi.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fc81ce85a0ad9da20dc90757d6f5a378f7ca26a442c19255a5daa3ee16ea76"}},{"ruleId":"R3","level":"warning","message":{"text":"Large Files: 6 file(s) over 400 lines (counted as significant lines \u2014 blank lines excluded \u2014 over production source only, tests excluded), largest first: packages/fff-node/src/ffi.ts (1721), packages/fff-bun/src/ffi.ts (1425), packages/pi-fff/src/index.ts (1323), packages/fff-bun/src/finder.ts (691), packages/fff-node/src/finder.ts (670), packages/shared/fff-api.ts (612)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cecee31b569df4f07e06db732f1ca037af27b5afef9023da51f9673d931a142f"}},{"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":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/set-npm-version.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24133bed8067fba0a47e86b9c2e3c32d4068c4797aed4c83f15802a2ec315557"}},{"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":1754}}}],"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-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":111,"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."]}]}