{"$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":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"]}},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"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":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"turbovec::search::search (cyclomatic 88): turbovec::search::search has cyclomatic complexity 88 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (turbovec::search::search::scan_range_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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: turbovec/src/search.rs holds 7 of the 21 functions over the threshold \u2014 including the worst \u2014 and 121 of the 224 points over it (54%), 3.4\u00D7 the next-largest file (turbovec/src/io_v7.rs at 36). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":3206}}}],"partialFingerprints":{"codehealthFindingId/v1":"19552733f37b2900c2b778de06b6bf7a6590e9fb4943ba059d32706f75554b69"}},{"ruleId":"D1","level":"warning","message":{"text":"turbovec::io_v7::load_image (cyclomatic 46): turbovec::io_v7::load_image has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/io_v7.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"981569bab754a1079151f277989bcb9b02e3f1da69170acee82ecdfe9233b911"}},{"ruleId":"D1","level":"warning","message":{"text":"turbovec::search::avx2_post_flush_heap_update (cyclomatic 31): turbovec::search::avx2_post_flush_heap_update has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: turbovec/src/search.rs holds 7 of the 21 functions over the threshold \u2014 including the worst \u2014 and 121 of the 224 points over it (54%), 3.4\u00D7 the next-largest file (turbovec/src/io_v7.rs at 36). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fc3ab206628bd7c3b5843f713ca86ef94bdf860754138663dfe29e9940697d"}},{"ruleId":"D1","level":"warning","message":{"text":"TurboQuantVectorDb.insert (cyclomatic 28): TurboQuantVectorDb.insert has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/agno.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab11ffc0b4fae40e55cd3808e1c51c86f62375e5f889d2d4f2a95ac5ba35755e"}},{"ruleId":"D1","level":"warning","message":{"text":"TurboQuantVectorStore.query (cyclomatic 28): TurboQuantVectorStore.query has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/llama_index.py"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4ff627a2964f03e2516c2341ffb8cc21b09aded1774ac2ac5c448c141e26fa"}},{"ruleId":"D1","level":"warning","message":{"text":"turbovec::search::search_multi_query_avx2 (cyclomatic 27): turbovec::search::search_multi_query_avx2 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: turbovec/src/search.rs holds 7 of the 21 functions over the threshold \u2014 including the worst \u2014 and 121 of the 224 points over it (54%), 3.4\u00D7 the next-largest file (turbovec/src/io_v7.rs at 36). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3cd70f60154f6eaa50a223b18a97c6ad0c2aea4aa060f5f8c138b46e0af3a2"}},{"ruleId":"D1","level":"warning","message":{"text":"changelog_gate.strip_literals (cyclomatic 23): changelog_gate.strip_literals 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":".github/scripts/changelog_gate.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f94b3cdc3745363622cfccd55d81ec9c33a53241fe2da946a930f83ee5738a"}},{"ruleId":"D1","level":"warning","message":{"text":"turbovec::search::search::scan_range_neon (cyclomatic 22): turbovec::search::search::scan_range_neon has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (turbovec::search::search) 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: turbovec/src/search.rs holds 7 of the 21 functions over the threshold \u2014 including the worst \u2014 and 121 of the 224 points over it (54%), 3.4\u00D7 the next-largest file (turbovec/src/io_v7.rs at 36). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":3289}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e21194dd582f467dcb6c1c2337588ba25072e1ebc58250757e58e510ac1e31"}},{"ruleId":"D1","level":"warning","message":{"text":"TurboQuantVectorStore._single_filter_match (cyclomatic 22): TurboQuantVectorStore._single_filter_match has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/llama_index.py"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8d6befcfca112bcbaf7fa6b30a24967e79fc33c71df1514f67baee08c7dd54"}},{"ruleId":"D1","level":"warning","message":{"text":"TurboQuantIndex::from_parts (cyclomatic 21): TurboQuantIndex::from_parts has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/lib.rs"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"e240af12826b8e7948d35f81050de009a4e907bf5b7bf55190e9530c338f2c3e"}},{"ruleId":"D1","level":"warning","message":{"text":"turbovec::search::search_multi_query_avx512bw (cyclomatic 21): turbovec::search::search_multi_query_avx512bw has cyclomatic complexity 21 (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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: turbovec/src/search.rs holds 7 of the 21 functions over the threshold \u2014 including the worst \u2014 and 121 of the 224 points over it (54%), 3.4\u00D7 the next-largest file (turbovec/src/io_v7.rs at 36). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58d8d834108019e253aa356626dd01f676bc59f8ed6bf41393ac7e314f8d26f"}},{"ruleId":"D1","level":"warning","message":{"text":"TurboQuantVectorStore._search_vector (cyclomatic 21): TurboQuantVectorStore._search_vector 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":"turbovec-python/python/turbovec/langchain.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d9045762012e6297c96078ec5f9cf901dda0c6e75f5dd5532133b8b4822bd1"}},{"ruleId":"D1","level":"warning","message":{"text":"turbovec::io_v7::cursor_state (cyclomatic 20): turbovec::io_v7::cursor_state has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/io_v7.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"1110f8f411945d9fa111e2f4a18c25802aa18f759d631a9b4d61d0d6d0192ab6"}},{"ruleId":"D1","level":"warning","message":{"text":"turbovec::search::build_query_neon_lut_from_slice (cyclomatic 20): turbovec::search::build_query_neon_lut_from_slice has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: turbovec/src/search.rs holds 7 of the 21 functions over the threshold \u2014 including the worst \u2014 and 121 of the 224 points over it (54%), 3.4\u00D7 the next-largest file (turbovec/src/io_v7.rs at 36). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":2856}}}],"partialFingerprints":{"codehealthFindingId/v1":"006894cc2f7c9c7f3756ab22250be3eaca2cf025f818af76ffc3de349dca4a91"}},{"ruleId":"D1","level":"warning","message":{"text":"TurboQuantDocumentStore.embedding_retrieval (cyclomatic 20): TurboQuantDocumentStore.embedding_retrieval has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/haystack.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ef9e97cfc4df2d8be1b717e26ec070c02c0e81a24227875433497bbaabe5b8"}},{"ruleId":"D1","level":"warning","message":{"text":"TurboQuantIndex::calibrate_2d (cyclomatic 18): TurboQuantIndex::calibrate_2d has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/lib.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"47590697d47a19d1cf27fbef9088cc312ab9af6cc259f950998a9c88aa7e0ddd"}},{"ruleId":"D1","level":"warning","message":{"text":"TurboQuantVectorStore.add (cyclomatic 18): TurboQuantVectorStore.add 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":"turbovec-python/python/turbovec/llama_index.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c36ca36f088855bf51532ed6c947ae0c79a949bcea735225a757ddbc5301af4"}},{"ruleId":"D1","level":"warning","message":{"text":"turbovec::search::score_block_permute_dot_neon (cyclomatic 17): turbovec::search::score_block_permute_dot_neon 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: turbovec/src/search.rs holds 7 of the 21 functions over the threshold \u2014 including the worst \u2014 and 121 of the 224 points over it (54%), 3.4\u00D7 the next-largest file (turbovec/src/io_v7.rs at 36). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eaede9648a74514833947c483e26fb92751249eed65f70b590fb4c8bfb8b557"}},{"ruleId":"D1","level":"warning","message":{"text":"TurboQuantIndex::swap_remove (cyclomatic 16): TurboQuantIndex::swap_remove 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":"turbovec/src/lib.rs"},"region":{"startLine":2864}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cac8bc744f087a39c93761e348fe8441f7aded378ce0c0be1329276cab4068a"}},{"ruleId":"D1","level":"warning","message":{"text":"turbovec::io::sweep_stale_tmps (cyclomatic 16): turbovec::io::sweep_stale_tmps 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":"turbovec/src/io.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b810fbc489448e96d4d0fcaa8f09db21d580d9f067266da5d02d26681324d4d2"}},{"ruleId":"D1","level":"warning","message":{"text":"TurboQuantVectorStore._store_texts_and_vectors (cyclomatic 16): TurboQuantVectorStore._store_texts_and_vectors 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":"turbovec-python/python/turbovec/langchain.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cccf09868ef6358799e109c4bd40d514f64f75f27584757f04e70349545788b"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::search (cognitive 228): turbovec::search::search has cognitive complexity 228 (threshold 15). Drivers by points: if/else 101 (198 pts), loops 24 (72 pts), boolean chains 20, match/switch 1 (nesting depth added 145). To reduce it, split the body into named stages: move each independent 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 (turbovec::search::search::scan_range_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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":3206}}}],"partialFingerprints":{"codehealthFindingId/v1":"132572ca3f8e410d00b45b04bcd6ba39aa16ef3c3278b80bb921e0d85a103483"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::search_multi_query_avx2 (cognitive 106): turbovec::search::search_multi_query_avx2 has cognitive complexity 106 (threshold 15). Drivers by points: if/else 15 (62 pts), loops 13 (44 pts) (nesting depth added 78). To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"633d01533a9d849ecc03f8fd5d0fa841e6cfc3063863bbb4f6a9d44f85e4cb70"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::avx2_post_flush_heap_update (cognitive 77): turbovec::search::avx2_post_flush_heap_update has cognitive complexity 77 (threshold 15). Drivers by points: if/else 24 (60 pts), loops 7 (16 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"0953acd3687a38e43ac6c72c9cd2711e21094d3ee7db4bf53268a0cd9b3dacba"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::io_v7::load_image (cognitive 68): turbovec::io_v7::load_image has cognitive complexity 68 (threshold 15). Drivers by points: if/else 24 (36 pts), loops 13 (22 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/io_v7.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fd6cfad2ebca6577f755d632b0ce7a91b09ca7fe82124b607e59034a5f7826"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantVectorStore.query (cognitive 59): TurboQuantVectorStore.query has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 3 (6 pts), ternaries 2 (6 pts), boolean chains 5, error handling 1 (3 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/llama_index.py"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee43358e39ef380a27c38a1cc13f09757bdb448ca2ed33b6e72ced03adacd42"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::search_multi_query_avx512bw (cognitive 54): turbovec::search::search_multi_query_avx512bw has cognitive complexity 54 (threshold 15). Drivers by points: loops 14 (39 pts), if/else 7 (15 pts) (nesting depth added 33). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d3a41a1b7e4c11b1df0d3fb326042842f2c45dce4b8368e43cafcbc60f5597"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::search::scan_range_neon (cognitive 54): turbovec::search::search::scan_range_neon has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (36 pts), loops 4 (12 pts), boolean chains 6 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (turbovec::search::search) 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":3289}}}],"partialFingerprints":{"codehealthFindingId/v1":"f187b375fc56e614eec10b474b36dcb7ea2674b30eecebcb26b882c1e6f4b0e0"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::score_block_permute_dot_neon (cognitive 50): turbovec::search::score_block_permute_dot_neon has cognitive complexity 50 (threshold 15). Drivers by points: loops 12 (34 pts), if/else 7 (16 pts) (nesting depth added 31). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac418e2012af193e60cc225ffc51a16072eb75594b76f63338db507a99083363"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantVectorStore._search_vector (cognitive 50): TurboQuantVectorStore._search_vector has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (37 pts), loops 4 (9 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/langchain.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b1cc84eb7367c8180891f8bd9454157351ed5c58e5433cf3c66b81a4abeaaa"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantVectorDb.insert (cognitive 45): TurboQuantVectorDb.insert has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 6 (10 pts), ternaries 3 (7 pts), boolean chains 2, error handling 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/agno.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba38dd589be92b1c4e0f6e11bc9530356fd1df88b3dfaa60809766adfc800d74"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::score_block_permute_smmla_neon (cognitive 43): turbovec::search::score_block_permute_smmla_neon has cognitive complexity 43 (threshold 15). Drivers by points: loops 11 (29 pts), if/else 6 (14 pts) (nesting depth added 26). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"4490b225a520a03c8b08793fee6a67bcaf610c842923225eaf2ff00a9072ccef"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::score_block_smmla_vm8 (cognitive 41): turbovec::search::score_block_smmla_vm8 has cognitive complexity 41 (threshold 15). Drivers by points: loops 10 (25 pts), if/else 7 (16 pts) (nesting depth added 24). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":2273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fd88a7e8202111a5956d333866a30295fc3f58cf579f747794e6d969954990"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::build_query_neon_lut_from_slice (cognitive 40): turbovec::search::build_query_neon_lut_from_slice has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 7 (14 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":2856}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d41740095b0c7c55ba07b82ec1878f118e4f214868dd64df2f830bac40f1b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantDocumentStore.embedding_retrieval (cognitive 39): TurboQuantDocumentStore.embedding_retrieval has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 3 (6 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/haystack.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"7740e83bcc4a50b029f8a720d4c138c7b8b84d5785d8624cbfc49d498ee38c02"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::search_multi_query_permute_dot (cognitive 38): turbovec::search::search_multi_query_permute_dot has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (25 pts), if/else 4 (13 pts) (nesting depth added 25). 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. This shape REPEATS in the file: one other method here (turbovec::search::search_multi_query_permute_dot_gfni) 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec1b75d0be747416dfceb1d3939d2e02fb5f650c8ad9eb6f0cfc0037e614a11"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::search_multi_query_permute_dot_gfni (cognitive 38): turbovec::search::search_multi_query_permute_dot_gfni has cognitive complexity 38 (threshold 15). Drivers by points: loops 9 (25 pts), if/else 4 (13 pts) (nesting depth added 25). 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. This shape REPEATS in the file: one other method here (turbovec::search::search_multi_query_permute_dot) 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd65531b712c83d8bf2f3388f8d7d189f933eae26956a74ad6d37c843efe259"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::score_4query_block_neon (cognitive 34): turbovec::search::score_4query_block_neon has cognitive complexity 34 (threshold 15). Drivers by points: loops 9 (24 pts), if/else 6 (10 pts) (nesting depth added 19). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"79804a56e756b0570be8453a68b567af11161141a882e9a0ea397d61a682d279"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog_gate.strip_literals (cognitive 33): changelog_gate.strip_literals has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (24 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/changelog_gate.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffc787bd9356a5ca0c26f78f2b6d557975e33ed22b6f9133d006069158313a2"}},{"ruleId":"D2","level":"warning","message":{"text":"_persist._check_json_faithful (cognitive 28): _persist._check_json_faithful has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (7 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/_persist.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67041eb6b5e739268a5a731dc92c01426b760af593792094e5b195a26e3db6b"}},{"ruleId":"D2","level":"warning","message":{"text":"IdMapIndex::add_with_ids_2d (cognitive 26): IdMapIndex::add_with_ids_2d has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/id_map.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f952a614bba67d0ab187874ba5bb47b709edf15d1423dd37cc2e89e35bbce74"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::avx512_post_flush_heap_update (cognitive 26): turbovec::search::avx512_post_flush_heap_update has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (5 pts), boolean chains 1 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"287a6b954573b5614fbab01f24aebcf8a1d96f0e9409e324b11007b3545deb5d"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::score_query_into_heap (cognitive 26): turbovec::search::score_query_into_heap has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":3077}}}],"partialFingerprints":{"codehealthFindingId/v1":"122602f86932ae2975a4bf403a4721b66e9b4be6861f5155cb167abfd95e8b3c"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::search_single_query_vnni_blk2 (cognitive 25): turbovec::search::search_single_query_vnni_blk2 has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 14). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"437707c97fa86ef190547ace8958cdadad5cf000f0a122303c164a1fba79ad61"}},{"ruleId":"D2","level":"warning","message":{"text":"IdMapIndex::search (cognitive 25): IdMapIndex::search has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 3 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/src/lib.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30a34100ff591ffe73814a8326a80c23b2ef6eae1e06d277718045efef10eca"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantDocumentStore._write_documents_locked (cognitive 25): TurboQuantDocumentStore._write_documents_locked has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts), boolean chains 2 (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":"turbovec-python/python/turbovec/haystack.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"25297b733f153f106113a10f03a5de2ee3eb17d950147da0f70a8510a474107e"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantIndex::from_parts (cognitive 24): TurboQuantIndex::from_parts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/lib.rs"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee8ef084e1815cd44b680732d9fb96295d5217aeae510e460cf8bb1ad0bde0c"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantVectorDb._embed_missing (cognitive 24): TurboQuantVectorDb._embed_missing has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 2 (4 pts), ternaries 1 (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":"turbovec-python/python/turbovec/agno.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cc0b0acbe1317f4ef6d1907fbcc2d5a1912d71e75972bcfa5e5e4ddbdee74a"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::search_multi_query_vnni (cognitive 23): turbovec::search::search_multi_query_vnni has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (11 pts) (nesting depth added 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c686c6ef7666fa9c173e19ca89cccfbe1056398e299cae2ffda2396bc82a473"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantVectorStore._single_filter_match (cognitive 23): TurboQuantVectorStore._single_filter_match has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/llama_index.py"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a36a333dba07ed08b9c5c9c79b787ed9294abe8df6d058cfbeef672158e4c8"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantIndex::swap_remove (cognitive 22): TurboQuantIndex::swap_remove has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/lib.rs"},"region":{"startLine":2864}}}],"partialFingerprints":{"codehealthFindingId/v1":"4626b36d96efd04eb282ab93a6bef1d4071979e68129dab0abb5aa123112d465"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::io::sweep_stale_tmps (cognitive 22): turbovec::io::sweep_stale_tmps has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/io.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b8f32f4f1a1c4bcbbf79d5127ec0d6eb8e4607d772de3891ebea1b616d82fe"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::io_v7::cursor_state (cognitive 22): turbovec::io_v7::cursor_state has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3, boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/io_v7.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4f2f616ecb529364fe230cfdc93ba861db53ae398a91133bb5e9ea05733d3c"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::score_4bit_block_neon (cognitive 22): turbovec::search::score_4bit_block_neon has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 4 (6 pts) (nesting depth added 10). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a7c883c2685d8590f6744124a11877efdaeff0ea163ab8fd1d06537ec49fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantVectorDb._embed_missing_async (cognitive 22): TurboQuantVectorDb._embed_missing_async has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, ternaries 1 (4 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/agno.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"92716e8af2a205e5aae5743d1fe693a1ba8c6e08cf20e3293b093aa263318ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantVectorStore.add (cognitive 22): TurboQuantVectorStore.add has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 4 (6 pts), boolean chains 2, error handling 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/llama_index.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"264928f433d5f93cdabb62f48f26f132b1c9b3dba0b025ee75c1723c1ae8763f"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantIndex::encode_and_append (cognitive 21): TurboQuantIndex::encode_and_append has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/lib.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7bcb2143ff7e6f45eeceb665e1719edfc53bfa52bd6d2f8c916bfcd17bd4d8"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::rotation::wht_block_avx512 (cognitive 21): turbovec::rotation::wht_block_avx512 has cognitive complexity 21 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 3 (nesting depth added 9). 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":"turbovec/src/rotation.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"6987c11f79f85b78496e6eb1de607e03b3527cdd802e069660ef19cb1a7ef322"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog_gate.cfg_test_regions (cognitive 21): changelog_gate.cfg_test_regions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/changelog_gate.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb3d91b08a43329da0573db93cfe863ea8e0a821d71d2964ba48f0de8680d85"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::rotation::wht_block (cognitive 20): turbovec::rotation::wht_block has cognitive complexity 20 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 2 (nesting depth added 9). 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. This shape REPEATS in the file: one other method here (turbovec::rotation::wht_block_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":"turbovec/src/rotation.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec3ae7cac30d150ba545b31f7e7e2e8bf87c0215af760b49cbb7fee8403d68b"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::rotation::wht_block_avx2 (cognitive 20): turbovec::rotation::wht_block_avx2 has cognitive complexity 20 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 2 (nesting depth added 9). 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. This shape REPEATS in the file: one other method here (turbovec::rotation::wht_block) 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":"turbovec/src/rotation.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63d0d4cb5f68ac5cf24e487117e379bdff46d0d1ee3a4aad207494245c3f87f"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::encode::fused_quantize_scale_pack (cognitive 20): turbovec::encode::fused_quantize_scale_pack has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 2 (3 pts), match/switch 1 (2 pts) (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":"turbovec/src/encode.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b7fb39c9d01478963e940aca429aa1fe70bcfc0d721befed670aadf0bf205a"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::encode::fused_quantize_scale_pack_avx2 (cognitive 20): turbovec::encode::fused_quantize_scale_pack_avx2 has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 6 (8 pts) (nesting depth added 8). 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":"turbovec/src/encode.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf364d5cfba1d717b18d77720dbea2a8ee7ae730727f16d6d9a3e06afdb54805"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::score_block_vm8_single (cognitive 20): turbovec::search::score_block_vm8_single has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 4 (6 pts) (nesting depth added 9). 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"605861f24ac4727955d8eadb648cb5d8102e0d8ab51fe25a3f0f1afc9439a984"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantVectorStore._store_texts_and_vectors (cognitive 20): TurboQuantVectorStore._store_texts_and_vectors has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 5 (7 pts), boolean chains 1, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/langchain.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"753f28cb87e0eb227becf74b6421f171688c18ad5d3d4d536cd27018faa66edd"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantIndex::calibrate_2d (cognitive 19): TurboQuantIndex::calibrate_2d has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/lib.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fab21a9271851ec9873c992885011253af47595603bd3735bbf6c29e97e514"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::encode::fused_quantize_scale_pack_scalar (cognitive 18): turbovec::encode::fused_quantize_scale_pack_scalar has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 1 (4 pts), match/switch 1 (3 pts) (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":"turbovec/src/encode.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cb6f651f7e8c9165e3eb01f60e8a8127d27f53b8af7bfd2a848d676aaae19e"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantDocumentStore._commit_batch (cognitive 18): TurboQuantDocumentStore._commit_batch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 4 (6 pts), boolean chains 2, error handling 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/haystack.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf593085d6a87ab64d1f0c21af16d41d23f0bb59fac4ee9b2636831273157152"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::search::neon_block_topk_update (cognitive 17): turbovec::search::neon_block_topk_update has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: turbovec/src/search.rs holds 19 of the 53 functions over the threshold \u2014 including the worst \u2014 and 677 of the 1045 points over it (65%), 11.3\u00D7 the next-largest file (turbovec/src/io_v7.rs at 60). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9b5e9c4b501973f3d73150c36386106b3f28fba5baca000c5c42926b8830b9"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog_gate.substantive (cognitive 17): changelog_gate.substantive has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/changelog_gate.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aec5dba2970791f5bef11f3442624654c89f45310d19bd2f56d6387dd9df1a7"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::convert::read_legacy (cognitive 16): turbovec::convert::read_legacy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 2, loops 1 (2 pts), match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/convert.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b1a9a97f36cfe18e4f1487f9648bb38936fb4fac50c20c9554cd70599c6a30"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::convert::write_legacy (cognitive 16): turbovec::convert::write_legacy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 4 (6 pts), 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":"turbovec/src/convert.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afb7c622766c26501b73b12d56da646e876847e83e1362a8d1fccd1079827b9"}},{"ruleId":"D2","level":"warning","message":{"text":"turbovec::pack::pack_blocked (cognitive 16): turbovec::pack::pack_blocked has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 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":"turbovec/src/pack.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e774720a2e792915fa0c1cab026e5f07b2be2a35ce839a639ac30dfeda09126"}},{"ruleId":"D2","level":"warning","message":{"text":"TurboQuantVectorDb._unlink_payload (cognitive 16): TurboQuantVectorDb._unlink_payload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/agno.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb8f822cf062c191d29b76f307074a63a2e665504dd6428f42204796ac51e12"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turbovec::search::search: FunctionTooLong \u2014 turbovec::search::search runs 687 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 587 over it, 6.87\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":"turbovec/src/search.rs"},"region":{"startLine":3206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acbc69a5691900b16625fc6f379fbd0f0ce397369d0c60b32e7443c7e6a297b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/search.rs: FileTooLong \u2014 2370 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 43 free functions. The bar is 500 significant lines; this is 1870 over it, 4.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f1b0f3d6d3d1ec0854008f218477180d0c98781ce62f16c9e5d1ad2321055c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TurboQuantIndex: ClassTooLong \u2014 979 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), 52 methods, 2 blocks, lines 295-3067. The bar is 400 significant lines; this is 579 over it, 2.45\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":"turbovec/src/lib.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"823402c912883d013bc95689f5b11e8d9b4a2f3056e2250ce419064a95d41109"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1055 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 93% of them inside a single declaration: TurboQuantIndex (2 blocks, 295-3067). The bar is 500 significant lines; this is 555 over it, 2.11\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":"turbovec/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64e9df0c427ac002cd3322c91efc483200a573a0ac6900d8cc107ae1ca30659"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turbovec::search::search_multi_query_avx512bw: FunctionTooLong \u2014 turbovec::search::search_multi_query_avx512bw runs 193 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 93 over it, 1.93\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":"turbovec/src/search.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"60de1ba3adca4693a192e9b6f4f657e809964afc39edf3cbc091887ac0b7e6c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turbovec::io_v7::load_image: FunctionTooLong \u2014 turbovec::io_v7::load_image runs 177 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 77 over it, 1.77\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":"turbovec/src/io_v7.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2d4436a0aae48c93fd33f7a2a01a492f542e7e74697721f066e39aed0832c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/io_v7.rs: FileTooLong \u2014 882 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 382 over it, 1.76\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":"turbovec/src/io_v7.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85597b27e3a53ebcf7696e36e43000d7ee81c90501bfa98282b264833ec8065b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TurboQuantIndex: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/lib.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"990983bb6a38af651b86944f051ef004ab4f1e22883ed9d0565775de9e20bb0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 849 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 49 free functions. The bar is 500 significant lines; this is 349 over it, 1.70\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":"turbovec-python/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d46208c80037c5b900a0cd27c412cb617cb13924da92562d9bfed46210fd37"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TurboQuantVectorDb: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\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":"turbovec-python/python/turbovec/agno.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f237d45116ea49f8368b13d8023b0a0809fe015272e6a82ab445d2c495ca82"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TurboQuantDocumentStore: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\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":"turbovec-python/python/turbovec/haystack.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6614850ff55ddc8ce2de095cb76b1c2936f6cd39a8eb4bb8506ead084031b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turbovec/agno.py: FileTooLong \u2014 708 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 208 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/agno.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e2d918c3809eb4f0c87ed997f82c1c302067320b0761b6d2c1e4009edcfe7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turbovec::search::search_multi_query_avx2: FunctionTooLong \u2014 turbovec::search::search_multi_query_avx2 runs 141 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 41 over it, 1.41\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":"turbovec/src/search.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4584c0da17e20f050b1b90e1b0db5bcc1789741b3d9a2e74d8b36335629f79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/encode.rs: FileTooLong \u2014 644 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 144 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/encode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a56be8a55296f80d6ac21bc749317f3386df6ea2520346fb1c452c9eee643e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TurboQuantVectorStore: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/langchain.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ed14819971472cc106581ef51b346ec0eab992f4338a6f9c4e835da8dc2abc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IdMapIndex: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/id_map.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"556f02d0b0d473f0446c5c378d7bed3a065fbc039cfc99bd0f672ebb4294b111"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turbovec/llama_index.py: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 98 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/llama_index.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb050a4a8440ff69334aaa3115b0b4c32bfd8665c129e14905b520ad0215c78b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TurboQuantIndex.encode_and_append: MethodTooLong \u2014 encode_and_append runs 118 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 18 over it, 1.18\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":"turbovec/src/lib.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4648a6c471c18974194326bdeabeda7a4d660b869820e3a3e6a326d4beed31c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turbovec/haystack.py: FileTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 82 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/haystack.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"658b8b8e936991fa1d9b4fef59a458a7e6ab6149e37961d8d342996d210e2720"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turbovec/langchain.py: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 73 over it, 1.15\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":"turbovec-python/python/turbovec/langchain.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4a5b1d85e12252a2c4d18d85b0cb6081bf0764db0f60b1a504196ae0ffb647"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turbovec::rotation::wht_block_avx512: FunctionTooLong \u2014 turbovec::rotation::wht_block_avx512 runs 114 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 14 over it, 1.14\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":"turbovec/src/rotation.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba680c09b945477171af1304d83a7ccbca5759a86256115a32a47c075d791679"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rotation.rs: FileTooLong \u2014 540 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 40 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/rotation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ab956cfa2de9a5f7a0aeda1889c3e06cd2f773887e040bfa85d6b3e97b29db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pack.rs: FileTooLong \u2014 536 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 40 free functions. The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/pack.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8013761f0bbf256616d72a06d667e671909bbed38b9a99f5544bd8f7e3492a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turbovec::search::avx2_post_flush_heap_update: FunctionTooLong \u2014 turbovec::search::avx2_post_flush_heap_update runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/search.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28b033712cc0a87d937d50e946c3c2165bdc68eb1ae15f6abac22343a37454e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TurboQuantVectorStore: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/llama_index.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8397030ce14664573c9683b8fa97c0fc131ff7e6c0138c872ecfee5f44f2326"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turbovec::rotation::wht_block_avx2: FunctionTooLong \u2014 turbovec::rotation::wht_block_avx2 runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec/src/rotation.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"953fb300578248923ad950bf42391a7f7d907ba5846656cb68faefa04a89b4cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): turbovec/src/search.rs:483-670 | turbovec/src/search.rs:1621-1744 | turbovec/src/search.rs:2662-2701 | turbovec/src/search.rs:3097-3147 \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":"turbovec/src/search.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26ab20c5839c028d1423eb16e346cbbdd7e0f162fa9bedeaeb2c32316902948"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): turbovec/src/search.rs:2192-2256 | turbovec/src/search.rs:2283-2382 | turbovec/src/search.rs:2417-2500 | turbovec/src/search.rs:2531-2639 \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":"turbovec/src/search.rs"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab4c01eca331a22cfd8da9f1ec3d690060b9ffb34967f2a25d00f5fa11e0de5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): turbovec-python/src/lib.rs:808-821 | turbovec-python/src/lib.rs:975-991 | turbovec-python/src/lib.rs:1397-1410 | turbovec-python/src/lib.rs:1446-1460 \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":"turbovec-python/src/lib.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"15298bdf59dae24be4dcf182819d20054beb9c1e527d30f1c2adc0e471ac88cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): turbovec-python/src/lib.rs:697-728 | turbovec-python/src/lib.rs:1331-1362 \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":"turbovec-python/src/lib.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc1a00779eea12b5574503764b0903e1b1e3d80c012f30dc97bd28ce77283eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201327 lines \u00D7 2): turbovec/src/search.rs:517-543 | turbovec/src/search.rs:927-947 \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":"turbovec/src/search.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b54665ffa7413ec7c82071ea9b4fefb1dd9ab499c29a0f77464a1a9cad08f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201327 lines \u00D7 2): turbovec/src/search.rs:2284-2310 | turbovec/src/search.rs:2418-2440 \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":"turbovec/src/search.rs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aedc54dcfc14b6d94b2fba4eaa44727d385c6fd358ed61b05f55626a5a4c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201325 lines \u00D7 2): turbovec/src/search.rs:1659-1678 | turbovec/src/search.rs:1816-1840 \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":"turbovec/src/search.rs"},"region":{"startLine":1659}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bb2615eba934e462b2b029da597d4a375c0f2ebc97d704a42a43c5558c5008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): turbovec/src/search.rs:3773-3794 | turbovec/src/search.rs:4270-4290 \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":"turbovec/src/search.rs"},"region":{"startLine":3773}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0ee16cb2c6871bf5438b5212c82963b00d3a45ef894c556ea7c200dba58d3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): turbovec/src/search.rs:2362-2382 | turbovec/src/search.rs:2480-2500 | turbovec/src/search.rs:2619-2639 \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":"turbovec/src/search.rs"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da47337f9361cbfd2f170e706d7a05d272759e2a7ce55f4386111a6d3e31e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): turbovec/src/rotation.rs:409-427 | turbovec/src/rotation.rs:466-482 \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":"turbovec/src/rotation.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"7954900f8326a1be53346beeb65a0a405e47f0b7adc51eb3440a91e8f37c1ef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): turbovec/src/search.rs:3446-3464 | turbovec/src/search.rs:3824-3838 \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":"turbovec/src/search.rs"},"region":{"startLine":3446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60eeefebdea8a19f77de4098cf5879d6c3f9b3eff56b3fd03b6acef967cb0b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 4): turbovec/src/search.rs:654-666 | turbovec/src/search.rs:1664-1676 | turbovec/src/search.rs:1730-1742 | turbovec/src/search.rs:1821-1838 \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":"turbovec/src/search.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c3b84e27bbdd88a36703a04c1ae5065c51c5ac0912da0dc5559a59ac85e4c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): turbovec/src/search.rs:626-642 | turbovec/src/search.rs:1702-1718 | turbovec/src/search.rs:2684-2701 \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":"turbovec/src/search.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"750d48a888867cb950dbdea49448916fa0b76354d11ad67fe75db66995072a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): turbovec-python/src/lib.rs:567-584 | turbovec-python/src/lib.rs:1300-1317 \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":"turbovec-python/src/lib.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6540fc64d4b12510c12cd4e91ee9b71142471519ea18f945f84b4ddcb40e2dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): turbovec/src/search.rs:3487-3500 | turbovec/src/search.rs:3904-3918 \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":"turbovec/src/search.rs"},"region":{"startLine":3487}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ae76de52d1ec243d1c379b5c9f60f9509a642b037588f96aad804d43a298f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): turbovec/src/lib.rs:1779-1790 | turbovec/src/lib.rs:1881-1892 \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":"turbovec/src/lib.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9da9d328b6c89f7db0c579ecfb27f7fe9b03894e3bf3f515b18d9760e76269c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): turbovec/src/search.rs:504-515 | turbovec/src/search.rs:724-735 \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":"turbovec/src/search.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"248b55b23e5440bae1b66f85dfb0e3ea552ce9f7149fe6466c89b5f66c3b08eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): turbovec/src/search.rs:563-574 | turbovec/src/search.rs:1582-1593 \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":"turbovec/src/search.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e8f8493a33d735c710dc22aab6742b9206eceab7ac8afd40481db77ed99e16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): turbovec-python/src/lib.rs:611-621 | turbovec-python/src/lib.rs:1140-1151 \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":"turbovec-python/src/lib.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b270ebe1438e45d8f99535aa9d8ff485e7af65b854a2b8e2797f5edf7e4d02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): turbovec/src/lib.rs:1009-1018 | turbovec/src/lib.rs:1050-1060 \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":"turbovec/src/lib.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd87e410bb7cb6029fc2591987306a52d69c8626b381b2b20b0e2f3fa2240fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): turbovec/src/rotation.rs:698-710 | turbovec/src/rotation.rs:859-869 \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":"turbovec/src/rotation.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d18aa676828dd9e68a25bab7a4c00889b28fb946984dead4acfaeb81fe19c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): turbovec-python/src/lib.rs:485-495 | turbovec-python/src/lib.rs:1017-1026 \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":"turbovec-python/src/lib.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a952053e5bf25740d9cb5f56a5673e4a4ed6cd02f99a18c09bd117faf1afd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): turbovec-python/src/lib.rs:788-798 | turbovec-python/src/lib.rs:1426-1436 \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":"turbovec-python/src/lib.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df28bdf037b64b02753d6e5fff6039d1f4e358324ae111ec2fd7255a3b1bb58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): turbovec/src/lib.rs:653-662 | turbovec/src/lib.rs:687-696 \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":"turbovec/src/lib.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"c184667ca94e8dd7379d385abbeab910420058e56f883e048567d607a3ee8929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): turbovec-python/src/lib.rs:749-757 | turbovec-python/src/lib.rs:1383-1391 \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":"turbovec-python/src/lib.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0cdab143044f43c14d9b13c6504677f1d4146b13c3fda5bbe0258f9cb289ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): turbovec/src/search.rs:629-636 | turbovec/src/search.rs:1705-1712 | turbovec/src/search.rs:2687-2694 | turbovec/src/search.rs:3132-3139 \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":"turbovec/src/search.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbef1361d72c230336ebdde10e8f68c8ed1750d1c6e356328299ff56d97e63a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): turbovec/src/rotation.rs:539-546 | turbovec/src/rotation.rs:583-590 \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":"turbovec/src/rotation.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f44f86cb367985fc5d998b98ffd00949e9ee76119df0a7e1e07a37ec514003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): turbovec/src/rotation.rs:574-581 | turbovec/src/rotation.rs:598-605 \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":"turbovec/src/rotation.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"9173962f231a1edb962e8d281a881c400b7c0e1c2fa02860ac17e5012ef0c837"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): turbovec/src/rotation.rs:706-713 | turbovec/src/rotation.rs:750-757 \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":"turbovec/src/rotation.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31690f1b634ec5c8a98806c3fa7f925ac62b17d0c59b6410e562194a993257c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): turbovec/src/rotation.rs:741-748 | turbovec/src/rotation.rs:765-772 \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":"turbovec/src/rotation.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ee56bdf3c0e01f6dd2f6adae2da6424eae4d2170cdd6d09549a14fd01dd0b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): turbovec/src/rotation.rs:865-872 | turbovec/src/rotation.rs:909-916 \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":"turbovec/src/rotation.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"2410c234b2ff0d419ae8dfd3496c774733f49d97bd255c6a68de4d15e0d315bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): turbovec/src/rotation.rs:900-907 | turbovec/src/rotation.rs:924-931 \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":"turbovec/src/rotation.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"8deeebdd2da0f816e03a788097b7478ebd6be8843c6ee90187410c48e3a7ca7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): turbovec/src/search.rs:3412-3419 | turbovec/src/search.rs:3424-3431 \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":"turbovec/src/search.rs"},"region":{"startLine":3412}}}],"partialFingerprints":{"codehealthFindingId/v1":"8283f0b620218188aa312157ca0e469dda2a8b5a591c8ebd57bd9eab92c946cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): turbovec/src/io_v7.rs:1148-1154 | turbovec/src/io_v7.rs:1175-1181 \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":"turbovec/src/io_v7.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"018326866f6cc67d55f6790656ce00af439b429600e6fcb254c115eaf04cc590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): turbovec/src/search.rs:1136-1142 | turbovec/src/search.rs:1487-1493 \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":"turbovec/src/search.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"350a7d1e3130371bb313ff4e3be8e4cba6ea5d3f4a5cbdfcb2c4f48516b2c686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): turbovec/src/search.rs:1300-1306 | turbovec/src/search.rs:1332-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":"turbovec/src/search.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae4656a677b21230930cb5fe40c354f83ae0f641100ab2cf027b8c180e4dbbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): turbovec/src/search.rs:2879-2885 | turbovec/src/search.rs:2894-2900 \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":"turbovec/src/search.rs"},"region":{"startLine":2879}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5cd0ef53608c380a6577d7af3bda8e57e63f3521f9eaf550dc8d4a61414bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): turbovec/src/search.rs:2244-2249 | turbovec/src/search.rs:2369-2374 | turbovec/src/search.rs:2487-2492 | turbovec/src/search.rs:2626-2631 \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":"turbovec/src/search.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b025cabf5515746292e0e955c3988027e0eb7f70d2963b59b428d4fe6ec76b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): turbovec/src/search.rs:786-791 | turbovec/src/search.rs:794-799 \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":"turbovec/src/search.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f0577c9a28f5edb217c31fa001efd9cd74a7d233e5a1813150343bdde24ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): turbovec/src/search.rs:2351-2356 | turbovec/src/search.rs:2468-2473 \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":"turbovec/src/search.rs"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45dd6c1dde60c1d749e7fc45df96f7971cbaf47b476a38872bc287e4adbdc37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): turbovec/src/search.rs:3799-3804 | turbovec/src/search.rs:4295-4300 \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":"turbovec/src/search.rs"},"region":{"startLine":3799}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c4b806c4ec8bcf80a69a6b84093259fda949e7356198f575e8dc42e1ec76b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): turbovec-python/src/lib.rs:987-991 | turbovec-python/src/lib.rs:1406-1410 | turbovec-python/src/lib.rs:1456-1460 \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":"turbovec-python/src/lib.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61b9dc12e3fc3010bbd8eecce5bc1fcc8a195858e608132ed2f5aa97a061f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec/src/id_map.rs:282-286 | turbovec/src/id_map.rs:295-299 \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":"turbovec/src/id_map.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"545715ccead8460a598e815ecdf46cbc45d1b38b7c099b7337e8b78c3df3f8de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec/src/rotation.rs:551-555 | turbovec/src/rotation.rs:591-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":"turbovec/src/rotation.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1139f4d0b68bd382815c46fca5e6276c1178a4a7baf13e5f943f5a66526e3e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec/src/rotation.rs:718-722 | turbovec/src/rotation.rs:758-762 \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":"turbovec/src/rotation.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"5357489da4b90bf125be21c1e3f4aa9dacb774b4d93b29344bf0d940d1cb61b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec/src/rotation.rs:877-881 | turbovec/src/rotation.rs:917-921 \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":"turbovec/src/rotation.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5372939eee9ffce5b4fd907ef48174ce18ee5db2d7cb26ca52967f8a4d6aa0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec/src/search.rs:2108-2112 | turbovec/src/search.rs:2142-2146 \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":"turbovec/src/search.rs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf652b15dde46cbde1fcff13e10edc89d18a8cd4b3f7b746bdf07ae0fab8c49c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec/src/search.rs:3581-3585 | turbovec/src/search.rs:4046-4050 \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":"turbovec/src/search.rs"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ba8d39ebc37607286f0bd051244232b78fe2378a2a2635a0478d79c82d5fe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec-python/src/lib.rs:527-531 | turbovec-python/src/lib.rs:1045-1049 \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":"turbovec-python/src/lib.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"c940a8bdd4a9640997582f98e46c56436e0abbc512823adbc60cda9283ddb154"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec-python/src/lib.rs:815-819 | turbovec-python/src/lib.rs:1453-1457 \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":"turbovec-python/src/lib.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"50523bb1611714e9131601fbc72d757229deca2a8f57f89a353282f53bec9511"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): turbovec/src/encode.rs:101-112 | turbovec/src/encode.rs:145-156 \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":"turbovec/src/encode.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"836702d4243984cfa61cdaf31dca0df484d570e0ba6e7c3bfa1fb9afbf8417a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): turbovec/src/id_map.rs:914-924 | turbovec/src/id_map.rs:936-946 \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":"turbovec/src/id_map.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e547e8164f0f334bf3a32f8c24a7aa626a6cad87887701dc69837d3d85cb421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec-python/src/lib.rs:910-914 | turbovec-python/src/lib.rs:1477-1481 \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":"turbovec-python/src/lib.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"092063e715e381679796e545ee98b0fded75a7965905cf5b99faa5b31fdc2499"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec/src/id_map.rs:909-913 | turbovec/src/id_map.rs:931-935 \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":"turbovec/src/id_map.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"b935678d94843519055f912759e9f13f0ed264a47e21331053bc92fb59f9261e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec/src/io_v7.rs:1525-1529 | turbovec/src/io_v7.rs:1545-1549 \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":"turbovec/src/io_v7.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e93d457fdfed92a0fcb41c0668a8f34c465655d81bc8014c6a336779660384a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec/src/search.rs:819-823 | turbovec/src/search.rs:824-828 \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":"turbovec/src/search.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb47eff38361d01f0d3971617091a07b2c3d2a9acf2f1c596b430a7c1e8505ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec/src/search.rs:1274-1278 | turbovec/src/search.rs:1315-1319 \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":"turbovec/src/search.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c7d407b8905bbd4e0fbadcf2f2611101c26839dacb7dc8446c7c17f8885ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec/src/search.rs:1284-1288 | turbovec/src/search.rs:1320-1324 \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":"turbovec/src/search.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7680a421a5913e101ddec2a85727fa7fca1f22066ae05341bda650c5cca53e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): turbovec/src/search.rs:2583-2589 | turbovec/src/search.rs:2593-2599 \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":"turbovec/src/search.rs"},"region":{"startLine":2583}}}],"partialFingerprints":{"codehealthFindingId/v1":"24494549c7319c942efaf1c25acef626bb9b11fa96fec27e70dcdcf623a26d78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): turbovec-python/python/turbovec/langchain.py:397-420 | turbovec-python/python/turbovec/llama_index.py:392-412 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060turbovec-python/python/turbovec/langchain.py:397\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/langchain.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd39bb4754e79a6334b7426482f421e62cd12412dfd47af72f9b66f670d8940"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): turbovec-python/python/turbovec/agno.py:1065-1080 | turbovec-python/python/turbovec/agno.py:1109-1127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/agno.py"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a928cf9d1a49deead24cb949a27f3fdd1e6b38a79e5ce9dadda6935fea5d903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): turbovec-python/python/turbovec/haystack.py:651-668 | turbovec-python/python/turbovec/langchain.py:602-619 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/haystack.py"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"96496e07ed44ba25e07969d08de45a011662783a6bace350959210dc775ab5ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): turbovec-python/python/turbovec/langchain.py:265-282 | turbovec-python/python/turbovec/langchain.py:295-311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060turbovec-python/python/turbovec/langchain.py:295\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/langchain.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b13a447144cfd68d1a5838442b3db4a9717d3c5e0be44ad41bb6408e1a2fe68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): turbovec-python/python/turbovec/agno.py:378-390 | turbovec-python/python/turbovec/agno.py: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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/agno.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"010102148511a987e2beb5d5b771f2033acd9ab59dfbe19bfc77d6df47de5693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): turbovec-python/python/turbovec/agno.py:398-405 | turbovec-python/python/turbovec/agno.py:425-437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060turbovec-python/python/turbovec/agno.py:425\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/agno.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c959e1fe171538f5ac947a7bb5b536fe2dab654867397743f28fbe48c5d9278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): turbovec-python/python/turbovec/agno.py:961-968 | turbovec-python/python/turbovec/agno.py:986-993 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060turbovec-python/python/turbovec/agno.py:983\u0060 calls \u0060hasattr\u0060, \u0060async_get_embedding\u0060 and \u0060turbovec-python/python/turbovec/agno.py:959\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/agno.py"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"611bc6afdea21a32c9d551aeccdfb144266e0ca4d1b795f063a22b55be9d4fa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): turbovec-python/python/turbovec/langchain.py:621-628 | turbovec-python/python/turbovec/langchain.py:637-648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"turbovec-python/python/turbovec/langchain.py"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b14c33563877bb88e0a68897ea562cdb3561a8b324a45c4bc5f7ce8eced21f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): turbovec-python/python/turbovec/_persist.py:510-514 | turbovec-python/python/turbovec/_persist.py:517-521 \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":"turbovec-python/python/turbovec/_persist.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c6dc42a81bc12f07ef546ba82ddbebe2d0b43da495099333bad65b84942aae"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: turbovec: turbovec: 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":"9922b041c93494ebdc7c15440e75bdbd98d9895de5c7cda1df52562b3ff75fd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: turbovec/src/search.rs: turbovec/src/search.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 114 in turbovec::search::search at line 3206. 9 of those changes were fix/bug commits, and the other 17 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-05-20..2026-08-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-20 13:23:21 \u002B01:00\u0027 --until=\u00272026-08-18 13:23:21 \u002B01:00\u0027 --full-history --no-merges -- turbovec/src/search.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":"turbovec/src/search.rs"},"region":{"startLine":3206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fba7849dfdbf3a07cbcc9cbae68f0294bbb72645d12aa945dac065bf180f50e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: turbovec/src/lib.rs: turbovec/src/lib.rs changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in TurboQuantIndex::from_parts at line 2371. 27 of those changes were fix/bug commits, and the other 36 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-05-20..2026-08-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-20 13:23:21 \u002B01:00\u0027 --until=\u00272026-08-18 13:23:21 \u002B01:00\u0027 --full-history --no-merges -- turbovec/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":"turbovec/src/lib.rs"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e690e25d07c79d123c12846f7124c641ebab2662998319413f222ec655e717"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: turbovec-python/python/turbovec/llama_index.py: turbovec-python/python/turbovec/llama_index.py changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in TurboQuantVectorStore.query at line 786. 16 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-05-20..2026-08-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-20 13:23:21 \u002B01:00\u0027 --until=\u00272026-08-18 13:23:21 \u002B01:00\u0027 --full-history --no-merges -- turbovec-python/python/turbovec/llama_index.py\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":"turbovec-python/python/turbovec/llama_index.py"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"9741f15117fdfce08383908bea1c529e771f58ff32f92bf14e8c286c09fdd20b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: turbovec-python/python/turbovec/agno.py: turbovec-python/python/turbovec/agno.py changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in TurboQuantVectorDb.insert at line 471. 17 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-05-20..2026-08-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-20 13:23:21 \u002B01:00\u0027 --until=\u00272026-08-18 13:23:21 \u002B01:00\u0027 --full-history --no-merges -- turbovec-python/python/turbovec/agno.py\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":"turbovec-python/python/turbovec/agno.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af380ab8394f66d41b5301e39ce1148f44de20ac3674adb68ea8924a6c20ce2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: turbovec/src/io.rs: turbovec/src/io.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in turbovec::io::sweep_stale_tmps at line 350. 15 of those changes were fix/bug commits, and the other 20 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-05-20..2026-08-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-20 13:23:21 \u002B01:00\u0027 --until=\u00272026-08-18 13:23:21 \u002B01:00\u0027 --full-history --no-merges -- turbovec/src/io.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":"turbovec/src/io.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f3afd70d2c733a9daed06da54f27dec3b144a732e14a2a0bf5c944f73061ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: turbovec-python/python/turbovec/langchain.py: turbovec-python/python/turbovec/langchain.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in TurboQuantVectorStore._search_vector at line 563. 15 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-05-20..2026-08-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-20 13:23:21 \u002B01:00\u0027 --until=\u00272026-08-18 13:23:21 \u002B01:00\u0027 --full-history --no-merges -- turbovec-python/python/turbovec/langchain.py\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":"turbovec-python/python/turbovec/langchain.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc40af42cadf177201d9b7191d6c76e0e4fe9f9d83afda8d1b8a60d57457bfc8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: turbovec-python/python/turbovec/haystack.py: turbovec-python/python/turbovec/haystack.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TurboQuantDocumentStore.embedding_retrieval at line 578. 13 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-05-20..2026-08-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-20 13:23:21 \u002B01:00\u0027 --until=\u00272026-08-18 13:23:21 \u002B01:00\u0027 --full-history --no-merges -- turbovec-python/python/turbovec/haystack.py\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":"turbovec-python/python/turbovec/haystack.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"3016b4a2d5137981c2ef7ddcd368a2af122b71449b7413f64c1d2c01098c838c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: turbovec/src/io_v7.rs: turbovec/src/io_v7.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in turbovec::io_v7::load_image at line 1293. 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-05-20..2026-08-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-20 13:23:21 \u002B01:00\u0027 --until=\u00272026-08-18 13:23:21 \u002B01:00\u0027 --full-history --no-merges -- turbovec/src/io_v7.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":"turbovec/src/io_v7.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab5eb4cfd63c294cc07ef323d5fc82fcdc6f5e66ec4a0f2980941ab4c1b32fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: turbovec/src/error.rs: turbovec/src/error.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in FromPartsError::fmt at line 434. 5 of those changes were fix/bug commits, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-20..2026-08-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-20 13:23:21 \u002B01:00\u0027 --until=\u00272026-08-18 13:23:21 \u002B01:00\u0027 --full-history --no-merges -- turbovec/src/error.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":"turbovec/src/error.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ca0e7dbaa6328b18153d96f3060fc3d8dd106b24248403fda59ea6e291f269"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: benchmarks/hillclimb/bench_ops.py: benchmarks/hillclimb/bench_ops.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in bench_ops.main at line 61. 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-05-20..2026-08-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-20 13:23:21 \u002B01:00\u0027 --until=\u00272026-08-18 13:23:21 \u002B01:00\u0027 --full-history --no-merges -- benchmarks/hillclimb/bench_ops.py\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":"benchmarks/hillclimb/bench_ops.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c1ca75da2a182299b7db2a519b69a4cfda329a1582c0126492781d5c1c320e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: turbovec-python/src/lib.rs: turbovec-python/src/lib.rs changed 38 times in last 90 days and 20 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is IdMapIndex::search at line 1129), 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: five release-blocking bugs (#484, #501, #487, #473, #493) (#533)\u201D; \u201Cfix(#418): a drained warming-up index no longer round-trips into permanent Identity calibration (#443)\u201D; \u201Cfix(#360): don\u0027t run the core\u0027s durability warning under the index read guard (#433)\u201D; \u201Cfix: Python object model \u2014 unsound bool mask read, pickle/copy, weakref, real __module__, chunk_size in signature (#340, #345, #349) (#417)\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-05-20..2026-08-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-20 13:23:21 \u002B01:00\u0027 --until=\u00272026-08-18 13:23:21 \u002B01:00\u0027 --full-history --no-merges -- turbovec-python/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":"turbovec-python/src/lib.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa574d481985ccf9ec70f45c88b2a61641c64dfcea69b44f6f568874cf4d1b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: turbovec-python/python/turbovec/_persist.py: turbovec-python/python/turbovec/_persist.py changed 10 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is _persist._check_json_faithful at line 217), 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: retry ERROR_ACCESS_DENIED, not just ERROR_SHARING_VIOLATION, on Windows renames (#415) (#442)\u201D; \u201Cfix: IdHasher finalizer collapses ids above shift 32 (#385); side-car rename durability and schema_version type gate (#350) (#423)\u201D; \u201Cfix: reject side-car payloads JSON can\u0027t round-trip; require key presence in LangChain dict filters (#350, #381) (#402)\u201D; \u201Cfix: half-present agno store no longer loads silently empty; error messages name the real condition (#328, #329) (#359)\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-05-20..2026-08-18, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-20 13:23:21 \u002B01:00\u0027 --until=\u00272026-08-18 13:23:21 \u002B01:00\u0027 --full-history --no-merges -- turbovec-python/python/turbovec/_persist.py\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":"turbovec-python/python/turbovec/_persist.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace12fbe428096558499b14a2f146f27555755a55bb5bcd2c4a4b035ab0c70b1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e9445f35b46222b3d3d35bc2e2d8ffe5b734ef88218319b0276b672cc1c7fad"},"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":"3e4b27239596f29dafe7289cca889987c98c5242d520cc27d6d557a80985f355"},"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":"4c55121275494b4e2c482610eb7e6275b67b8034b6ddaabc20df791dfa85b9b3"},"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":"3ce54e45b0900bf7df28a3d3af71d17de762b82ff7d3f4003cadda7653c993ae"},"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":"e6f65da0a3639a8d3af42ca7176c97c8fda03a477e946cbf6a2688a1a1101999"},"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":"3e1c7f75ca8b405cce256a910bc74e662f129696ed66c28771cd176b6db8eb50"},"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":"792adaa2ecae2d059bead008254db14a37b5c85f6fde1163ad9f99ce2595eade"},"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":"219afdbc06ce1c7344e1b2f8967b1ac01c401ce4ff3d6b7f18eda6a6ce62ba5f"},"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":"33659909a528e27256b24849ca6bb3f74e97626872905a3a87faeae39756a02f"},"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":"2b0517e74d9df5ee81deba7b80564dd86ff1b59f4270ca0d1b588b7ea5034c9b"},"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":"d99fbca79a99c9380ced0b86a5bfbb2634f2b45bc99e3d127d34e61a9e2ff034"},"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":"34de610c496865d821f4a5ccb15ce79f30a7cc09b46e7dd1454398e568835229"},"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":"308510c3ff9e6490b182a1f6dbe6d13209ddf69bc537c709d6269b1c1b6c81c7"},"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":"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":"20c4e985617c54ec14d685e54108c633c3917d7c92eeb7e7f09bb3c83a949c36"},"taxa":[{"id":"CWE-78","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":"bf1a0c17f7806419fbd8325ed40ac090aaebd18c2a3d8d4692f05d8389d8f09f"},"taxa":[{"id":"CWE-327","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":"61e062304cc84e85b581ba3e8131980f88a8a69e76a68d98c29178c29b090cc6"},"taxa":[{"id":"CWE-327","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":"2036bcb2a7b463f121c57a481345622dc5e03b4e100eedd822a8e8404162437b"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"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":"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"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"CWE-327","shortDescription":{"text":"CWE-327"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-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":19,"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."]}]}