{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P11","name":"BDD / executable specs","shortDescription":{"text":"BDD / executable specs"},"helpUri":"https://codehealth.canine.dev/dimensions/P11"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Tool.__post_init__ (cyclomatic 42): Tool.__post_init__ has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/tools/tool.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1cd4ebbcd5cbcc9cf9f9de9fe185f66b697a19fc9c14394d514254e7a91097"}},{"ruleId":"D1","level":"warning","message":{"text":"openai_responses._convert_streaming_chunks_to_chat_message (cyclomatic 34): openai_responses._convert_streaming_chunks_to_chat_message has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai_responses.py"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"69142ca03bd0644a36e55c10ef05c043e7d19a2905354c9f7b641fec3a90e5a8"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineBase.connect (cyclomatic 31): PipelineBase.connect has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/base.py"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf728e6c4b63b38ee3b0c26fcb57da017e123014bbfa69099ccca8cc5888564"}},{"ruleId":"D1","level":"warning","message":{"text":"type_utils._strict_types_are_compatible (cyclomatic 28): type_utils._strict_types_are_compatible has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/type_utils.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"685894fa95534a018028ca083d415096349b077ebf766b89836315fce69e8b93"}},{"ruleId":"D1","level":"warning","message":{"text":"draw._validate_mermaid_params (cyclomatic 26): draw._validate_mermaid_params has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/draw.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb82374e9eeaeac4ebb19626b7ff6b9e205fbe77c7f33ff487610303941fed1d"}},{"ruleId":"D1","level":"warning","message":{"text":"Pipeline.run_async_generator (cyclomatic 26): Pipeline.run_async_generator has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/pipeline.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"907b297ec7ea1060d50abcd3d98128086d3c4ebefbd4238eefbe22c530987ea1"}},{"ruleId":"D1","level":"warning","message":{"text":"AnswerBuilder.run (cyclomatic 24): AnswerBuilder.run has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/builders/answer_builder.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ee97c5e8962814fd03e7df3f3e90e9a563757f528a6b657f25fb2d4840410b"}},{"ruleId":"D1","level":"warning","message":{"text":"utils._convert_streaming_chunks_to_chat_message (cyclomatic 24): utils._convert_streaming_chunks_to_chat_message has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/utils.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ae4e80a07181dc2feca7c1047bc58fa01c456474636faf2296a2c8820528dc"}},{"ruleId":"D1","level":"warning","message":{"text":"XLSXToDocument._extract_tables (cyclomatic 23): XLSXToDocument._extract_tables 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":"haystack/components/converters/xlsx.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a61155df970eb3340f00a5b82f818ac528265b097ee6bc7a7b5a293a43191c8"}},{"ruleId":"D1","level":"warning","message":{"text":"type_utils._get_conversion_strategy (cyclomatic 23): type_utils._get_conversion_strategy 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":"haystack/core/type_utils.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb34737d410ff4e6084c73d227b8076e719dc364e379201a45417cc965c504e"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatMessage.from_openai_dict_format (cyclomatic 23): ChatMessage.from_openai_dict_format 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":"haystack/dataclasses/chat_message.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd02cf191b9a48a07a55a73aca599edc07a7231f23c3615c3a7be61f938bdcf"}},{"ruleId":"D1","level":"warning","message":{"text":"openai._convert_chat_completion_chunk_to_streaming_chunk (cyclomatic 22): openai._convert_chat_completion_chunk_to_streaming_chunk has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc67638250e6992aa2ced7bf3ab0a167f36a8b4a57d5fe170788673d4e69423"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatMessageExtension._validate_build_chat_message (cyclomatic 22): ChatMessageExtension._validate_build_chat_message has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/jinja2_chat_extension.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f32dab85a1d06ff9df696382f7b21c6bfb293d558dc7223555a2dbf366b3ae0"}},{"ruleId":"D1","level":"warning","message":{"text":"MetaFieldRanker.run (cyclomatic 21): MetaFieldRanker.run 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":"haystack/components/rankers/meta_field.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac12cb7eebdfaa713e94dba62b877ff9165649a7203a8cbbe4cd334e41df78d5"}},{"ruleId":"D1","level":"warning","message":{"text":"Agent.__init__ (cyclomatic 20): Agent.__init__ has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/agents/agent.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"96527ebdc784fc5dff1a8fcc929a9592597a35e8259a2a4c6c566747037fa2e0"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPromptBuilder.__init__ (cyclomatic 20): ChatPromptBuilder.__init__ 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":"haystack/components/builders/chat_prompt_builder.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb1749405523451af045c5c3822e83be7c091435071cfcdd969eb99aeedc3c7"}},{"ruleId":"D1","level":"warning","message":{"text":"openai_responses._convert_chat_message_to_responses_api_format (cyclomatic 20): openai_responses._convert_chat_message_to_responses_api_format 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":"haystack/components/generators/chat/openai_responses.py"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c86c770b1b2da5c67216991690aec2348fa55e6454392d3d445794d0dee2bbc"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonSchemaValidator.run (cyclomatic 20): JsonSchemaValidator.run has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/validators/json_schema.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0203e28f871f6cc549530e4598eddf9a2eed1118e5cd660c80bd0ac6b46858"}},{"ruleId":"D1","level":"warning","message":{"text":"Pipeline.run (cyclomatic 20): Pipeline.run 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":"haystack/core/pipeline/pipeline.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"058385ed2fa5b03fa8bbff2dfe3cc8d8b6225d9b7cf704f7b17535483d482339"}},{"ruleId":"D1","level":"warning","message":{"text":"EvaluationRunResult.comparative_detailed_report (cyclomatic 20): EvaluationRunResult.comparative_detailed_report 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":"haystack/evaluation/eval_run_result.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b43cc7d1d49f73b88b2246eb2ca7d78a900dabc971aeef1105f7bd258de7ad9"}},{"ruleId":"D1","level":"warning","message":{"text":"from_function.create_tool_from_function (cyclomatic 20): from_function.create_tool_from_function 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":"haystack/tools/from_function.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ed31532d7846c63f34ef4a3052d4b872a3e947095602a31d742140d01d9892"}},{"ruleId":"D1","level":"warning","message":{"text":"hf.convert_message_to_hf_format (cyclomatic 20): hf.convert_message_to_hf_format 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":"haystack/utils/hf.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"799ba60880323db11c7b99eb86679504a77cba0741c7c85d5918a71ff10b94c3"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownHeaderSplitter._split_text_by_markdown_headers (cyclomatic 19): MarkdownHeaderSplitter._split_text_by_markdown_headers has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/markdown_header_splitter.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8983dd7b16ebd6457e50bbe2ecba2c6d6ba8f450055f5b2afd814116e1b332b"}},{"ruleId":"D1","level":"warning","message":{"text":"JSONConverter._get_content_and_meta (cyclomatic 18): JSONConverter._get_content_and_meta 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":"haystack/components/converters/json.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"605ebf7aef8a56c2f966c6b76b63acdd5aa8de100c2979a13c1c1bcb563dab0d"}},{"ruleId":"D1","level":"warning","message":{"text":"PDFMinerToDocument._convert_page (cyclomatic 18): PDFMinerToDocument._convert_page 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":"haystack/components/converters/pdfminer.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"32733cabf29fbc886f5ac15098ff1c0ba6fa8a076b8c0e564dca40f661994eba"}},{"ruleId":"D1","level":"warning","message":{"text":"DocumentCleaner.run (cyclomatic 18): DocumentCleaner.run 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":"haystack/components/preprocessors/document_cleaner.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b3e173c7486601265c77e9aaea46acc9e9a325fb43b9b268f88ecf5a2bad82"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonCodeSplitter._extract_units (cyclomatic 18): PythonCodeSplitter._extract_units 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":"haystack/components/preprocessors/python_code_splitter.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"723d0abd82b06d54ea9acca5abe9dff71256d1c9c4f0cf2cd82cbdf7f63617e0"}},{"ruleId":"D1","level":"warning","message":{"text":"LostInTheMiddleRanker.run (cyclomatic 18): LostInTheMiddleRanker.run 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":"haystack/components/rankers/lost_in_the_middle.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f2a4db3deebbd93a6d67c73ec5d6a27dc182d1e30e07edd51fdf3b18756c4f"}},{"ruleId":"D1","level":"warning","message":{"text":"draw._to_mermaid_text (cyclomatic 18): draw._to_mermaid_text 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":"haystack/core/pipeline/draw.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8a0383258b88638c943de464b0f48dce8a55782bd11efa579d8697643f1812"}},{"ruleId":"D1","level":"warning","message":{"text":"utils._check_union_compatibility (cyclomatic 18): utils._check_union_compatibility 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":"haystack/core/super_component/utils.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a931db92510e245b7daef4fa912b68a7c941cd20ba43e51f0540f46fb049131"}},{"ruleId":"D1","level":"warning","message":{"text":"strategies._apply_tool_execution_decisions (cyclomatic 18): strategies._apply_tool_execution_decisions 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":"haystack/hooks/human_in_the_loop/strategies.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"f574215a630cf50a08d72b217b62e776c8effe1303a61daebb0ce226a0bc30d2"}},{"ruleId":"D1","level":"warning","message":{"text":"base_serialization._serialize_value_with_schema (cyclomatic 18): base_serialization._serialize_value_with_schema 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":"haystack/utils/base_serialization.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86ee28d434df4f497d0a31ffc74c7e5cd2e6c6321501ad315d8c27e76ef4e35"}},{"ruleId":"D1","level":"warning","message":{"text":"openai_responses._convert_response_chunk_to_streaming_chunk (cyclomatic 17): openai_responses._convert_response_chunk_to_streaming_chunk has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai_responses.py"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2eb4fc2904253f94153f2d65bc0a5793d067e031c68e4c84d83463a490bb684"}},{"ruleId":"D1","level":"warning","message":{"text":"Agent._register_prompt_variables (cyclomatic 16): Agent._register_prompt_variables 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":"haystack/components/agents/agent.py"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc6fcdecb9773a6e23827774848dfe5ffba227187160016db5a09ac18501e0e"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPromptBuilder.run (cyclomatic 16): ChatPromptBuilder.run 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":"haystack/components/builders/chat_prompt_builder.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e59144647a262ae06a44890644d9dd0760c7a3d7f9782541c012e999a5913d"}},{"ruleId":"D1","level":"warning","message":{"text":"CSVToDocument.run (cyclomatic 16): CSVToDocument.run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/csv.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2118885099316fdd2a876cbf6d6e091599e0b7eaeb33c13cd48536a830b0bfa"}},{"ruleId":"D1","level":"warning","message":{"text":"ConditionalRouter.run (cyclomatic 16): ConditionalRouter.run 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":"haystack/components/routers/conditional_router.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7facc6355ea3067a71edc4a5da03c1d0a0333424376f5c635533c6feaef36d"}},{"ruleId":"D1","level":"warning","message":{"text":"serialization.default_from_dict (cyclomatic 16): serialization.default_from_dict 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":"haystack/core/serialization.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef73154d96819930a2104bbced3d2a65296bed0e965fe4c8262e567e5880ae06"}},{"ruleId":"D1","level":"warning","message":{"text":"ComponentTool.__init__ (cyclomatic 16): ComponentTool.__init__ 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":"haystack/tools/component_tool.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa0085bf75e5d2ecbb04018c54fcbefc4e550c3644233d9f24fc71a7f7acce5"}},{"ruleId":"D1","level":"warning","message":{"text":"type_serialization.serialize_type (cyclomatic 16): type_serialization.serialize_type has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/type_serialization.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b089b24169b48ae6d73c38f55fbb3682a5af6b37951e812ac0a9615d82977a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool.__post_init__ (cognitive 89): Tool.__post_init__ has cognitive complexity 89 (threshold 15). Drivers by points: if/else 24 (63 pts), loops 5 (13 pts), boolean chains 12, error handling 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/tools/tool.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e760e7ee86be566964c3bd2813ce69e6c70f2d22eeeb94f85d62dbe3944c98"}},{"ruleId":"D2","level":"warning","message":{"text":"PDFMinerToDocument._convert_page (cognitive 60): PDFMinerToDocument._convert_page has cognitive complexity 60 (threshold 15). Drivers by points: if/else 11 (41 pts), ternaries 1 (8 pts), error handling 1 (4 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/pdfminer.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"106c0b4efd46914dfa884300198d1f918a9cb84c563d0e1fba9f58672dc898a9"}},{"ruleId":"D2","level":"warning","message":{"text":"XLSXToDocument._extract_tables (cognitive 56): XLSXToDocument._extract_tables has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 6 (14 pts), ternaries 1 (5 pts), boolean chains 4 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/xlsx.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5547dba2b5943071e908d6f8233880e39ec7c557cd5af329586e8daeee68877"}},{"ruleId":"D2","level":"warning","message":{"text":"openai_responses._convert_streaming_chunks_to_chat_message (cognitive 55): openai_responses._convert_streaming_chunks_to_chat_message has cognitive complexity 55 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 7 (10 pts), ternaries 3 (7 pts), boolean chains 6, error handling 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":"haystack/components/generators/chat/openai_responses.py"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6a68fc7c253981297d79bdea1a088dce9f8a75a2fdf8f24df9cd6441804669"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline.run_async_generator (cognitive 46): Pipeline.run_async_generator has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 7 (16 pts), boolean chains 6 (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":"haystack/core/pipeline/pipeline.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc83f97ba88ca662bfc28e89ef2391b52ba1b8c00e35f35a8336de3d70e47e59"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineBase.connect (cognitive 43): PipelineBase.connect has cognitive complexity 43 (threshold 15). Drivers by points: if/else 24 (34 pts), boolean chains 4, error handling 2, ternaries 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/base.py"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae26813a812f08d2e0ff79faced06f4741410a9a07e948b05e4dbb9055ba727"}},{"ruleId":"D2","level":"warning","message":{"text":"JSONConverter._get_content_and_meta (cognitive 42): JSONConverter._get_content_and_meta has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 3 (8 pts), error handling 3 (5 pts), boolean chains 2 (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":"haystack/components/converters/json.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2bff5081fb42954159311d6ae89288f36121cc5a3b55cbacb3b4d003280146"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._convert_streaming_chunks_to_chat_message (cognitive 42): utils._convert_streaming_chunks_to_chat_message has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 5 (7 pts), ternaries 5 (6 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/utils.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7cb846ab4227221df97fd4821309ed0f864f0b57d66332df7f0a45f65967d9"}},{"ruleId":"D2","level":"warning","message":{"text":"RecursiveDocumentSplitter._chunk_text (cognitive 41): RecursiveDocumentSplitter._chunk_text has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (32 pts), ternaries 2 (6 pts), loops 2 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/recursive_splitter.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6153791aea5570ff622f856b9ff32676a8b8617b9159afc4adc7ffc413572e"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPromptBuilder.__init__ (cognitive 39): ChatPromptBuilder.__init__ has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (9 pts), boolean chains 7 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/builders/chat_prompt_builder.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"808191fe8c7d6d8175dd19c0b2b56d2dd87c588eaf3fd76ddaf9176205251d8b"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineBase._from_dict_impl (cognitive 38): PipelineBase._from_dict_impl has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (24 pts), error handling 3 (11 pts), loops 2, boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/base.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b0776e28eaadca1db470f8330a2c6796c5c8855944dd7fb9258411174be1c1"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswerBuilder.run (cognitive 37): AnswerBuilder.run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 7 (13 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/builders/answer_builder.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e724e43c1047fd14bdba89105e8d15a117318e2a11fa1201eeb6fce06732b668"}},{"ruleId":"D2","level":"warning","message":{"text":"ConditionalRouter.run (cognitive 35): ConditionalRouter.run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (22 pts), ternaries 3 (6 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/conditional_router.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5ba711bba0d282abdd729dfb041f915e2498a8a1ba399736eb9da22c6081f2"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineBase._merge_super_component_pipelines (cognitive 35): PipelineBase._merge_super_component_pipelines has cognitive complexity 35 (threshold 15). Drivers by points: loops 8 (21 pts), if/else 4 (14 pts) (nesting depth added 23). 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":"haystack/core/pipeline/base.py"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d1fa4736a615acdf4576e0d3c79160d6239f973b0f93df56f1b62f5759d31b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatMessageExtension._validate_build_chat_message (cognitive 35): ChatMessageExtension._validate_build_chat_message has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (28 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/jinja2_chat_extension.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"412f3fc7a16241e854d0ebedf0d302d62aa5ad688ae75c81727fff16a8dc4202"}},{"ruleId":"D2","level":"warning","message":{"text":"FileTypeRouter.run (cognitive 34): FileTypeRouter.run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (4 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/file_type_router.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1972609eb1f3bb67c3c05d1fa27fd353c11c4fdf54d6ccde7ef5173d24ce0f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipeline.run (cognitive 34): Pipeline.run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/pipeline.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dac127c7613b40e4404eaf5abfc61a62c71090677ffd37ed57e31f50b1931c"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPromptBuilder.run (cognitive 33): ChatPromptBuilder.run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (6 pts), boolean chains 4 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/builders/chat_prompt_builder.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7db7a6f9dc05ed39fc2ebf031cf79e60cb1c5d5b1c7465bfef79a2f78575302"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownHeaderSplitter._apply_secondary_splitting (cognitive 33): MarkdownHeaderSplitter._apply_secondary_splitting has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (10 pts), boolean chains 3 (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":"haystack/components/preprocessors/markdown_header_splitter.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"a721cfe95a8b931ed230863312972aa3d02439bdd10a17582b992e9b839cd560"}},{"ruleId":"D2","level":"warning","message":{"text":"ConditionalRouter._validate_routes (cognitive 32): ConditionalRouter._validate_routes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (20 pts), ternaries 3 (6 pts), loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/conditional_router.py"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e45ac3e5f538ac4d16ff688a6f2efec8b85e5f22bb25148405ee653e841995"}},{"ruleId":"D2","level":"warning","message":{"text":"type_utils._get_conversion_strategy (cognitive 32): type_utils._get_conversion_strategy has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/type_utils.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"646c7e6eb2bce536f9665045db3b500b6e619e6834912049d951bda4c47ed60a"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatMessage.from_openai_dict_format (cognitive 32): ChatMessage.from_openai_dict_format has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/dataclasses/chat_message.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b07bc35ab355a60e37cd56e0bce36af8014038efc905ae5f459a5e08dcb737"}},{"ruleId":"D2","level":"warning","message":{"text":"EvaluationRunResult.comparative_detailed_report (cognitive 32): EvaluationRunResult.comparative_detailed_report has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 5 (13 pts), boolean chains 3, loops 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":"haystack/evaluation/eval_run_result.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a91345cdf9b80085ed694b77842bf6f9e6fb51591fb86d27f38ac494ffd37bb"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentCleaner.run (cognitive 31): DocumentCleaner.run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/document_cleaner.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f46c2b309f9bf36e19edc3d3dd5fcf3522e6433dfb38f6ffc23d606b05db7d"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownHeaderSplitter._split_text_by_markdown_headers (cognitive 31): MarkdownHeaderSplitter._split_text_by_markdown_headers has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/markdown_header_splitter.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cad1c4a4f08534077df44dc43f1307d84e693325a29255564c72764a0a8b8ad"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineBase._write_component_outputs (cognitive 30): PipelineBase._write_component_outputs has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 4 (16 pts), if/else 6 (9 pts), error handling 1 (3 pts), boolean chains 1, loops 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":"haystack/core/pipeline/base.py"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"900d0cc95652681f9c1b3e8aa09daa4a4acf4aaac8c012eafe63fae276b38a51"}},{"ruleId":"D2","level":"warning","message":{"text":"serialization.default_from_dict (cognitive 30): serialization.default_from_dict has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 1 (5 pts), boolean chains 4, error handling 1 (4 pts), loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/serialization.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a8a391fddf32d78c313b4d1c05df374430fdc4f8ec2f08e0ed0af54a84c8c7"}},{"ruleId":"D2","level":"warning","message":{"text":"type_utils._strict_types_are_compatible (cognitive 30): type_utils._strict_types_are_compatible has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 11, ternaries 1 (2 pts), error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/type_utils.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69672edc0fa9d8106454269c8d33ef7456766aea3d9ea3f0a12f0164a574dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"CSVToDocument.run (cognitive 29): CSVToDocument.run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/csv.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"768ed7711b55f34ce5e86a3131dee42798f5e3311d287a6ef59fea89e8833eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"draw._validate_mermaid_params (cognitive 29): draw._validate_mermaid_params has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 12 (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":"haystack/core/pipeline/draw.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf5a8d6d718b3a9fc05724bd660214e08338eeab6e290fcd94e855c7f2c7372"}},{"ruleId":"D2","level":"warning","message":{"text":"openai._convert_chat_completion_chunk_to_streaming_chunk (cognitive 28): openai._convert_chat_completion_chunk_to_streaming_chunk has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (11 pts), boolean chains 8, if/else 7, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"28533f11cb01abc94954530f6bb9a0af6c5d210b63f78734e933de9557020719"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._check_union_compatibility (cognitive 28): utils._check_union_compatibility has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (7 pts), boolean chains 5 (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":"haystack/core/super_component/utils.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6694a15b218fc5c335215523dc9d6da367c2efc23185ade42a62b54543adea99"}},{"ruleId":"D2","level":"warning","message":{"text":"from_function.create_tool_from_function (cognitive 28): from_function.create_tool_from_function has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 4 (5 pts), boolean chains 4, loops 2, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/tools/from_function.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ba7808c4105edece4e0b1848dd3ec08aa1ae66d3319e1ad03dd829bdfd983d"}},{"ruleId":"D2","level":"warning","message":{"text":"AnswerBuilder._extract_reference_idxs (cognitive 27): AnswerBuilder._extract_reference_idxs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/builders/answer_builder.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb0808abebb6263022b1265003d42519016577db7b223e953d318b1f04069db"}},{"ruleId":"D2","level":"warning","message":{"text":"PyPDFToDocument._extract_links (cognitive 27): PyPDFToDocument._extract_links has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 1 (5 pts), error handling 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/pypdf.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f53b259e8e074b5383a1dfd019298471534ba5090de4f178e836fe402b145f"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonSchemaValidator.run (cognitive 27): JsonSchemaValidator.run has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 8, boolean chains 5, loops 2 (4 pts), error handling 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/validators/json_schema.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5996e68970274e8a430fc1d65d4bce7e74fc746f4bbc5d23edd8d434efd956"}},{"ruleId":"D2","level":"warning","message":{"text":"strategies._apply_tool_execution_decisions (cognitive 27): strategies._apply_tool_execution_decisions has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/human_in_the_loop/strategies.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85200e3895908d47b61ba8a19efa2b1f7e070c9112583eda366d8ef39da344c"}},{"ruleId":"D2","level":"warning","message":{"text":"hf.convert_message_to_hf_format (cognitive 27): hf.convert_message_to_hf_format has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, loops 2 (4 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":"haystack/utils/hf.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d511103e31c0db343c659efef545c3a0714f32be337043b49fb5a9088d328363"}},{"ruleId":"D2","level":"warning","message":{"text":"Agent._register_prompt_variables (cognitive 26): Agent._register_prompt_variables has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/agents/agent.py"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a9f9c22b6d32436c9f0cebb5f0992744215e97d82388bb6da7c5ffd6f496ad"}},{"ruleId":"D2","level":"warning","message":{"text":"draw._to_mermaid_text (cognitive 26): draw._to_mermaid_text has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 4 (8 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/draw.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b184664af88178cc0122bc6593f4bc64c09fc764c7a12bd610960d4726f56a"}},{"ruleId":"D2","level":"warning","message":{"text":"XLSXToDocument._map_hyperlinks_to_dataframe (cognitive 25): XLSXToDocument._map_hyperlinks_to_dataframe has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 6 (12 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/xlsx.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e92975b1b795ecad5942aea27e2c3c07944c06d90ccc1a783c512af6cf0b70"}},{"ruleId":"D2","level":"warning","message":{"text":"openai_responses._convert_chat_message_to_responses_api_format (cognitive 25): openai_responses._convert_chat_message_to_responses_api_format has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (5 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai_responses.py"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"223c7773a2d1fc9f78a97fe700c3e63368ed635c264847cfd886cefd361f8652"}},{"ruleId":"D2","level":"warning","message":{"text":"RecursiveDocumentSplitter._apply_overlap (cognitive 25): RecursiveDocumentSplitter._apply_overlap has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/recursive_splitter.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"28916bc35418220d525f93f7eab60fb5252e3f285b61f90b200c0460c3d77a48"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentMAPEvaluator.run (cognitive 24): DocumentMAPEvaluator.run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/document_map.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b6fca3ec40e3f603ddcfdd57b1269c1fa1b6ab3de1a9a1ea631332e369be2b"}},{"ruleId":"D2","level":"warning","message":{"text":"openai_responses._convert_response_to_chat_message (cognitive 24): openai_responses._convert_response_to_chat_message has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), error handling 1 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai_responses.py"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbe4538ad7f7200aca989b40fea7e13a2ad377b546b9f5d069ee3e9149b876f"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.print_streaming_chunk (cognitive 24): utils.print_streaming_chunk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/utils.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"356b229347110e5b639d1edd0de195f6dadcd84e516f44769ff8b8410bf063a8"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonCodeSplitter._extract_units (cognitive 24): PythonCodeSplitter._extract_units has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 8, loops 2 (4 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":"haystack/components/preprocessors/python_code_splitter.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a9228260369707916ce4fefad2a53b91961e5051a1a232f798bb074eb95fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"RecursiveDocumentSplitter._fall_back_to_fixed_chunking (cognitive 23): RecursiveDocumentSplitter._fall_back_to_fixed_chunking has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 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":"haystack/components/preprocessors/recursive_splitter.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"518f070be9b1a378e284037c73f82a6e7a9663ee17fabf953e34aa86f2c1569b"}},{"ruleId":"D2","level":"warning","message":{"text":"MetaFieldRanker.run (cognitive 23): MetaFieldRanker.run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4, ternaries 2, error handling 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/rankers/meta_field.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ba9eb90eb93ba2b6081f63e2b30c7c49789be4027f4e96d031f887148eeef3"}},{"ruleId":"D2","level":"warning","message":{"text":"serde_utils.deserialize_tools_or_toolset_inplace (cognitive 23): serde_utils.deserialize_tools_or_toolset_inplace has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/tools/serde_utils.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e38533ec649b6049afae8bfb663bb871d15b2508cfbbe2e20d13a413c4a012e"}},{"ruleId":"D2","level":"warning","message":{"text":"Agent.__init__ (cognitive 22): Agent.__init__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, loops 2, ternaries 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":"haystack/components/agents/agent.py"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ff2923c951114df1eab0e464bab6e029c1a3f91760cabbc34b8fa0008a5509"}},{"ruleId":"D2","level":"warning","message":{"text":"MSGToDocument._convert (cognitive 22): MSGToDocument._convert has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/msg.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1e535d5dffe3c4181217e5bb0846fb56a52105a07a57261fedbc5a38582bda"}},{"ruleId":"D2","level":"warning","message":{"text":"base_serialization._serialize_value_with_schema (cognitive 22): base_serialization._serialize_value_with_schema has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (4 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":"haystack/utils/base_serialization.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bd3a6783c7033c005bc7ad5a50ffc2862a3fa4e3e269fe9c34ee58e5dc9191"}},{"ruleId":"D2","level":"warning","message":{"text":"base_serialization._deserialize_value_with_schema (cognitive 22): base_serialization._deserialize_value_with_schema has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/base_serialization.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de0c9d2d979640cb6b981f274c337f59c20ed93408e4c0c3607c9c9b89c60c5"}},{"ruleId":"D2","level":"warning","message":{"text":"LostInTheMiddleRanker.run (cognitive 21): LostInTheMiddleRanker.run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/rankers/lost_in_the_middle.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c365d5977563c8b625dd95cd0d09152628fe07e73a17b6523c6d4c8115b261"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineBase._consume_component_inputs (cognitive 21): PipelineBase._consume_component_inputs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/base.py"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1bb70ff14e1510f69c072aebaaccfde07a82afce530b22a20240887f9d5fc67"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_calling._schedule_tool_calls (cognitive 20): tool_calling._schedule_tool_calls has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (6 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":"haystack/components/agents/tool_calling.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"44df99c68f2c3ddf5eafade4ba574b1e1a6422058db8030de7383d62287d7c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonCodeSplitter.run (cognitive 20): PythonCodeSplitter.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/python_code_splitter.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55d35aab4905ea9b36ede60fe81895402f5205d6d31a6442d5599240f341c5d"}},{"ruleId":"D2","level":"warning","message":{"text":"RecursiveDocumentSplitter._run_one (cognitive 20): RecursiveDocumentSplitter._run_one has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/recursive_splitter.py"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"441aa6f63724309a2d0af129d540d7aa3a35dbb5cda10208d243f5fefc30ab38"}},{"ruleId":"D2","level":"warning","message":{"text":"MetaFieldGroupingRanker.run (cognitive 20): MetaFieldGroupingRanker.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 1 (4 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/rankers/meta_field_grouping_ranker.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3af24c3f8bd308085bdcd9913ef9784829b2059f55e7f1cc2599d5b2e28de7"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentTypeRouter.run (cognitive 20): DocumentTypeRouter.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/document_type_router.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"baeb6396ee89cd5d8cc0a17ac8c678e91502daef73a5318bec5b8c566744b626"}},{"ruleId":"D2","level":"warning","message":{"text":"logging.configure_logging (cognitive 20): logging.configure_logging has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 2, error handling 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/logging.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be71bb97288ca3a429c22f415ebc4c2a44ff96a235f86977bac5c47c0984d9d"}},{"ruleId":"D2","level":"warning","message":{"text":"callable_serialization.deserialize_callable (cognitive 20): callable_serialization.deserialize_callable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/callable_serialization.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3222a121a5ecc0c9977b74c4de4cd1f4ca2db583bce4464f1371867ca2dacc5"}},{"ruleId":"D2","level":"warning","message":{"text":"check_imports.validate_module_imports (cognitive 19): check_imports.validate_module_imports has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 1 (4 pts), error handling 1 (3 pts), loops 2 (3 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":".github/utils/check_imports.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85bd3327a682ef2eb7d9c911fde6de85a3db1005f6cdc0c04d25b64536bb98e"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentMRREvaluator.run (cognitive 19): DocumentMRREvaluator.run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/document_mrr.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcec8e32e9676db8a679b8cb2e68bb74a8e06ec4b236f38b28ca36839f250a75"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonCodeSplitter._emit_class_units (cognitive 19): PythonCodeSplitter._emit_class_units has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/python_code_splitter.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"207ec75aaf8518dba0e165216305eb53f05efac2f9674d90fb668b12b7536032"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineBase.validate_input (cognitive 19): PipelineBase.validate_input has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/base.py"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"421eff41a01a90e7c82212f441e49e5a93a15d09f6bf72b345aa8c0a7bdbf6a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentTool.__init__ (cognitive 19): ComponentTool.__init__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/tools/component_tool.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d45a5545b7e65eff23b4995c6c8d10573de2ab38de0160d80e8bb76d5102bfb"}},{"ruleId":"D2","level":"warning","message":{"text":"tool_calling._run_tool_async (cognitive 18): tool_calling._run_tool_async has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 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":"haystack/components/agents/tool_calling.py"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a37b62f475c1f0e90b63051364b732e7bf411cf66e4ef6af8c2dd1dd6394d13"}},{"ruleId":"D2","level":"warning","message":{"text":"HTMLToDocument.run (cognitive 18): HTMLToDocument.run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 2 (4 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/html.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d64a4bbf504f41a4bc79789da2ced18d1441c6b546469b87f3d790036d1962"}},{"ruleId":"D2","level":"warning","message":{"text":"image_utils._extract_image_sources_info (cognitive 18): image_utils._extract_image_sources_info has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/image/image_utils.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd582d0373c79dc59442217c8041f20b460ad9826373e01cc0751b6227f1caf"}},{"ruleId":"D2","level":"warning","message":{"text":"RecursiveDocumentSplitter._apply_word_overlap (cognitive 18): RecursiveDocumentSplitter._apply_word_overlap has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/recursive_splitter.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"18638ada637eb1ebc5f2103bdd302cd652a3a2893cb2dc995010b536f083c30e"}},{"ruleId":"D2","level":"warning","message":{"text":"ConditionalRouter._output_matches_type (cognitive 18): ConditionalRouter._output_matches_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/conditional_router.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"954857968a4832bc89ca052a0b34619a4eeb903d7a3447dc6fd94fa301c52fac"}},{"ruleId":"D2","level":"warning","message":{"text":"InMemoryDocumentStore.bm25_retrieval (cognitive 18): InMemoryDocumentStore.bm25_retrieval has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/document_stores/in_memory/document_store.py"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"312c86ebd120e90b8f9ab7019f9c93476acd47d2216c9f5593a46a65ea292a62"}},{"ruleId":"D2","level":"warning","message":{"text":"from_function._remove_title_from_schema (cognitive 18): from_function._remove_title_from_schema has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 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":"haystack/tools/from_function.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e015dbddcd7173616fdcc96f9b0c0ca69c9d88a65a467c97887f2e88f135621"}},{"ruleId":"D2","level":"warning","message":{"text":"type_serialization.serialize_type (cognitive 18): type_serialization.serialize_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 3 (5 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/type_serialization.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"842911c63f7916bcd53cdb7f956757004a1f698f31b3222814473934ac641640"}},{"ruleId":"D2","level":"warning","message":{"text":"state._validate_schema (cognitive 17): state._validate_schema has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/agents/state/state.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"528452886df84cdbea88c4b7d73e53bdcfaed5c0654228cea93a64e9a44f6ba6"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIChatGenerator._prepare_api_call (cognitive 17): OpenAIChatGenerator._prepare_api_call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai.py"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ef7b74d162185dc9dd8d5c6c5c0d2d29198847f18dc8782f632123718e879c"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIResponsesChatGenerator._prepare_api_call (cognitive 17): OpenAIResponsesChatGenerator._prepare_api_call has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), boolean chains 2, ternaries 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":"haystack/components/generators/chat/openai_responses.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d7ae3a3642c596d9041e6f6e36df9d3c8c19cd103ac87ddc2004160dccc205"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownHeaderSplitter.run (cognitive 17): MarkdownHeaderSplitter.run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), 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":"haystack/components/preprocessors/markdown_header_splitter.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8270702ef72fbcf31bb2cf058e520dde7aacc4bee31926f763dc89ff2c21356"}},{"ruleId":"D2","level":"warning","message":{"text":"ConditionalRouter.__init__ (cognitive 17): ConditionalRouter.__init__ has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (8 pts), if/else 4 (5 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/conditional_router.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56c9df6a10a0a307c5c825c8f7b463078fd1060d596efd969e52f1ecf3241fc"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonSchemaValidator._recursive_json_to_object (cognitive 17): JsonSchemaValidator._recursive_json_to_object has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 1 (4 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/validators/json_schema.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"069f479764292409e4bd3d88480f76207b502ee1dcf85f696076857c54ec6f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineBase._prepare_component_input_data (cognitive 17): PipelineBase._prepare_component_input_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/base.py"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc25b6659ffbad34caad1e41eff76292cc4359a662bb7c7b74482919b5112366"}},{"ruleId":"D2","level":"warning","message":{"text":"InMemoryDocumentStore.write_documents (cognitive 17): InMemoryDocumentStore.write_documents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/document_stores/in_memory/document_store.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"10844cdde631da9b8483ff7e1b75d1e9fa68c58735fbf723f814604f583764c6"}},{"ruleId":"D2","level":"warning","message":{"text":"parameters_schema_utils._get_component_param_descriptions (cognitive 17): parameters_schema_utils._get_component_param_descriptions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (5 pts), error handling 1 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/tools/parameters_schema_utils.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed9cc7213628a81785cae749e8e8e81eadf8e811fad33565f3732d4cbc7a040"}},{"ruleId":"D2","level":"warning","message":{"text":"misc.expand_page_range (cognitive 17): misc.expand_page_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/misc.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e7a27338f12e51ba79e14410f9f60ddcdde89533694b571c445caa0b51176f"}},{"ruleId":"D2","level":"warning","message":{"text":"docs_search_sync.collect_docs_files (cognitive 16): docs_search_sync.collect_docs_files has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), ternaries 1 (5 pts), if/else 1 (3 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":".github/utils/docs_search_sync.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b272a03cc770b83634d33907eeaa1617d2cf8d3e6607f736ce37ddecb8d3e86f"}},{"ruleId":"D2","level":"warning","message":{"text":"agent._validate_hooks (cognitive 16): agent._validate_hooks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/agents/agent.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ad5c5752112bfa5271f287c983585fe0759aacdde39c21cad02b99c9132166"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._select_tools_by_name (cognitive 16): utils._select_tools_by_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (3 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/agents/utils.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"951dd05ee55c44a0cdfa17f7bed25c087b2329f6da7732cf86b894862ebd2b5e"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIDecisionsDocumentClassifier.__init__ (cognitive 16): OpenAIDecisionsDocumentClassifier.__init__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 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":"haystack/components/classifiers/openai_decisions_document_classifier.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52a0c9adbc4c219dac315d4b68d58a78f123014474f8a5ebb40055d0348ae73"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageFileToImageContent.run (cognitive 16): ImageFileToImageContent.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/image/file_to_image.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"44179b23a4b2f998f2e1bf4c97e605aca9b9fffaa2c654bd6887ec81eb6b4ce1"}},{"ruleId":"D2","level":"warning","message":{"text":"LLMEvaluator.run_async (cognitive 16): LLMEvaluator.run_async has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/llm_evaluator.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f4290c986e2aa752bab5566b22f04e42c2ebb6422d90ddbb24afc26d2a83c8"}},{"ruleId":"D2","level":"warning","message":{"text":"CSVDocumentSplitter.run (cognitive 16): CSVDocumentSplitter.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/csv_document_splitter.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53da18f30d23401ba97cc49581df3be29e69877c0e9bf92ab6f9ff1c39d7740"}},{"ruleId":"D2","level":"warning","message":{"text":"HierarchicalDocumentSplitter.build_hierarchy_from_doc (cognitive 16): HierarchicalDocumentSplitter.build_hierarchy_from_doc has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), ternaries 2 (6 pts), if/else 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/hierarchical_document_splitter.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5295040d002e37fac1cef5d1eb78d1d2555c3af88cedadb34cd847721294c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"_SuperComponent._resolve_input_types_from_mapping (cognitive 16): _SuperComponent._resolve_input_types_from_mapping has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/super_component/super_component.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"920822b366ac53ce5b512b9f938d31f9c17bcf809892ac0c57f74677bc864f21"}},{"ruleId":"D2","level":"warning","message":{"text":"streaming_chunk.select_streaming_callback (cognitive 16): streaming_chunk.select_streaming_callback has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/dataclasses/streaming_chunk.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c45a2eb550cf3b17f8718dc1107319481d5dd7aa4df5212e5874e4d9351d40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pipeline/base.py: FileTooLong \u2014 970 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 470 over it, 1.94\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":"haystack/core/pipeline/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc59b13b5cd565125c8e7feacc0504c0c04798a1df9027b9a4d4027107a3860"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PipelineBase: 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":"haystack/core/pipeline/base.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7da815a9394e4d9830c3b59dc8ccbc8601cd10adb8605cc9d3d7504635ad13a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: testing/document_store.py: FileTooLong \u2014 830 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 330 over it, 1.66\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":"haystack/testing/document_store.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6eafcbb0b9e0edfb8a04e72f2ff684dccb94762b0d36b09a99eb2be030f644"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InMemoryDocumentStore: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/document_stores/in_memory/document_store.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa163a6efe1ee3d04a543920a2665646fb2cb928a25dfa750c78d229e217ffa9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chat/openai_responses.py: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 179 over it, 1.36\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":"haystack/components/generators/chat/openai_responses.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"946df521a63fb71c9b95c551e63302a14a7e40fafbccc3e4bd99beb7dc16175d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FilterDocumentsTest: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b5cbc3c9809eceb46f4883e69818a6bf93762a1772b2f15c0318f51ccf1871"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: in_memory/document_store.py: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/document_stores/in_memory/document_store.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d350099895d0ae66c126311c233b91c25b3ecc04a0f05d3305b9fa9ff89b8d29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/agent.py: FileTooLong \u2014 618 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 118 over it, 1.24\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":"haystack/components/agents/agent.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81b5e6d2aa0e70f41dd9fb3b0cbda96bb5b3f28821e501e761386228ca09a26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pipeline/pipeline.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":"haystack/core/pipeline/pipeline.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b81276a1cf4e5d1d2162755790c4a1e99dbfe2eb4ee7e287088dfd932aee475"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: testing/document_store_async.py: FileTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 53 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store_async.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"836551a793388a733225e15f2081df14ba5806377f63804d136ba0edad2d788e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataclasses/chat_message.py: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/dataclasses/chat_message.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b09e7795da531342cccb8c8c31c8258439bfbd61468111f818b4674ba32d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (32 shared lines): haystack/components/agents/agent.py:1071-1136 | haystack/components/agents/agent.py:1139-1206 \u2014 These two members are variants of one another: 32 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/agents/agent.py"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c9aeb0a569c201cdfefb947edd423ed6253895139732fa52a3bb9e8167625e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): haystack/components/evaluators/document_map.py:63-82 | haystack/components/evaluators/document_mrr.py:61-80 | haystack/components/evaluators/document_ndcg.py:54-73 | haystack/components/evaluators/document_recall.py:96-115 \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":"haystack/components/evaluators/document_map.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cd0c16998a95d426c8ba74d52095ae6b3ea4087673eee12dc9cd18ef3a108e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): haystack/testing/document_store.py:312-325 | haystack/testing/document_store.py:357-370 | haystack/testing/document_store.py:402-415 | haystack/testing/document_store.py:447-460 \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":"haystack/testing/document_store.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c52d8733b469f8a210c9ad9391a9f5778396a782b5f2529c2fc6571bc83f9f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): haystack/components/query/query_expander.py:202-273 | haystack/components/query/query_expander.py:277-352 \u2014 These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/query/query_expander.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"473fbb6d5966aeb1a0565179dda5be66a97e40834e8aeeb28a8a4ce681045ed6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): haystack/components/evaluators/llm_evaluator.py:229-296 | haystack/components/evaluators/llm_evaluator.py:300-380 \u2014 These two members are one piece of code written twice and then edited apart: 68 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/llm_evaluator.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6307baffc7c2308754475e7f1482259bf6a88e3b6dc3347ab0788b5ba1649c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): haystack/components/retrievers/auto_merging_retriever.py:134-194 | haystack/components/retrievers/auto_merging_retriever.py:198-261 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/auto_merging_retriever.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"388cbc3f931cb2b4547e8ca7f5148673161eee9805b70ea5cee3ec67f762145c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): haystack/components/agents/tool_calling.py:548-628 | haystack/components/agents/tool_calling.py:641-730 \u2014 These two members are one piece of code written twice and then edited apart: 81 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/agents/tool_calling.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3f9a82ab252b4e146f3936bd7ae66e60dc86a1b77f97d1fdae83c7f1f8c4ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): haystack/components/embedders/openai_document_embedder.py:250-287 | haystack/components/embedders/openai_document_embedder.py:292-332 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/openai_document_embedder.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd18b2055eca3fefa134fae4e92eebab90c2fecf9ed6b4b71e61e1d7c60b771"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): haystack/components/agents/agent.py:892-972 | haystack/components/agents/agent.py:984-1068 \u2014 These two members are one piece of code written twice and then edited apart: 81 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/agents/agent.py"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61602c63f03960f578077c02bdae0b5e9036538552782a03729e02ed7d0e119"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 49\u002B corresponding lines): haystack/document_stores/in_memory/document_store.py:260-308 | haystack/document_stores/in_memory/document_store.py:311-366 | haystack/document_stores/in_memory/document_store.py:369-420 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 49 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/document_stores/in_memory/document_store.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de0dfb0032c960d49c5878a873de8dfb26055725d345e3b93bf6b7959eae4a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): haystack/components/rankers/llm_ranker.py:242-308 | haystack/components/rankers/llm_ranker.py:314-384 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/rankers/llm_ranker.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9a2ef8f5794063c9603ab035d9be03a811c9baa4982487b09154883b43bd2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): haystack/hooks/human_in_the_loop/strategies.py:416-473 | haystack/hooks/human_in_the_loop/strategies.py:482-543 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/human_in_the_loop/strategies.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b0c1bef04b9ade9bd75582d3681bf4445c840a72709aac792082b811501a64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): haystack/core/pipeline/pipeline.py:136-197 | haystack/core/pipeline/pipeline.py:552-612 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/pipeline.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b7a493bbe56eb6fabbbe66a5f6e4f99997d6a482b49cbb184b6d3603d89b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): haystack/components/generators/chat/azure_responses.py:194-249 | haystack/components/generators/chat/openai_responses.py:316-362 \u2014 These two members are one piece of code written twice and then edited apart: 47 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/azure_responses.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"028bdadd910988bc3c75042325fb3c8e54f5c4b29383f1b0c647f38982f2ba5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): haystack/testing/document_store.py:807-832 | haystack/testing/document_store.py:849-878 | haystack/testing/document_store_async.py:433-457 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed43bb0f5c2dce85ffc2a6a2d28676e1f912fbb7a456b2e3d4123473affd725a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): haystack/components/converters/docx.py:207-255 | haystack/components/converters/html.py:94-156 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/docx.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"24765e92ceb825b4da1b7ec87023c0a01fe6ba477b69c1ae31baec4430ccd867"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): haystack/components/routers/llm_messages_router.py:130-172 | haystack/components/routers/llm_messages_router.py:175-221 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/llm_messages_router.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29bb35f6bafe9450da81fef7f2b7c777036c7df738be777071e3ab68e01ea4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): haystack/components/generators/chat/fallback.py:159-206 | haystack/components/generators/chat/fallback.py:216-263 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/fallback.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5e373569ab44a1c50a6862d4e1c577815ce82c936ce00f02481b944982872f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): haystack/components/evaluators/document_map.py:98-159 | haystack/components/evaluators/document_mrr.py:96-148 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/document_map.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb7fa6fb9dc750dbb2f09af14abd5f86d651d4a47c511c42e74c5e82df8287d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): haystack/components/extractors/image/llm_document_content_extractor.py:425-472 | haystack/components/extractors/llm_metadata_extractor.py:438-499 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/extractors/image/llm_document_content_extractor.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8037c0208f6f1314e0c8c0b2919425a9a5ac6a7027097ae67edf7441df14ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): haystack/components/converters/pptx.py:163-203 | haystack/components/converters/txt.py:59-101 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/pptx.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"250f6058cf6c1915177e352cd52cc78a90b029a23e12201498870b5d66e9b89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): haystack/utils/requests_utils.py:20-89 | haystack/utils/requests_utils.py:95-201 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/requests_utils.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db7e1ecb8ee09eedb6367859aa127e641dfb4f62f4c95f178e9a096e7b7f22c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 64\u002B corresponding lines): haystack/components/generators/chat/openai.py:372-438 | haystack/components/generators/chat/openai.py:450-521 | haystack/components/generators/chat/openai_responses.py:404-467 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 64 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b9ccc38396fc489c63f0659a80653e8ac032101b038923098e0651974a6278"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): haystack/components/converters/json.py:273-309 | haystack/components/converters/xlsx.py:115-163 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/json.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b42a6d17aaddc7cc01f94eb7b29a8a687916313e51833b36caf9c044650e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): haystack/core/pipeline/pipeline.py:685-739 | haystack/core/pipeline/pipeline.py:755-805 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/pipeline.py"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"086ebdb66deebdb75941d5ffbb1896e4ee7c684a44dc4dc0c87827f11c85beb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): haystack/components/extractors/image/llm_document_content_extractor.py:290-321 | haystack/components/extractors/image/llm_document_content_extractor.py:326-357 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/extractors/image/llm_document_content_extractor.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fe36a9c0208d3dad1f48894ef7f4fef63c5a5d3f18a2b643e28c04182949cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): haystack/components/agents/tool_calling.py:210-239 | haystack/components/agents/tool_calling.py:251-280 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/agents/tool_calling.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fa9d4ba9764c5929f8dff0efdb95339d1a14b47538fdd173dddde6817db042"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): haystack/hooks/compaction/summarization.py:245-279 | haystack/hooks/compaction/summarization.py:284-318 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/compaction/summarization.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a53919f88eeb5ae32f7fc5267ed51cfde3a593bc133d9e9510188578778bda8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): haystack/components/classifiers/openai_decisions_document_classifier.py:236-259 | haystack/components/classifiers/openai_decisions_document_classifier.py:264-290 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/classifiers/openai_decisions_document_classifier.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2c119a4fc94f401742a0f91f7d1b47f03807c0e0d6fffffe0ec462b26191ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): haystack/testing/document_store.py:1270-1286 | haystack/testing/document_store_async.py:783-799 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e059b493184ee04445305eea944fd5c3fc0c95864c36eee2bb3c785b7c76535"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): haystack/components/extractors/image/llm_document_content_extractor.py:389-421 | haystack/components/extractors/llm_metadata_extractor.py:379-434 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/extractors/image/llm_document_content_extractor.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdedf6233443796b14069e05126679401cf89e1b5a596894e784fcb50072ac55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): haystack/components/generators/chat/azure_responses.py:253-283 | haystack/components/generators/chat/openai_responses.py:366-392 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/azure_responses.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"149ead4663a91fdf2c932346c348d9d633df0bf9c1e8c3d2349dc0b21e91e413"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): haystack/components/extractors/llm_metadata_extractor.py:309-327 | haystack/components/extractors/llm_metadata_extractor.py:332-350 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/extractors/llm_metadata_extractor.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc956f000f385a4f2a9b3323a0aad9b9ccf89eaaf6bfe18fc9f99b403e738f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): haystack/components/embedders/openai_document_embedder.py:336-366 | haystack/components/embedders/openai_document_embedder.py:370-402 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/openai_document_embedder.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"72001f58882efa77b996b484886c2fe3590a55b11527b1f92ba5f3347059a19e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): haystack/hooks/compaction/hooks.py:132-155 | haystack/hooks/compaction/hooks.py:158-181 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/compaction/hooks.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae9d0f7dbc7402f86a7db664d1c5131287545198020cf76eabf8935ce580413"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): haystack/components/joiners/answer_joiner.py:121-165 | haystack/components/joiners/document_joiner.py:169-205 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/joiners/answer_joiner.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d8904ede99f534f6dc2a1ee3ee670aeb6f53c3c64f204cd0966a2cec72450a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): haystack/components/generators/openai_image_generator.py:153-181 | haystack/components/generators/openai_image_generator.py:191-224 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/openai_image_generator.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7f23ab8059d63e156d6de1c201b0b75d5cc10e50f22b857d935c059401c68e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): haystack/components/preprocessors/embedding_based_document_splitter.py:174-210 | haystack/components/preprocessors/embedding_based_document_splitter.py:214-251 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/embedding_based_document_splitter.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"24497cf20bb7843d0ebc9d79e73b4229c7c072d3c6a07f3f743154ac53c91e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): haystack/hooks/human_in_the_loop/user_interfaces.py:87-111 | haystack/hooks/human_in_the_loop/user_interfaces.py:184-213 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/human_in_the_loop/user_interfaces.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdb85a9de189f0e34d464a3dde143ff3c2198809c5e3e96dceefec3f7b05ed8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): haystack/components/embedders/azure_document_embedder.py:216-246 | haystack/components/embedders/azure_text_embedder.py:192-217 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/azure_document_embedder.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8870905328872e76e3b24776a486db4e29a2a38f1e0ae0ac3e97d7555a4df1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): haystack/components/joiners/document_joiner.py:222-238 | haystack/utils/misc.py:178-207 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/joiners/document_joiner.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a8408bc251a5ea654e63bd05fb33d15e929e3e42c6eb431718ef29afde66f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): haystack/testing/document_store.py:667-685 | haystack/testing/document_store.py:689-711 | haystack/testing/document_store_async.py:98-116 | haystack/testing/document_store_async.py:121-143 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"7832a340038335e5d4cd765d6e018603b07cf0e84c5520cc4f76fe4b1cb1263b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): haystack/components/evaluators/context_relevance.py:113-164 | haystack/components/evaluators/faithfulness.py:98-153 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/context_relevance.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81159d78285829cc79b25873ddd7930ea10ba260e7fb2ba3c841e30bb3a897e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): haystack/logging.py:162-190 | haystack/logging.py:194-220 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/logging.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"95afd934ee9090d80cecd29c559c20580af414419f99b97b7822d76da5123c5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): haystack/dataclasses/byte_stream.py:83-92 | haystack/dataclasses/file_content.py:68-79 | haystack/dataclasses/image_content.py:110-121 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/dataclasses/byte_stream.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a744b70697fbd0c4a3ce933b94becc9032fc81cde61582e74113a8b69f0044b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): haystack/testing/document_store.py:1331-1360 | haystack/testing/document_store_async.py:848-877 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ee26eb6dc5b97b29ebb78a346774fe7ea3b4036fea8af31c449623e8a2ae9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): haystack/document_stores/types/filter_policy.py:166-220 | haystack/document_stores/types/filter_policy.py:228-278 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/document_stores/types/filter_policy.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e1601461f699635067704561cb9b98052a04fde79ec37a539609289fdc8de7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): haystack/hooks/human_in_the_loop/hooks.py:93-111 | haystack/hooks/human_in_the_loop/hooks.py:114-125 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/human_in_the_loop/hooks.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b12fbda3ef603a26ab957315088d623a34ec8a87e5b08084b9d91580ca09ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): haystack/components/preprocessors/embedding_based_document_splitter.py:464-498 | haystack/components/preprocessors/embedding_based_document_splitter.py:501-533 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/embedding_based_document_splitter.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe164a1adcf8fd6050dc1e8f1b49829b2876d50f4148ddf8c7554ce1e0e96af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): haystack/hooks/backup_answer/hooks.py:141-161 | haystack/hooks/backup_answer/hooks.py:164-186 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/backup_answer/hooks.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"24eaa5109e91e467e767f45e78b8fccfeaf3846ab9addd78d3da116a2dfdb067"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): haystack/testing/document_store.py:117-124 | haystack/testing/document_store_async.py:508-515 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac856eda1a3b97289b34d6c720ae1f4eb2b277f08e47151f222a125f547df18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): haystack/testing/document_store.py:721-741 | haystack/testing/document_store.py:761-797 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9eda361563714ef2590e9f9f7d2dca55c5fbb59dd2507e8966af442d450c172"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): haystack/components/routers/openai_decisions_image_router.py:189-200 | haystack/components/routers/openai_decisions_text_router.py:162-183 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/openai_decisions_image_router.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d500fefaec66db922580cda0915bda75430b047e57085f8802fe40de04725177"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 29\u002B corresponding lines): haystack/components/retrievers/in_memory/bm25_retriever.py:128-156 | haystack/components/retrievers/in_memory/bm25_retriever.py:166-196 | haystack/components/retrievers/in_memory/embedding_retriever.py:145-185 | haystack/components/retrievers/in_memory/embedding_retriever.py:196-236 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/in_memory/bm25_retriever.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce65478a1728df5baf042d11b6197661325c1e1fac12be75ae54c1ddaff0c9ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): haystack/components/generators/chat/mock.py:337-367 | haystack/components/generators/chat/mock.py:379-411 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/mock.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70120ee18ca0a293043690d4367758e1961ef88886d5905762d38e5a467d1b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): haystack/components/retrievers/text_embedding_retriever.py:112-130 | haystack/components/retrievers/text_embedding_retriever.py:136-158 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/text_embedding_retriever.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a393dc0e22f92d1ae8f5b3b1fed27027ec462c9715abe729141cb21e1898bf15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): haystack/components/generators/chat/azure.py:247-268 | haystack/components/generators/chat/openai_responses.py:250-261 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/azure.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e60a8f7b547754d3792cb6ce5ec4e5aa9e390baa27aaadf0a44ad70132c26ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): haystack/testing/document_store.py:625-640 | haystack/testing/document_store_async.py:67-82 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"439b53252a15a099a8929facf44f2cfe4457e5c6aef51f1f5cd7542a4b1e0df6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): haystack/utils/type_serialization.py:137-156 | haystack/utils/type_serialization.py:160-187 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/type_serialization.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa637b6d9907d123961be2a0fb6cf8939741fa86b79d0f98f231e391b849a618"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): haystack/components/generators/chat/openai.py:623-632 | haystack/components/generators/chat/openai.py:637-655 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai.py"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"b161226b7ce187e0a74826e5d9d4405238158abc49e0aca198d2903df091b0c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): haystack/core/super_component/super_component.py:124-141 | haystack/core/super_component/super_component.py:148-167 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/super_component/super_component.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25ecbb9aedca21b578b135f169f58bf017559f93c3706ca8967def1d623fdce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): haystack/dataclasses/file_content.py:47-65 | haystack/dataclasses/image_content.py:86-107 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/dataclasses/file_content.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"263e76ace77fccd310a7acdc02d0c58241e37d772be5140eb2a71120bcef8025"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): haystack/testing/document_store_async.py:345-363 | haystack/testing/document_store_async.py:386-420 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store_async.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f0f7f6f1a8eaf353b44c3bb60d4c6d033848bc6f91f74e169334829924885b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): haystack/testing/document_store.py:987-995 | haystack/testing/document_store_async.py:234-242 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"599cc07e35abd12398a6b249befad23d71dcd696080c737a120a89d0f5abf7a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): haystack/core/pipeline/base.py:1067-1082 | haystack/core/pipeline/base.py:1097-1109 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/base.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd163d3c0b0c4974b9d030d3ce98ea0a65128e88180b2bc40052d3c96a94f5dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): haystack/components/caching/cache_checker.py:77-97 | haystack/components/caching/cache_checker.py:101-121 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/caching/cache_checker.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"30af51d50631bff2cf1c097d9f911a18f0cb47b271939c867b3260bc48878da1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): haystack/components/retrievers/sentence_window_retriever.py:179-208 | haystack/components/retrievers/sentence_window_retriever.py:212-244 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/sentence_window_retriever.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4b9b3fa8f5cc112ce273827ae5fc6b2ac047beac9abfaab13f604709244a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): haystack/hooks/human_in_the_loop/strategies.py:324-359 | haystack/hooks/human_in_the_loop/strategies.py:370-407 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/human_in_the_loop/strategies.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaabb3af7a84e962b5dd881b1367146122f6ac5f5741ccd39830765930bde00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): haystack/testing/document_store.py:942-960 | haystack/testing/document_store_async.py:187-205 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b47e49aeda0444d8bdeeb13fabb3a308734b5d379627cd0e0fcc74a8dbfe95e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): haystack/components/converters/docx.py:460-478 | haystack/components/converters/pptx.py:112-129 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/docx.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bfaf155958bff549335502fcadf21e9e343f936d02de885d7759a8bffb59df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): haystack/testing/document_store.py:1179-1200 | haystack/testing/document_store_async.py:684-705 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1d04017dc1eddc289be335ea392cfdc75b7c63a649009d9906dfa3833a0e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): haystack/testing/document_store.py:102-107 | haystack/testing/document_store_async.py:491-496 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"147548e5534c22a13eb51978c058e802e3778c6c8f787bb2b550b0c97165aa4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): haystack/components/embedders/mock_document_embedder.py:136-144 | haystack/components/embedders/openai_document_embedder.py:232-245 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/openai_document_embedder.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a2f447106eec984bdf2622587ed3018c5064d0df6431f314e891deda6a8c07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): haystack/components/generators/chat/openai_responses.py:639-649 | haystack/components/generators/chat/openai_responses.py:654-663 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai_responses.py"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"c657d6cec30bb5570b146ee138121a9b1a90873d2741ed2e13c52ba80a8de3af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): haystack/testing/document_store.py:1214-1230 | haystack/testing/document_store_async.py:720-738 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c63de1986c4af4a2470ac37c1cab254385492e5d09be73b9f98c48ac4866275"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): haystack/testing/document_store.py:1035-1050 | haystack/testing/document_store_async.py:285-300 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb711300d541f5bc1b69a2f9a1d4818a87bd899735507ac5d151637576d31898"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): haystack/testing/document_store.py:1086-1102 | haystack/testing/document_store_async.py:585-601 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"258d71a75e812e194e23a73b2424d852bf08224ad8e2a02a3787a69880699f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 6\u002B corresponding lines): haystack/testing/document_store.py:304-309 | haystack/testing/document_store.py:349-354 | haystack/testing/document_store.py:394-399 | haystack/testing/document_store.py:439-444 | haystack/testing/document_store.py:484-489 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dea589f9411926bb33429429eb2f27d0be9cecc528c1eda516bf4a40c270c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): haystack/components/retrievers/in_memory/embedding_retriever.py:60-96 | haystack/components/retrievers/in_memory/bm25_retriever.py:49-81 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/in_memory/embedding_retriever.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"88950c06315c57cca4350dbbcbfb8c2d45a2260d61396b270342a4945cd62e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): haystack/components/routers/openai_decisions_image_router.py:203-223 | haystack/components/routers/openai_decisions_image_router.py:226-248 | haystack/components/routers/openai_decisions_text_router.py:186-204 | haystack/components/routers/openai_decisions_text_router.py:207-227 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/openai_decisions_image_router.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dad91c43eb4ed96f9eab7082aad710fd56e4e51069d239aeeb298464eb20b86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): haystack/document_stores/in_memory/document_store.py:626-645 | haystack/document_stores/in_memory/document_store.py:649-667 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/document_stores/in_memory/document_store.py"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"051606c3155d7acfe5c3571d2ce1da536ab869d3ac65f3450586f88f83fb7c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): haystack/testing/document_store.py:1364-1378 | haystack/testing/document_store_async.py:882-896 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"131a0cf2b2c9db13626d687e44c1db8e6429b5a052a6e3942a833a69df25733c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): haystack/testing/document_store.py:1017-1031 | haystack/testing/document_store_async.py:266-280 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ed9049164ab02114493c897d20bfd5de20898047a7d417e3f23c219121bcd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): haystack/components/converters/pypdf.py:39-47 | haystack/components/evaluators/document_recall.py:30-38 | haystack/dataclasses/chat_message.py:44-52 | haystack/document_stores/types/filter_policy.py:31-42 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/pypdf.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f159c46ccf0589e634dc3a3fe228e37362d1dd9f98ae530120a9e7440fa9f74c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): haystack/testing/document_store.py:278-281 | haystack/testing/document_store_async.py:920-925 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"201912f286b03b99faa5d2580df9a6341406d604c306baad01a6cc9426afae56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): haystack/testing/document_store.py:528-541 | haystack/testing/document_store_async.py:929-942 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"534aab3bd8f048ae4fb732efba1a3e342c2ec8068e139236da317c0e0ad9501f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): haystack/testing/document_store.py:1313-1327 | haystack/testing/document_store_async.py:829-843 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"e351e500f9189d9a99be98f7dc73faaf05fccf341bccf5ea9d48abde34437ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): haystack/testing/document_store.py:1141-1155 | haystack/testing/document_store_async.py:643-657 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3386a130a82d0c8ab41e078d02479ffd0dd2f9dd02dfd24dbf37d49e27071ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): haystack/components/embedders/openai_text_embedder.py:165-183 | haystack/components/generators/openai_image_generator.py:227-244 | haystack/token_counters/openai_counter.py:129-143 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/openai_text_embedder.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4113cde7b5135b74a356e5ec1b94c74d1b6ee21b4a1979d967630d38e73d82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): haystack/hooks/human_in_the_loop/strategies.py:212-231 | haystack/hooks/tool_result_offloading/hooks.py:203-217 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/human_in_the_loop/strategies.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9573459c26b9bff1c913f8b607634e2a473cd028511b142c945c94116c52377"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): haystack/hooks/compaction/tool_result_offloading.py:107-123 | haystack/hooks/compaction/tool_result_pruning.py:85-105 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/compaction/tool_result_offloading.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa01167a8ceebcdb5022c0c3d169a37a896f939593678befc507cb27f2877bf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): haystack/testing/document_store.py:1054-1074 | haystack/testing/document_store_async.py:305-326 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3ba38b1e49663bf7aef102126cb9af94f3c5a0a9411562915c13e6e2a7236e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): haystack/components/embedders/mock_document_embedder.py:124-129 | haystack/components/embedders/mock_text_embedder.py:107-112 | haystack/components/generators/chat/openai.py:347-360 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c5871c68926cc8cdfdcfc4f4cff2496b11da13c01a07b1e2e1f1544a8c6c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): haystack/components/retrievers/in_memory/bm25_retriever.py:90-103 | haystack/components/retrievers/in_memory/embedding_retriever.py:105-119 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/in_memory/bm25_retriever.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"af06dc5adfc82339a075a015d098911d3641768501f2e88211571f8e79c48dc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): haystack/hooks/compaction/summarization.py:507-511 | haystack/hooks/compaction/tool_result_offloading.py:201-210 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/compaction/summarization.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"157b245cc6faa6dc4ef0e1d21478e9d8a5ed22628a95d8ae7dd7e0fcabfca0b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): haystack/hooks/human_in_the_loop/strategies.py:661-675 | haystack/hooks/tool_result_offloading/hooks.py:45-59 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/human_in_the_loop/strategies.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"a649b40a5d041b8bd7273e58c814e654cc43cf8013bfe64418f4cca1307e902f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): haystack/components/retrievers/multi_query_embedding_retriever.py:228-239 | haystack/components/retrievers/text_embedding_retriever.py:161-171 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/multi_query_embedding_retriever.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b33cdbccc148b1bf9f8b074fea6b73472f7865d42af64bc47280e1b6641c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 6\u002B corresponding lines): haystack/components/extractors/llm_metadata_extractor.py:212-219 | haystack/components/generators/chat/fallback.py:96-101 | haystack/components/retrievers/multi_query_embedding_retriever.py:103-110 | haystack/components/retrievers/multi_retriever.py:202-209 | haystack/components/retrievers/text_embedding_retriever.py:81-88 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/extractors/llm_metadata_extractor.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a08c720ced4bc3e02eaa272da11c3ffa16c11d82d884de9744d60efb2cd6e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 6\u002B corresponding lines): haystack/components/extractors/llm_metadata_extractor.py:230-237 | haystack/components/generators/chat/fallback.py:110-115 | haystack/components/retrievers/multi_query_embedding_retriever.py:121-128 | haystack/components/retrievers/multi_retriever.py:220-227 | haystack/components/retrievers/text_embedding_retriever.py:99-106 | haystack/hooks/compaction/hooks.py:305-310 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/extractors/llm_metadata_extractor.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fb867d567fdc659f755ff842e79d108c10cbca6dec5952c462f75fd6087ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): haystack/components/joiners/branch.py:114-124 | haystack/components/routers/metadata_router.py:169-181 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/joiners/branch.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0272a978bd2c6d23436e4e23a32fd19270fb407fdc1d0bbb711253139e8400"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): haystack/testing/document_store.py:66-70 | haystack/testing/document_store_async.py:170-174 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2395c6d5d10728956aa014e9aaeb80c5283ab9d785a14761e526104d5b12fed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): haystack/testing/document_store.py:999-1005 | haystack/testing/document_store_async.py:247-253 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e0e099835bd341b4fa874f00f7750fe4fc0119fa6c25ac83d2340ff2853dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (86\u2013101 lines \u00D7 2): haystack/components/generators/chat/openai.py:148-233 | haystack/components/generators/chat/openai_responses.py:144-244 \u2014 before extracting anything, compare \u0060haystack/components/generators/chat/openai.py\u0060 and \u0060haystack/components/generators/chat/openai_responses.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060haystack/components/generators/chat/openai.py:148\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060haystack/components/generators/chat/openai.py:235\u0060 calls \u0060_check_duplicate_tool_names\u0060, \u0060flatten_tools_or_toolsets\u0060 and \u0060haystack/components/generators/chat/openai_responses.py:246\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8b14233c37db8875ce027e7f29133a7581f2a9f502cf47595c1034ebb498ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55\u201392 lines \u00D7 2): haystack/utils/requests_utils.py:20-74 | haystack/utils/requests_utils.py:95-186 \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":"haystack/utils/requests_utils.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7560c3d1ddb6a555e26a29d3027c09b6a1eafdfa7070fd175507d522b53d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 2): haystack/components/routers/openai_decisions_image_router.py:69-132 | haystack/components/routers/openai_decisions_text_router.py:61-124 \u2014 before extracting anything, compare \u0060haystack/components/routers/openai_decisions_image_router.py\u0060 and \u0060haystack/components/routers/openai_decisions_text_router.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/openai_decisions_image_router.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f84f606511ac64217e3b93695c2272a983afded09ad06a93526e22494a9e582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52\u201354 lines \u00D7 2): haystack/hooks/human_in_the_loop/strategies.py:416-467 | haystack/hooks/human_in_the_loop/strategies.py:482-535 \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":"haystack/hooks/human_in_the_loop/strategies.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e62b089462933e4578449c91e0a3edf84e5343468d79ab3f06dcd4776b75d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): haystack/components/query/query_expander.py:233-273 | haystack/components/query/query_expander.py:312-352 \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":"haystack/components/query/query_expander.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9098fc46462958348ff484809bcb6601e112e62b83e8c40f5fc9f012dd07d8da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201337 lines \u00D7 2): haystack/components/rankers/llm_ranker.py:242-274 | haystack/components/rankers/llm_ranker.py:314-350 \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":"haystack/components/rankers/llm_ranker.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee09288def28b1100c4042c6df675c46c2586011e48be7d89f3a5a1e7099a525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): haystack/components/evaluators/llm_evaluator.py:263-296 | haystack/components/evaluators/llm_evaluator.py:347-380 \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":"haystack/components/evaluators/llm_evaluator.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d16e0d09b90a9334322c8518314ed7f34bc795844edfd918156fe010060096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): haystack/components/agents/tool_calling.py:548-578 | haystack/components/agents/tool_calling.py:641-671 \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":"haystack/components/agents/tool_calling.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7f4a17b6b9aec93299a169455bcf6b42cd184bed11d84a10b4cf6ed000ade1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): haystack/components/retrievers/in_memory/embedding_retriever.py:145-175 | haystack/components/retrievers/in_memory/embedding_retriever.py:196-226 \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":"haystack/components/retrievers/in_memory/embedding_retriever.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccada71a52ca75878e8feacf0651c7de102a0f8fb40d3361e29cbaeaaba6a73f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): haystack/core/pipeline/pipeline.py:170-197 | haystack/core/pipeline/pipeline.py:587-612 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/pipeline.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"8327b5a0a4fe0cdc462caca44e85e570bacb4b8c23cc260335b26a9ffa4dddea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): haystack/components/evaluators/document_map.py:98-124 | haystack/components/evaluators/document_mrr.py:96-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/document_map.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"659d667ba9895073651ae8ccc5dcc3784e6eea0f477a0d498f9c9790e4938c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201327 lines \u00D7 2): haystack/components/generators/chat/azure_responses.py:213-236 | haystack/components/generators/chat/openai_responses.py:323-349 \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 \u0060haystack/components/generators/chat/azure_responses.py:213\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/azure_responses.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ef15207964ee52994f79397b33f4cdff01ef567b84ea60513c0018f09bee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): haystack/components/retrievers/multi_query_embedding_retriever.py:162-190 | haystack/components/retrievers/multi_query_text_retriever.py:140-168 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/multi_query_embedding_retriever.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"308c32a2ad0b87fb267a1139ff33a5da3a4b5208620bb01699263e47edcc2a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): haystack/components/rankers/llm_ranker.py:284-308 | haystack/components/rankers/llm_ranker.py:360-384 \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":"haystack/components/rankers/llm_ranker.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f667fc4dc4e9bf488337773c5e9145442a57a959a0bec054d64b74b474b7bbbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): haystack/components/retrievers/multi_query_embedding_retriever.py:132-156 | haystack/components/retrievers/multi_query_text_retriever.py:110-134 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/multi_query_embedding_retriever.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3217ebc209a17e6651f6aa35920d867c002bf17326b63e3a0354ebfc587ac5c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): haystack/components/generators/chat/fallback.py:183-206 | haystack/components/generators/chat/fallback.py:240-263 \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":"haystack/components/generators/chat/fallback.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d046787a74b6ac3a30d2eeccd7eb90c14a5dc22e113ed1f0d4eecab7f921a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): haystack/document_stores/in_memory/document_store.py:260-280 | haystack/document_stores/in_memory/document_store.py:369-392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/document_stores/in_memory/document_store.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"67199fc241c9d964452e010360b22db4242f4a2e4adc62c1c3e64b598b49a4e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 6): haystack/components/converters/image/file_to_document.py:60-87 | haystack/components/converters/pdfminer.py:263-287 | haystack/components/converters/pptx.py:163-186 | haystack/components/converters/pypdf.py:239-261 | haystack/components/converters/txt.py:59-82 | haystack/components/converters/xlsx.py:115-138 \u2014 before extracting anything, compare \u0060haystack/components/converters/image/file_to_document.py\u0060 and \u0060haystack/components/converters/pptx.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/image/file_to_document.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8f7b935655245df455665de92d4ca7e9d09a6de4989025c8dfcf9cb4e10e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): haystack/components/embedders/openai_document_embedder.py:268-287 | haystack/components/embedders/openai_document_embedder.py:313-332 \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":"haystack/components/embedders/openai_document_embedder.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa3dc9dcd99fe66d50f9af9b03ebd36798ce12d5444aa926434be02045858e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): haystack/components/builders/chat_prompt_builder.py:298-316 | haystack/components/builders/prompt_builder.py:252-270 \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. Note first that the copies are not typed on the same thing: \u0060PromptBuilder\u0060 names \u0060haystack.components.builders\u0060 in one and \u0060haystack.components.builders.prompt_builder\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/builders/chat_prompt_builder.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"290e189b6ec00c36bd0597586bda6be77c773db41a629fe63a50b45d04a794a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): haystack/components/extractors/image/llm_document_content_extractor.py:290-308 | haystack/components/extractors/image/llm_document_content_extractor.py:326-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"haystack/components/extractors/image/llm_document_content_extractor.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d100261f40f006825600e5566f38af79bde89564e596222b811042d5fae4ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): haystack/core/pipeline/pipeline.py:719-737 | haystack/core/pipeline/pipeline.py:783-801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060haystack/core/pipeline/pipeline.py:781\u0060 calls \u0060_runner\u0060 and \u0060haystack/core/pipeline/pipeline.py:717\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/pipeline/pipeline.py"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af4923a0f873849fe6000c913c843590b79331cc144c578abc2bbcf6ee3afe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): haystack/hooks/compaction/summarization.py:245-263 | haystack/hooks/compaction/summarization.py:284-302 \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":"haystack/hooks/compaction/summarization.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"50798a9b49317bdddbdcf36c7be021360caf52a1b7d95723a7a889ec678ccc9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): haystack/components/embedders/azure_document_embedder.py:216-233 | haystack/components/embedders/azure_text_embedder.py:192-209 \u2014 before extracting anything, compare \u0060haystack/components/embedders/azure_document_embedder.py\u0060 and \u0060haystack/components/embedders/azure_text_embedder.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060haystack/components/embedders/azure_document_embedder.py:216\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/azure_document_embedder.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc685a440a51b632b150b0512b865d66ca8dcf3720a9a7954beb6595c56ca2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): haystack/components/generators/chat/azure_responses.py:267-283 | haystack/components/generators/chat/openai_responses.py:375-392 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060haystack/components/generators/chat/azure_responses.py:261\u0060 calls \u0060get\u0060, \u0060isinstance\u0060, \u0060deserialize_callable\u0060 and \u0060haystack/components/generators/chat/openai_responses.py:371\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":"haystack/components/generators/chat/azure_responses.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3c7f8120faf9421d804b3ae258ed4bf892dcb76a7a2e359c4c2f14c933694f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): haystack/components/preprocessors/python_code_splitter.py:258-274 | haystack/components/preprocessors/python_code_splitter.py:280-297 \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":"haystack/components/preprocessors/python_code_splitter.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6333dcb494d594624527c36ce9a9085daf5e5d5ff28f4080d383a474d0cb71c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): haystack/components/converters/pdfminer.py:293-308 | haystack/components/converters/pypdf.py:267-282 \u2014 before extracting anything, compare \u0060haystack/components/converters/pdfminer.py\u0060 and \u0060haystack/components/converters/pypdf.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"haystack/components/converters/pdfminer.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5907f0cab5fe4dbb61739225a144a8e4b64c48a301287123f6534ad54058d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): haystack/components/retrievers/auto_merging_retriever.py:163-178 | haystack/components/retrievers/auto_merging_retriever.py:230-245 \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":"haystack/components/retrievers/auto_merging_retriever.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2228d842be31200e5902a8db3cb5bac7dc6b58c6f249420e589a360e8d7fbf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): haystack/document_stores/in_memory/document_store.py:294-308 | haystack/document_stores/in_memory/document_store.py:352-366 | haystack/document_stores/in_memory/document_store.py:406-420 \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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060doc_len\u0060 to \u0060int\u0060 in one and \u0060float\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/document_stores/in_memory/document_store.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80ce7aaa8135aba83f2e27d470671e81bfa28e3e86eadbd78294954a692232c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): haystack/components/builders/chat_prompt_builder.py:188-202 | haystack/components/builders/prompt_builder.py:187-201 \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. 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. Note first that the copies are not typed on the same thing: \u0060PromptBuilder\u0060 names \u0060haystack.components.builders\u0060 in one and \u0060haystack.components.builders.prompt_builder\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/builders/chat_prompt_builder.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c2899069ff7938759c4cef921206515cd0b27ac28a050e586f759f2279a6bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): haystack/components/embedders/azure_document_embedder.py:124-138 | haystack/components/embedders/azure_text_embedder.py:105-119 \u2014 before extracting anything, compare \u0060haystack/components/embedders/azure_document_embedder.py\u0060 and \u0060haystack/components/embedders/azure_text_embedder.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/azure_document_embedder.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7467064f30d4b6badfa83dd47847447288065f8758e9365e1f21a74c2a4affb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): haystack/components/extractors/image/llm_document_content_extractor.py:458-472 | haystack/components/extractors/llm_metadata_extractor.py:488-499 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060haystack/components/extractors/image/llm_document_content_extractor.py:458\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/extractors/image/llm_document_content_extractor.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbbc087eeb9906181e45a3d126adfa35f2429d45811355995a0f9760fe2279c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): haystack/testing/document_store_async.py:345-359 | haystack/testing/document_store_async.py:368-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060haystack/testing/document_store_async.py:361\u0060 calls \u0060filter_documents_async\u0060 and \u0060haystack/testing/document_store_async.py:383\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":"haystack/testing/document_store_async.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"132b7006b7f2cc13638f029d46a1ad8bdaa72582383b3b97f2a89dacf6f2295a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): haystack/utils/type_serialization.py:137-151 | haystack/utils/type_serialization.py:168-182 \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":"haystack/utils/type_serialization.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f55f73678875df5fd4688240d1c010a2419fd84a4dadd55a5fbdb1956b3936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): haystack/components/evaluators/document_map.py:63-76 | haystack/components/evaluators/document_mrr.py:61-74 | haystack/components/evaluators/document_ndcg.py:54-67 | haystack/components/evaluators/document_recall.py:96-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. 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 first that the copies are not typed on the same thing: \u0060Document\u0060 names \u0060haystack\u0060 in one and \u0060haystack.dataclasses\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/document_map.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea21eeb24e93c9253fe2780cf34cc23aad54b6e35810b16114c7c6b147873915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): haystack/components/generators/chat/openai.py:488-501 | haystack/components/generators/chat/openai_responses.py:520-533 \u2014 before extracting anything, compare \u0060haystack/components/generators/chat/openai.py\u0060 and \u0060haystack/components/generators/chat/openai_responses.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"haystack/components/generators/chat/openai.py"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c1eb6b7ff7f6fa4288f99eb3c1deccfbaa9eb89eaa782e339eb5f25869177a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): haystack/testing/document_store.py:1347-1360 | haystack/testing/document_store_async.py:864-877 \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 \u0060haystack/testing/document_store.py:1347\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":"haystack/testing/document_store.py"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a937577368c176fdfb8916e6db5c2a5d515ecc93c46bfc102168c82819bf24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): haystack/components/converters/image/file_to_image.py:115-127 | haystack/components/converters/image/pdf_to_image.py:120-132 \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":"haystack/components/converters/image/file_to_image.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"413ce76d970b21b5959b314db1288f30544d605433e9f0a451fab1007a8770ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): haystack/components/routers/llm_messages_router.py:160-172 | haystack/components/routers/llm_messages_router.py:209-221 \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":"haystack/components/routers/llm_messages_router.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"357dc124969a4952b8fce0b6fa5eeb88cd7d227093000bbd4841aec5c14051f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): haystack/hooks/compaction/hooks.py:132-144 | haystack/hooks/compaction/hooks.py:158-170 \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":"haystack/hooks/compaction/hooks.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ed97993f0148d65ea1dc39b49d85242bfb6dcf730ce935cb95547f03acd3b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): haystack/components/agents/agent.py:1096-1107 | haystack/components/agents/agent.py:1166-1177 \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":"haystack/components/agents/agent.py"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddddb3196a05e226749642d3eb309e5905f4e4c536f6ac86149fb23584b213b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): haystack/components/extractors/image/llm_document_content_extractor.py:310-321 | haystack/components/extractors/image/llm_document_content_extractor.py:346-357 \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":"haystack/components/extractors/image/llm_document_content_extractor.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"395dcd2ee142e41a3b44b49bb4b0b55ed43fb7fcb315b9ad7de11968eba69c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): haystack/components/joiners/answer_joiner.py:154-165 | haystack/components/joiners/document_joiner.py:193-205 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/joiners/answer_joiner.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e1263634b1b3292437dc1de3583bdf9bf760522e946f692348d30dc0a18709"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): haystack/components/query/query_expander.py:218-231 | haystack/components/query/query_expander.py:297-310 \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":"haystack/components/query/query_expander.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69ca6ceb35232b7ed7a453cb5207ccf300440afc0c30a864216ae8c8e1e7494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): haystack/testing/document_store.py:667-678 | haystack/testing/document_store.py:689-700 \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":"haystack/testing/document_store.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd318cbd2f965ed4a2fa88548670ebca712e003c92c9d3fffb90b9867c30b42d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): haystack/testing/document_store_async.py:98-109 | haystack/testing/document_store_async.py:121-132 \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":"haystack/testing/document_store_async.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd508a48ee833f443be3e45b002163d4582346cf21f2ebf88b032f196f80ba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): haystack/testing/document_store.py:312-322 | haystack/testing/document_store.py:357-367 | haystack/testing/document_store.py:402-412 | haystack/testing/document_store.py:447-457 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060haystack/testing/document_store.py:312\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":"haystack/testing/document_store.py"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"134a5196a327b85d170222abd0269bb8348a5f7b2ba5f4632d61f611acb83ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): haystack/components/agents/agent.py:1084-1094 | haystack/components/agents/agent.py:1152-1162 \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":"haystack/components/agents/agent.py"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"3707892add56ec765338c3d5e420ca6cfaaea947a39b16c35ae22d418dde8749"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): haystack/components/embedders/openai_document_embedder.py:359-366 | haystack/components/embedders/openai_document_embedder.py:392-402 \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 \u0060haystack/components/embedders/openai_document_embedder.py:392\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/openai_document_embedder.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"35683cad85c61262ad782b5be73bde389442fd6a45725c2c1e98ec5fb001a5ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): haystack/components/extractors/image/llm_document_content_extractor.py:305-315 | haystack/components/extractors/llm_metadata_extractor.py:312-321 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060haystack/components/extractors/image/llm_document_content_extractor.py:305\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060haystack/components/extractors/image/llm_document_content_extractor.py:303\u0060 calls \u0060from_user\u0060, \u0060TextContent\u0060 and \u0060haystack/components/extractors/llm_metadata_extractor.py:310\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":"haystack/components/extractors/image/llm_document_content_extractor.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8ca8d80b56d2aedcf7b7ae5f5099109a9f648cb8742f4e29f4f6402aa670e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): haystack/components/extractors/image/llm_document_content_extractor.py:341-351 | haystack/components/extractors/llm_metadata_extractor.py:335-344 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060haystack/components/extractors/image/llm_document_content_extractor.py:341\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060haystack/components/extractors/image/llm_document_content_extractor.py:339\u0060 calls \u0060from_user\u0060, \u0060TextContent\u0060 and \u0060haystack/components/extractors/llm_metadata_extractor.py:333\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":"haystack/components/extractors/image/llm_document_content_extractor.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6404155ef1a1020184e29d56bbd9eb76f5eae81edd5fb73bdea3b4a9550a54b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): haystack/components/extractors/llm_metadata_extractor.py:317-327 | haystack/components/extractors/llm_metadata_extractor.py:340-350 \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":"haystack/components/extractors/llm_metadata_extractor.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce191b2a97fad681029d3f20f25cd6f61d49d8bf5156e0416549a1fb4cab451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): haystack/core/super_component/utils.py:67-77 | haystack/core/super_component/utils.py:79-89 \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 after the matched lines, \u0060haystack/core/super_component/utils.py:79\u0060 calls \u0060_is_union_type\u0060 and \u0060haystack/core/super_component/utils.py:92\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":"haystack/core/super_component/utils.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cddeb963c14bbfbe01dc91a0bff1275ac274d09df50c7b78a7de35cc875a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): haystack/components/converters/image/file_to_document.py:87-94 | haystack/components/converters/pptx.py:191-200 | haystack/components/converters/txt.py:88-97 \u2014 before extracting anything, compare \u0060haystack/components/converters/image/file_to_document.py\u0060 and \u0060haystack/components/converters/pptx.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"haystack/components/converters/image/file_to_document.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"604c52f05b3f07f923726219c4417a634b65114fc54f73d97b3fe8983c23c281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): haystack/components/agents/tool_calling.py:225-234 | haystack/components/agents/tool_calling.py:269-278 \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":"haystack/components/agents/tool_calling.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c7c3e1cd152983ccd34c5c145d1fdd48d62078d37bd00cdc57c6a4c87ae44f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): haystack/components/evaluators/llm_evaluator.py:247-256 | haystack/components/evaluators/llm_evaluator.py:321-330 \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":"haystack/components/evaluators/llm_evaluator.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e20bdfbe2f0d874be421847c49e4da28a43c4ae067e5d9ed59d03f59ab07ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): haystack/components/generators/openai_image_generator.py:174-181 | haystack/components/generators/openai_image_generator.py:215-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060haystack/components/generators/openai_image_generator.py:215\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/openai_image_generator.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5d124c20cf791ec992f7b13f24251ae54b4ae9f607cccbf54dd67ad1e64abc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): haystack/core/pipeline/base.py:654-661 | haystack/core/pipeline/base.py:664-673 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060haystack/core/pipeline/base.py:660\u0060 calls \u0060join\u0060, \u0060items\u0060 and \u0060haystack/core/pipeline/base.py:649\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":"haystack/core/pipeline/base.py"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f6e506b40a7ccafe5a86e2bb97cd432c1628c4a80606732f9fc5ece62d0987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): haystack/testing/document_store.py:807-815 | haystack/testing/document_store.py:849-858 \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 \u0060haystack/testing/document_store.py:807\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4823e4b7b28c087b13d49d43ae1f96be75140ac573af1e3ba40793421bafbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): haystack/components/converters/csv.py:115-124 | haystack/components/converters/msg.py:172-180 | haystack/components/converters/pdfminer.py:282-290 | haystack/components/converters/pptx.py:181-189 | haystack/components/converters/pypdf.py:256-264 | haystack/components/converters/txt.py:77-85 | haystack/components/converters/xlsx.py:133-142 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 7 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":"haystack/components/converters/csv.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0965c41b3d07e367e503ccf87729f949863e993da5e401de334e249b8dd7f63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): haystack/components/agents/agent.py:1126-1134 | haystack/components/agents/agent.py:1196-1204 \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":"haystack/components/agents/agent.py"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ea043396a3123a8d48c82a7065717e7ecf4cbe058433e5d0dfc0a7e344ccda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): haystack/components/converters/docx.py:247-255 | haystack/components/converters/html.py:148-156 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/docx.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ae3524b32c0aad2f2c526429edbb8ae739493504540b8024a22aa6939c0237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): haystack/components/converters/pdfminer.py:217-225 | haystack/components/converters/pypdf.py:200-207 \u2014 before extracting anything, compare \u0060haystack/components/converters/pdfminer.py\u0060 and \u0060haystack/components/converters/pypdf.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/pdfminer.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc808ece4ad0012400c6f2beb38a4d586692e25514ce1638688c1eda04bc916"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): haystack/components/preprocessors/document_splitter.py:213-221 | haystack/components/preprocessors/embedding_based_document_splitter.py:191-199 \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 \u0060haystack/components/preprocessors/document_splitter.py:213\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":"haystack/components/preprocessors/document_splitter.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce92670e42a368b6abc0ae14540d32845f841c5f50ed26b77ebc8588fe31006"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): haystack/core/pipeline/base.py:1842-1850 | haystack/core/pipeline/base.py:1860-1870 \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 \u0060haystack/core/pipeline/base.py:1842\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":"haystack/core/pipeline/base.py"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb000ab157a683c0f7a011deb3d6590510fd635c1c72f714ae931ef6bf0701d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): haystack/components/converters/csv.py:115-122 | haystack/components/converters/image/file_to_document.py:82-89 | haystack/components/converters/msg.py:172-179 | haystack/components/converters/pdfminer.py:282-289 | haystack/components/converters/pptx.py:181-188 | haystack/components/converters/pypdf.py:256-263 | haystack/components/converters/txt.py:77-84 | haystack/components/converters/xlsx.py:133-140 \u2014 before extracting anything, compare \u0060haystack/components/converters/image/file_to_document.py\u0060 and \u0060haystack/components/converters/pptx.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"haystack/components/converters/csv.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aad56d525c37231fd15f68af13d0e0f6732c024143c4614436a1cbc5fc11ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): haystack/components/retrievers/auto_merging_retriever.py:153-160 | haystack/components/retrievers/auto_merging_retriever.py:219-227 \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 \u0060haystack/components/retrievers/auto_merging_retriever.py:219\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/auto_merging_retriever.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcb4beedb2fc27ef331150d51c4caedb781a867445d0829f40883e530a9bac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): haystack/components/agents/agent.py:966-972 | haystack/components/agents/agent.py:1062-1068 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/agents/agent.py"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db563e85267413e6e8a8d7e801fd7e88b3f49f5940aeff31bed80fd6e75cf12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): haystack/components/converters/markdown.py:154-160 | haystack/components/converters/pypdf.py:281-286 | haystack/components/converters/txt.py:96-101 \u2014 before extracting anything, compare \u0060haystack/components/converters/pypdf.py\u0060 and \u0060haystack/components/converters/txt.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/markdown.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a37d65ccaed2d4a3f623b55caedc616ea2054afebf034ead6028159db521f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): haystack/components/classifiers/openai_decisions_document_classifier.py:254-259 | haystack/components/classifiers/openai_decisions_document_classifier.py:285-290 \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":"haystack/components/classifiers/openai_decisions_document_classifier.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64c62c9e4d8b1106a7704cc0e749f997c4d786f4922bd994f6aff46d99ab79e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): haystack/components/routers/openai_decisions_image_router.py:194-200 | haystack/components/routers/openai_decisions_text_router.py:177-183 \u2014 before extracting anything, compare \u0060haystack/components/routers/openai_decisions_image_router.py\u0060 and \u0060haystack/components/routers/openai_decisions_text_router.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"haystack/components/routers/openai_decisions_image_router.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"243f679b3b1e91404ed7745ef30f2c475b3e86526ca1ac03ebee3a3e1e7012bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): haystack/components/evaluators/context_relevance.py:233-237 | haystack/components/evaluators/faithfulness.py:242-246 \u2014 before extracting anything, compare \u0060haystack/components/evaluators/context_relevance.py\u0060 and \u0060haystack/components/evaluators/faithfulness.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/context_relevance.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"939b1e79e921f49036448b377ac99e87eca9f3a1176623b4531e0653f3ee200d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 2): haystack/hooks/human_in_the_loop/types/protocol.py:17-117 | haystack/hooks/tool_result_offloading/types/protocol.py:32-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060haystack/hooks/human_in_the_loop/types/protocol.py:17\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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":"haystack/hooks/human_in_the_loop/types/protocol.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e10dd39ca3e941792285c9f91e1513b9901a83b03702f1db3cde484e9426508"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 9): haystack/components/classifiers/openai_decisions_document_classifier.py:170-179 | haystack/components/embedders/azure_document_embedder.py:156-171 | haystack/components/embedders/azure_text_embedder.py:132-147 | haystack/components/embedders/openai_document_embedder.py:133-143 | haystack/components/embedders/openai_text_embedder.py:104-114 | haystack/components/generators/chat/openai.py:241-251 | haystack/components/generators/openai_image_generator.py:91-101 | haystack/components/routers/openai_decisions_image_router.py:136-145 | haystack/components/routers/openai_decisions_text_router.py:128-137 \u2014 before extracting anything, compare \u0060haystack/components/embedders/azure_document_embedder.py\u0060 and \u0060haystack/components/embedders/azure_text_embedder.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"haystack/components/classifiers/openai_decisions_document_classifier.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e642c20c38a46b5a32df50e350e02e5847a9f00a866e42d17c0adaec1eb52462"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): haystack/components/converters/pdfminer.py:144-155 | haystack/components/converters/pypdf.py:161-172 \u2014 before extracting anything, compare \u0060haystack/components/converters/pdfminer.py\u0060 and \u0060haystack/components/converters/pypdf.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/pdfminer.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5580faab68f997d6c53791a99947eefa680c617162bfa932797adb37c4fc690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): haystack/components/embedders/azure_document_embedder.py:174-184 | haystack/components/embedders/azure_text_embedder.py:150-160 \u2014 before extracting anything, compare \u0060haystack/components/embedders/azure_document_embedder.py\u0060 and \u0060haystack/components/embedders/azure_text_embedder.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/azure_document_embedder.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"52108342e41fc706eea7a355d2fc3191df7177618ceb31980bb7879a7c0a99f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): haystack/components/embedders/azure_document_embedder.py:187-197 | haystack/components/embedders/azure_text_embedder.py:163-173 \u2014 before extracting anything, compare \u0060haystack/components/embedders/azure_document_embedder.py\u0060 and \u0060haystack/components/embedders/azure_text_embedder.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/azure_document_embedder.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffd6313827bd210df8c75a7b4690f019bdf64672425a67b47930e9a47c6ae7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): haystack/components/embedders/azure_document_embedder.py:250-263 | haystack/components/embedders/azure_text_embedder.py:221-234 \u2014 before extracting anything, compare \u0060haystack/components/embedders/azure_document_embedder.py\u0060 and \u0060haystack/components/embedders/azure_text_embedder.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/azure_document_embedder.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"35af053cb7978ec73b5bf07db9123782271ac7807500e36c2fbb56fe8a9ab57c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): haystack/components/embedders/openai_document_embedder.py:146-156 | haystack/components/embedders/openai_text_embedder.py:117-127 | haystack/components/generators/openai_image_generator.py:104-114 \u2014 before extracting anything, compare \u0060haystack/components/embedders/openai_document_embedder.py\u0060 and \u0060haystack/components/embedders/openai_text_embedder.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/openai_document_embedder.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f9a2e953615d000a0afb464992778152ce491da559aa2b33b2d563e6fc8de8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): haystack/components/embedders/openai_document_embedder.py:159-169 | haystack/components/embedders/openai_text_embedder.py:130-140 | haystack/components/generators/openai_image_generator.py:117-127 \u2014 before extracting anything, compare \u0060haystack/components/embedders/openai_document_embedder.py\u0060 and \u0060haystack/components/embedders/openai_text_embedder.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/openai_document_embedder.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7c60f5940c1343d99c73854a74ad6f7bf07b4f5722da72a47a6bd86558f7d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): haystack/components/evaluators/context_relevance.py:244-256 | haystack/components/evaluators/faithfulness.py:253-265 \u2014 before extracting anything, compare \u0060haystack/components/evaluators/context_relevance.py\u0060 and \u0060haystack/components/evaluators/faithfulness.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"haystack/components/evaluators/context_relevance.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bf7c38ef51d9627bca5c8ae69ca2058e17aa012005bfc74fe199b7e9d82dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): haystack/components/evaluators/context_relevance.py:260-270 | haystack/components/evaluators/faithfulness.py:269-279 | haystack/components/routers/llm_messages_router.py:240-251 \u2014 before extracting anything, compare \u0060haystack/components/evaluators/context_relevance.py\u0060 and \u0060haystack/components/evaluators/faithfulness.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/context_relevance.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"014cbaecedcbdee8cc1a50116a2d2a880d30d29b99f9282bb15d62aa43e56138"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): haystack/components/evaluators/llm_evaluator.py:124-130 | haystack/components/extractors/image/llm_document_content_extractor.py:193-199 | haystack/components/rankers/llm_ranker.py:192-196 | haystack/components/routers/llm_messages_router.py:111-115 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/llm_evaluator.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"304002a84b907344543c57d3a2917d1f1ff5028dab9c506d8e11c58ed6971e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): haystack/components/evaluators/llm_evaluator.py:140-146 | haystack/components/extractors/image/llm_document_content_extractor.py:209-215 | haystack/components/rankers/llm_ranker.py:204-208 | haystack/components/routers/llm_messages_router.py:123-127 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/llm_evaluator.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"505ab87e9a551c98c3599a9990e5c8722dff6e989c70bfdf900c85852c95e250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): haystack/components/generators/chat/openai.py:254-266 | haystack/components/generators/chat/openai_responses.py:264-276 \u2014 before extracting anything, compare \u0060haystack/components/generators/chat/openai.py\u0060 and \u0060haystack/components/generators/chat/openai_responses.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"68739120aa4e9b7dd0913096ffe51a0b13b2f9f14c3c69a795aadc1177d866c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): haystack/components/generators/chat/openai.py:269-281 | haystack/components/generators/chat/openai_responses.py:279-291 \u2014 before extracting anything, compare \u0060haystack/components/generators/chat/openai.py\u0060 and \u0060haystack/components/generators/chat/openai_responses.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fd2937138d50c4a701c8385ac33a1f5aa6c4b5e33aa73beaae3ab01d210229"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): haystack/components/joiners/answer_joiner.py:32-40 | haystack/components/joiners/document_joiner.py:46-54 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/joiners/answer_joiner.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fa4acc4bf6744c70164ab526e11e63887463018018d89d0879a2ba75238328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): haystack/components/retrievers/in_memory/bm25_retriever.py:107-118 | haystack/components/retrievers/in_memory/embedding_retriever.py:123-134 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/in_memory/bm25_retriever.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d967c36ec2213b684d772ed03dd4ce47666fd047a099431097b18b1bdfaf40cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): haystack/hooks/backup_answer/hooks.py:120-125 | haystack/hooks/compaction/summarization.py:474-479 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/backup_answer/hooks.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f6d2872b3cfd5230658c55e738f9849e47993b767e0b3988aaad462f05f985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): haystack/hooks/backup_answer/hooks.py:133-138 | haystack/hooks/compaction/summarization.py:487-492 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/backup_answer/hooks.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b0a8663b2588af1efe0bbf2a90822e59a5ad0d8ab4597c56b119f8ac05a242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): haystack/components/converters/docx.py:110-118 | haystack/components/converters/utils.py:27-35 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/docx.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51ef7ee0839fe573eacc484bf902ec26333025308cbb866b014ea016b51b267"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): haystack/testing/document_store.py:655-663 | haystack/testing/document_store_async.py:54-62 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060document_store\u0060 to \u0060DocumentStore\u0060 in one and \u0060AsyncDocumentStore\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"2223765554c8392d4f4fff7866b5f40ddee3c01bcccc63138aa183f756c1bc26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): haystack/utils/auth.py:26-35 | haystack/utils/device.py:39-51 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/auth.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2a42d3c96cfc6e25c7e4389b7c3a57e305a3ea4c56540ef2bfa2b653e9d262"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _SuperComponent (LCOM4 5): _SuperComponent\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/super_component/super_component.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3f4eb362da487dfac88cf9fe49be66e403362505ba75bf15461ffe69a59564"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/classifiers/openai_decisions_document_classifier.py: 24.4% line coverage (30/123)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/classifiers/openai_decisions_document_classifier.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7652727c1703809550ae96276c428d96bfea63908ba9f8cc7d923f067e0fba4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/converters/__init__.py: 30.0% line coverage (6/20)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c449f05075e379c741ef9d812e86b2c95ee6b3cc98416e9bb3685a7d6943fc2"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/converters/docx.py: 36.5% line coverage (77/211)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/docx.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46659a083e7b0de5a66700c3a2149c2c855a2ae64fe7b22252b6243df123d4f6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/converters/html.py: 36.4% line coverage (20/55)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/html.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fc22b2949eff69b2151d8256bb3046340d1cbb479bdc5815bc1c43663d32f5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/converters/image/document_to_image.py: 23.1% line coverage (12/52)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/image/document_to_image.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74dd80bb7a39267c3346015b181e4a73fca97dabce39d12e67c4d764df8ba7d4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/converters/image/image_utils.py: 23.0% line coverage (31/135)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/image/image_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b6f987ff0eecac9b4f05599660020a814220c2f8d9f975ccb9c0c2dd91e408"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/converters/image/pdf_to_image.py: 40.4% line coverage (19/47)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/image/pdf_to_image.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69dec85871d62b213559c42b23985dfee96ce31454e26824cc4248006104e0d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/converters/markdown.py: 31.7% line coverage (26/82)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/markdown.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a109fc8c8078bb4e48a381340b8040b496213fe325042a3b8508dccbd6fa03b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/converters/msg.py: 0.0% line coverage (0/88)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/msg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"881c1e855f52406e16c3be9c5ec511ba57d132be426503c320163202ccc6f603"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/converters/pdfminer.py: 28.3% line coverage (30/106)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/pdfminer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c864146d7474d12e5ac3cb00874291edd7c4850bc9314000fea70cc74ba154a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/converters/pptx.py: 25.8% line coverage (25/97)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/pptx.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b415fba7864fd28d44300a7e8ca80db74c731af6bb9192660270eae61cc104"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/converters/pypdf.py: 32.4% line coverage (34/105)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/pypdf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c357b8af7bd4c0c8ace959b17131f1c7fe1f36ffb4fa999b119ee384bbcf5a92"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/converters/xlsx.py: 17.9% line coverage (27/151)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/xlsx.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a3e02f25f7b1732b361e510ec645e14aa3423d961b856d93b884f8325a2044"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/embedders/openai_document_embedder.py: 31.8% line coverage (47/148)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/openai_document_embedder.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d6951cb52309cc6f8bd379c47829f156edab0e0eaa4b1f27000d1a3605e584"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/evaluators/__init__.py: 40.0% line coverage (6/15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b3d23579cbf922ad938b563970121cb19f140ec5fc8124a380d06b756c2441"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/evaluators/context_relevance.py: 43.1% line coverage (22/51)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/context_relevance.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed9acb6a55c7e0bb16a5f871b6f5e7c47feebd498c19cc536768c0620bf7da0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/evaluators/faithfulness.py: 38.6% line coverage (22/57)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/faithfulness.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a29a774947116c832d767f34e296fa3ca3ddd183bf5e2cac2db1763b047248"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/evaluators/llm_evaluator.py: 21.3% line coverage (36/169)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/llm_evaluator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de11533bdbce82c3d9498b620f192851235fa7ccfef372d371235d579a92d62"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/evaluators/sas_evaluator.py: 27.7% line coverage (18/65)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/sas_evaluator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cccfc3dcb6783354e73c8d645068b26d8e62f20a441e20a5aa597fdb0d302d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/extractors/image/llm_document_content_extractor.py: 28.8% line coverage (45/156)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/extractors/image/llm_document_content_extractor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7924abf9b62e7f909da53cf044568813b5a133acec90f0fcf49970962d8d8a26"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/extractors/llm_metadata_extractor.py: 23.7% line coverage (40/169)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/extractors/llm_metadata_extractor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec46415d3f062b0655a7d42e0fd703fa7369b07d1b50d0d1698120761fc71ac"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/generators/chat/__init__.py: 46.2% line coverage (6/13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a481579e1fe7ab83921e873c2c19cbe9c9e1b55a94f0c408fba77078ec2481c"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/generators/chat/azure.py: 28.7% line coverage (25/87)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/azure.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c19eb4c91e9015d3cbf730f9e40a60a58dec465d1b3bcc0e00deeef2713b904"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/generators/chat/azure_responses.py: 40.4% line coverage (19/47)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/azure_responses.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33579c8b016a951aaa40250bb46fd8b9acdc1060c765bba014490bc3bf83b605"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/generators/chat/fallback.py: 27.2% line coverage (28/103)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/fallback.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5118d8552753a859fa367f393e85c42dcc7ba9e492afbf2975bcc591dd9908ce"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/generators/chat/llm.py: 43.9% line coverage (18/41)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/llm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e30c2aa8a139328d0e2a409dfaa81e606e7d031b623f81e054e2003ce7aa13f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/generators/openai_image_generator.py: 29.6% line coverage (24/81)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/openai_image_generator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5b7f126d819a35b3584e2af397205213d0725b090cd55bc70d815ef68072a6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/preprocessors/__init__.py: 35.3% line coverage (6/17)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"352cc2e3b51c8b9153f904c4de8ddf543a914215e3169a182e82bfbe1f2813be"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/preprocessors/csv_document_cleaner.py: 39.4% line coverage (26/66)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/csv_document_cleaner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed10850011b15e1ea424868623a74d15ff4aaab7e87d1c42a386a9896ec4be6"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/preprocessors/csv_document_splitter.py: 0.0% line coverage (0/108)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/csv_document_splitter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b322687b6d625f713f76d2dbfceeca9038e17e5843322da6a585ed86d67ea7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/preprocessors/embedding_based_document_splitter.py: 20.3% line coverage (47/231)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/embedding_based_document_splitter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45236ff2c459045498347343014cddd667f2ce4194f401b20fb3b49d40355b2a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/preprocessors/sentence_tokenizer.py: 26.0% line coverage (25/96)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/preprocessors/sentence_tokenizer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30782bdf450f5095f768eb07c17dc0038f6b46de6e5c59270292b9c414e75c1d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/query/query_expander.py: 21.7% line coverage (31/143)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/query/query_expander.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d9fcc27a989308c77e94abf0bfb0523efc236f93dbcad9ff1af3986092f22a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/rankers/llm_ranker.py: 21.3% line coverage (33/155)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/rankers/llm_ranker.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1fb62ec6279e7438743a3290b254309f869c4499495df4c4d853ced65cd4fd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/retrievers/__init__.py: 40.0% line coverage (6/15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33bf26e62a9e7150472c3d517a389002b1ec140f3f077958155e2c3a943ca73"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/retrievers/multi_retriever.py: 22.1% line coverage (30/136)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/multi_retriever.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e6c884a6086cbaf85f7e9c0d441da7b9dcd209ec0d2bce8a86b4be5f604aad"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/routers/__init__.py: 42.9% line coverage (6/14)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"337d44fb8312ad9c05dcb5d0cb26478fa2606a0819a5e3d8548e28608684d6f8"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/routers/llm_messages_router.py: 24.7% line coverage (23/93)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/llm_messages_router.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d70c60869fe7ac7b2b1627dab1748388c9f48deea69f8919b19cfdc5593db96"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/routers/openai_decisions_image_router.py: 26.0% line coverage (26/100)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/openai_decisions_image_router.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef06edae2caba1e310150316495c5365e59d7a074614fa0392acbb99749b309"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/routers/openai_decisions_text_router.py: 24.1% line coverage (20/83)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/openai_decisions_text_router.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f68342d691ae229358d41f7bdd51b5656136a0e75d884aca105bfd5b69dfd94"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/components/samplers/top_p.py: 23.5% line coverage (16/68)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/samplers/top_p.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc18f6681f124aa21f9a20860af8cb73c9f8484c0b5d36344b118b69b0e4c770"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/dataclasses/__init__.py: 18.8% line coverage (6/32)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/dataclasses/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e11e8237184ad0391f51ff198f1a1c38de55aae644d68a17d0c1c25615aa1aa"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/hooks/__init__.py: 35.3% line coverage (6/17)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2585ebc2f142cde7cbed7a5959b8ba4033c87d4009f4d9dae2999c622488c77"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/hooks/backup_answer/hooks.py: 31.0% line coverage (31/100)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/backup_answer/hooks.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"061b50f957a7b6592bc53e4bb634d5c33de5b7ea76e37b634ece3966fb30d966"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/hooks/compaction/hooks.py: 38.4% line coverage (43/112)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/compaction/hooks.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"600acec311813ce1683182e03e5037e2856ab15ac4c21b69267182dc216ab74b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/hooks/compaction/sliding_window.py: 27.7% line coverage (23/83)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/compaction/sliding_window.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebe990681caa48f54c57a6a2d1e7a5443918f71753365170460896fe30923cd"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/hooks/compaction/summarization.py: 22.7% line coverage (39/172)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/compaction/summarization.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b467f9a31f6133411771e4a08e13283605325af7b5a177089bbc8ed18c482b5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/hooks/compaction/tool_result_offloading.py: 41.5% line coverage (22/53)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/compaction/tool_result_offloading.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93e052ce16a63ca14680c96948b74b662f558b81a7ab08391d2769bc48bf238"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/hooks/human_in_the_loop/__init__.py: 40.0% line coverage (6/15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/human_in_the_loop/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7751f8159ffc2dba2061a99fc5408304d380a22889eb5eea2372988090fed69d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/hooks/human_in_the_loop/hooks.py: 48.4% line coverage (15/31)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/human_in_the_loop/hooks.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61fa90d6af2dbe7e5751bf681030ba9430355e28b9725db95bea260bba15b96"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/hooks/human_in_the_loop/strategies.py: 21.1% line coverage (40/190)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/human_in_the_loop/strategies.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c699eb1e10230d26e153e265dc640f48c225ad66295caa688ba556b8a32e6a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/hooks/structured_output/hooks.py: 26.5% line coverage (27/102)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/structured_output/hooks.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad18065764fabfd41b53052d7e603027c656c6b08cf7c03a15eaf135ec366119"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/hooks/tool_result_offloading/__init__.py: 42.9% line coverage (6/14)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/tool_result_offloading/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b661ea5a9c381273fe1a713bc7329cd62d8de06146fbaf40bfde4e26d6402b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/hooks/utils.py: 49.0% line coverage (25/51)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b727175260a7bf8301b0d97aad6d5b8223fbdce391e3107ee28b3d7f85e31388"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/logging.py: 42.3% line coverage (82/194)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/logging.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bad0aae81ea5c73a009777aebee342c1e221bfba86edb7f5a14d3b030976ae4"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/testing/document_store.py: 30.8% line coverage (191/621)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7b601431140e518361dfb38ac421a1076e441ac9c42eb8302da9aeae990a54"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/testing/document_store_async.py: 4.2% line coverage (18/427)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/document_store_async.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2441952e3b1a14e362f4a2e0bfce2332a706b84f241755ee5a3275223dbc53b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/tools/__init__.py: 42.3% line coverage (11/26)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/tools/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7f96bdb2e1ed2725b42a963c07c019c4215b056d6ffc1961b23344df28658f"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/tools/pipeline_tool.py: 41.9% line coverage (13/31)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/tools/pipeline_tool.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a8e2fe72545fcda8f0ac955d28df03cce9ca5339dfcb67bf552bdd0c785f37"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/utils/__init__.py: 21.4% line coverage (6/28)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4db224f9917a1f8b09045ce92502fbc2231f39586e1c36f8c2a85d185432277"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/utils/jupyter.py: 11.1% line coverage (1/9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/jupyter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4061ed28e24b2a16e58d8a00ae2dbcb0a5847d9e296131ec06325a3f2b20ff6d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: haystack/utils/requests_utils.py: 21.2% line coverage (7/33)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/requests_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3781b775fa09aff34cb9438a410506e10949efedfee2a6ff232b67f1563031"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: scripts/release_note_backticks.py: 30.0% line coverage (9/30)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release_note_backticks.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab4d2937907e5ac7ff53c365b973499f8e686c632f6e0792c3218dad0c3ad3e"}},{"ruleId":"D8","level":"note","message":{"text":"Tests reach code only in some runs: haystack/telemetry/_telemetry.py: 5 line(s) (70-74) were executed in some of the 3 runs of the suite and not in others. A test that does not take the same path every run only tests the part it always takes, so these lines are not counted as covered. Make the tests that reach them deterministic (a fixed clock, seed or ordering, or waiting on the event instead of on time), or test the paths directly."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/telemetry/_telemetry.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"142365814593f6c8c0c09bf23e704f25953884e46c3b366f6086d1c1c196b984"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/components/generators/chat/openai_responses.py: haystack/components/generators/chat/openai_responses.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in openai_responses._convert_streaming_chunks_to_chat_message at line 931. 9 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/generators/chat/openai_responses.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":"haystack/components/generators/chat/openai_responses.py"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6a87b8f1bab4c9926faa6770c4fd3c312e002a96b59518d206d03410f5f228"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/core/pipeline/base.py: haystack/core/pipeline/base.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in PipelineBase.connect at line 600. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/core/pipeline/base.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":"haystack/core/pipeline/base.py"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5b60b21229f8fdcb38280764156864aa2514e3cf5ed93a91c5f9339e19d3f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/components/preprocessors/markdown_header_splitter.py: haystack/components/preprocessors/markdown_header_splitter.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in MarkdownHeaderSplitter._split_text_by_markdown_headers at line 141. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/preprocessors/markdown_header_splitter.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":"haystack/components/preprocessors/markdown_header_splitter.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"202f42580df04d55d795a5e610a65d44dea08077301b39d296bf0d684ab53545"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/dataclasses/chat_message.py: haystack/dataclasses/chat_message.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ChatMessage.from_openai_dict_format at line 756. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/dataclasses/chat_message.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":"haystack/dataclasses/chat_message.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c02f0031b016490d6d29ba0ac9518cc409f84b8d874605727edde480c786e27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/components/rankers/meta_field.py: haystack/components/rankers/meta_field.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in MetaFieldRanker.run at line 163. 7 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/rankers/meta_field.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":"haystack/components/rankers/meta_field.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac599f589919ca998f4bc0808c1e2b05e2752497355bb4e4704718030073266"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/core/type_utils.py: haystack/core/type_utils.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in type_utils._strict_types_are_compatible at line 136. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/core/type_utils.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":"haystack/core/type_utils.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"910b7e2caaced91c0e8267c9e464aeba42b7b9603a328dd46fa49ae051955d25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/components/converters/xlsx.py: haystack/components/converters/xlsx.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in XLSXToDocument._extract_tables at line 220. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/converters/xlsx.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":"haystack/components/converters/xlsx.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f1d8111fbe62012634a19a1ba5896656eca490790375f06339f494de7e107f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/tools/tool.py: haystack/tools/tool.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Tool.__post_init__ at line 112. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/tools/tool.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":"haystack/tools/tool.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"35947b6a65cdb4b85b3303294528438897ff95116efad98b9969be5af9917b79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/components/preprocessors/python_code_splitter.py: haystack/components/preprocessors/python_code_splitter.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in PythonCodeSplitter._extract_units at line 337. 6 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/preprocessors/python_code_splitter.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":"haystack/components/preprocessors/python_code_splitter.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ed72c38ec6482ba0df011dc9ac5ce11f4340505a479c68f310c125899e419b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/core/pipeline/pipeline.py: haystack/core/pipeline/pipeline.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Pipeline.run_async_generator at line 808. 2 of those changes were fix/bug commits, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/core/pipeline/pipeline.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":"haystack/core/pipeline/pipeline.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b73c0c9c115e83fe3f28ad3c3fb56f861161da5093496fa14cb0085a0e8420"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/components/validators/json_schema.py: haystack/components/validators/json_schema.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in JsonSchemaValidator.run at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/validators/json_schema.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":"haystack/components/validators/json_schema.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3bcf9029f9a92feecbb84d4973cdee67aeb2801ed16edb29ee2cb3edca02cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/tools/from_function.py: haystack/tools/from_function.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in from_function.create_tool_from_function at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/tools/from_function.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":"haystack/tools/from_function.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f4450c77887a7d97836ebce65a6beec1bde2015ddaf01f88a11d90048468f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/components/preprocessors/document_cleaner.py: haystack/components/preprocessors/document_cleaner.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DocumentCleaner.run at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/preprocessors/document_cleaner.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":"haystack/components/preprocessors/document_cleaner.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d803f1b04b2a7bddb8b34ff57e26c5d2b7aee849e23917e0124ad691f746ed96"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/components/converters/json.py: haystack/components/converters/json.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in JSONConverter._get_content_and_meta at line 188. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/converters/json.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":"haystack/components/converters/json.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb70c44a9eadb7d92736df00bfd834def42d617ff678b91a9e78dcf3ca8671d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/components/generators/utils.py: haystack/components/generators/utils.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in utils._convert_streaming_chunks_to_chat_message at line 117. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/generators/utils.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":"haystack/components/generators/utils.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fc418a71b7046973ef9d1832905e8c0876d861b18bd7088bb4bc64a94c538f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/components/builders/chat_prompt_builder.py: haystack/components/builders/chat_prompt_builder.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ChatPromptBuilder.run at line 205. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/builders/chat_prompt_builder.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":"haystack/components/builders/chat_prompt_builder.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4300dfba673c05bad809acd82f1aebe8a42c5e28a45283b673dcfe40cdd81b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: haystack/components/rankers/lost_in_the_middle.py: haystack/components/rankers/lost_in_the_middle.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in LostInTheMiddleRanker.run at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/rankers/lost_in_the_middle.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":"haystack/components/rankers/lost_in_the_middle.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"10537d0bbcee390d5f152ded05a1ea1cfb06c9991b29f01de85e858fcef1a2b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/document_stores/in_memory/document_store.py: haystack/document_stores/in_memory/document_store.py changed 10 times in last 90 days and 10 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 InMemoryDocumentStore.bm25_retrieval at line 811), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: prevent mutation in InMemoryDocumentStore.update_by_filter (#13755)\u201D; \u201Cfix: restore exact in-memory document store snapshots (#13696)\u201D; \u201Cfix: keep in-memory BM25 statistics coherent during concurrent mutations (#13674)\u201D; \u201Cfix: add delete_by_filter_async to InMemoryDocumentStore (#13356)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/document_stores/in_memory/document_store.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":"haystack/document_stores/in_memory/document_store.py"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdaad75af3402211d43760a0fee56adb3aae509f8358180a2a209f761f2b8f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/preprocessors/recursive_splitter.py: haystack/components/preprocessors/recursive_splitter.py changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is RecursiveDocumentSplitter._chunk_text at line 352), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: don\u0027t count whitespace-only pieces as words in RecursiveDocumentSplitter (#13354)\u201D; \u201Cfix: validate split_unit in RecursiveDocumentSplitter (#13358)\u201D; \u201Cfix: handle literal special-token strings in document splitters (#12853)\u201D; \u201Cfix: keep init parameters when serializing RecursiveDocumentSplitter and TextCleaner (#12738)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/preprocessors/recursive_splitter.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":"haystack/components/preprocessors/recursive_splitter.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2fdb509d3b70da433142249070cf4f7aa14dda740a471e77ec6cf5f082971e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/joiners/document_joiner.py: haystack/components/joiners/document_joiner.py changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is DocumentJoiner._distribution_based_rank_fusion at line 274), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: treat a non-finite score as missing in DocumentJoiner DBSF mode (#13582)\u201D; \u201Cfix!: pass variadic inputs in connection order in Pipeline.run() and run_async() (#13415)\u201D; \u201Cfix: reject NaN/inf weights in DocumentJoiner (#13410)\u201D; \u201Cfix: reject negative weights in DocumentJoiner (#12718)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/joiners/document_joiner.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":"haystack/components/joiners/document_joiner.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7805f1a389854fa04bb27560c8cc67add57299c874617e0c9d5cf30df3821df0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/preprocessors/document_splitter.py: haystack/components/preprocessors/document_splitter.py changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is DocumentSplitter.run at line 192), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: stop sentence overlap once split_overlap words are reached (#13522)\u201D; \u201Cfix: handle literal special-token strings in document splitters (#12853)\u201D; \u201Cfix: skip overlap-only trailing chunks in character-based split modes (#12687)\u201D; \u201Cfix: avoid overlap-only trailing chunks in DocumentSplitter token mode (#12661)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/preprocessors/document_splitter.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":"haystack/components/preprocessors/document_splitter.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a272e77687d43db7edb9af9ebada48c4fbd4b0bf8d1cf911b889ba36b8f36bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/fetchers/link_content.py: haystack/components/fetchers/link_content.py changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is LinkContentFetcher.run_async at line 309), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: match the LinkContentFetcher content type case-insensitively (#13433)\u201D; \u201Cfix: stop \u0060LinkContentFetcher\u0060 fallback from inserting a \u0060text/plain\u0060 handler (#12908)\u201D; \u201Cfix: do not mutate caller-provided client_kwargs in LinkContentFetcher (#12829)\u201D; \u201Cfix: preserve client default headers in async LinkContentFetcher #12817 (#12818)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/fetchers/link_content.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":"haystack/components/fetchers/link_content.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae61c54883454efd4ae86b74e9bbb7cfb3cabfb85efcc67442463b1a455f93a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/converters/docx.py: haystack/components/converters/docx.py changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is DOCXToDocument._inline_content at line 374), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: read tracked insertions and inline content controls in DOCXToDocument (#13364)\u201D; \u201Cfix: preserve URL fragments stored in w:anchor in DOCXToDocument links (#13207)\u201D; \u201Cfix: read text boxes in DOCXToDocument (#12769)\u201D; \u201Cfix: keep hyperlink addresses in DOCXToDocument table cells (#12988)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/converters/docx.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":"haystack/components/converters/docx.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0b13465a088fa9cb2ebc7fddb956df90c32b3fb4bac85d75e4ccaa43c17e24"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/retrievers/auto_merging_retriever.py: haystack/components/retrievers/auto_merging_retriever.py changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is AutoMergingRetriever._check_valid_documents at line 111), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: merge hierarchical leaves at different depths (#12944)\u201D; \u201Cfix: deduplicate AutoMergingRetriever documents (#13511)\u201D; \u201Cfix: run sync document store methods in a worker thread (#13381)\u201D; \u201Cfix: accept zero hierarchy meta values in AutoMergingRetriever (#12635)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/retrievers/auto_merging_retriever.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":"haystack/components/retrievers/auto_merging_retriever.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddd317a6cc967b381c9bec5e288111e8dbb8c6a50f5373e62a28ed9be9f9017"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/extractors/image/llm_document_content_extractor.py: haystack/components/extractors/image/llm_document_content_extractor.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is LLMDocumentContentExtractor._process_response at line 263), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: validate max_workers at init in MultiRetriever and other parallel components (#13430)\u201D; \u201Cfix: correct LLMDocumentContentExtractor failure messages and docstring (#13175)\u201D; \u201Cfix(extractors): don\u0027t treat a generator\u0027s own \u0022error\u0022 field as failure in LLMDocumentContentExtractor (#12735)\u201D; \u201Cfix: convert images off the event loop in LLMDocumentContentExtractor.run_async (#12359)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/extractors/image/llm_document_content_extractor.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":"haystack/components/extractors/image/llm_document_content_extractor.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85a5dbb781e59d548e6774fb7afe1e15c0d2a3ec3fd9c8d499c2580df08f582"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/extractors/llm_metadata_extractor.py: haystack/components/extractors/llm_metadata_extractor.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is LLMMetadataExtractor._prepare_prompts at line 271), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: validate max_workers at init in MultiRetriever and other parallel components (#13430)\u201D; \u201Cfix: don\u0027t treat a generator\u0027s own \u0022error\u0022 field as failure in LLMMetadataExtractor (#12852)\u201D; \u201Cfix: LLMMetadataExtractor treats an extracted \u0027error\u0027 key as a failure (#12685)\u201D; \u201Cfix: clear stale metadata extraction errors after successful retries (#12533)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/extractors/llm_metadata_extractor.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":"haystack/components/extractors/llm_metadata_extractor.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"664bc6514a495febb1f8306f4a4004b2ba4ce3fa0f9e170d97778a59307a3e18"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/evaluators/sas_evaluator.py: haystack/components/evaluators/sas_evaluator.py changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is SASEvaluator.run at line 145), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: reject multi-label cross encoders in SASEvaluator (#13251)\u201D; \u201Cfix: validate batch_size in SASEvaluator (#13503)\u201D; \u201Cfix: pass token instead of use_auth_token in SASEvaluator.warm_up (#13217)\u201D; \u201Cfix: normalize SASEvaluator cross encoder scores based on the model (#13244)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/evaluators/sas_evaluator.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":"haystack/components/evaluators/sas_evaluator.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef6eb25ff23ffb22f4257961e5ffe92b40d7104b72b36f4d7d1ab8538a4eb99"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/hooks/structured_output/hooks.py: haystack/hooks/structured_output/hooks.py changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is StructuredOutputHook._parse at line 177), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: support CRLF code fences in StructuredOutputHook (#13617)\u201D; \u201Cfix: mark user messages added by hooks as system reminders (#13580)\u201D; \u201Cfix: don\u0027t let system reminders reset StructuredOutputHook retries (#13501)\u201D; \u201Cfix: replace structured output list state after validation (#13400)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/hooks/structured_output/hooks.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":"haystack/hooks/structured_output/hooks.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe274c37327241ad472f59c1e599210b73d30bba38f403584de56d61f9fbcf1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/retrievers/multi_retriever.py: haystack/components/retrievers/multi_retriever.py changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is MultiRetriever.run at line 230), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: validate join_mode in MultiRetriever (#13122)\u201D; \u201Cfix: validate max_workers at init in MultiRetriever and other parallel components (#13430)\u201D; \u201Cfix: validate top_k in MultiRetriever (#12719)\u201D; \u201Cfix: honour max_workers in the multi-retrievers\u0027 run_async (#12662)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/retrievers/multi_retriever.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":"haystack/components/retrievers/multi_retriever.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24891e0bbf8d8bb73f3767736b3665c36a9bac7178f9acd1a0f866741e1640f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/utils/filters.py: haystack/utils/filters.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is filters._prepare_ordering_comparison at line 128), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: complete partial dates to start of period in range filters (#13342)\u201D; \u201Cfix: reject datetime numeric ordering filters (#13202)\u201D; \u201Cfix: treat dotted filter fields with unknown root as missing instead of raising AttributeError (#12744)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/utils/filters.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":"haystack/utils/filters.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90f0c8d2f129282f1852933f0fb10036493d7c5439f4fd32e1c70dc486d81c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/preprocessors/sentence_tokenizer.py: haystack/components/preprocessors/sentence_tokenizer.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is SentenceSplitter._needs_join at line 231), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: split sentences ending with danda (\u0964, \u0965) in DocumentSplitter (#13646)\u201D; \u201Cfix: always close PDF in \u0060_convert_pdf_to_images\u0060; narrow bare except in \u0060SentenceSplitter\u0060 (#12942)\u201D; \u201Cfix: read abbreviation lists as UTF-8 regardless of locale (#13052)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/preprocessors/sentence_tokenizer.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":"haystack/components/preprocessors/sentence_tokenizer.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0528cf4bb6cb63902b82b82a27ac2b01d3403dae7a92ca1add73b8dae2c1fdd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/retrievers/sentence_window_retriever.py: haystack/components/retrievers/sentence_window_retriever.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is SentenceWindowRetriever.merge_documents_text at line 121), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: avoid repeated text after contained sentence chunks (#13340)\u201D; \u201Cfix: run sync document store methods in a worker thread (#13381)\u201D; \u201Cfix: sort SentenceWindowRetriever context before merging text (#12976)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/retrievers/sentence_window_retriever.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":"haystack/components/retrievers/sentence_window_retriever.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd92f32c243fe06dd0b75989412ef84b930036dc56d5221dd7f26703c304a436"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/converters/image/document_to_image.py: haystack/components/converters/image/document_to_image.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is DocumentToImageContent.run at line 102), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: DocumentToImageContent skips undecodable images instead of failing the whole batch (#13452)\u201D; \u201Cfix: return None for unconvertible PDF pages in DocumentToImageContent (#12912)\u201D; \u201Cfix: return None instead of raising for invalid documents in DocumentToImageContent (#12872)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/converters/image/document_to_image.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":"haystack/components/converters/image/document_to_image.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e291968985c8c90fd71d86f2dbcf2e9a008e2b27a8c18c7d72b586af4316a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/tools/parameters_schema_utils.py: haystack/tools/parameters_schema_utils.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is parameters_schema_utils._resolve_type at line 239), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: resolve string field annotations of dataclasses in ComponentTool schemas (#13516)\u201D; \u201Cfix: skip annotated callable parameters in tool schemas (#13138)\u201D; \u201Cfix: unwrap Annotated in _unwrap_optional for State parameter detection (#13169)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/tools/parameters_schema_utils.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":"haystack/tools/parameters_schema_utils.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d19260dbb4d61d7dab70863f10a4917aec2576f2c445062f459970e74c5e73"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/converters/pptx.py: haystack/components/converters/pptx.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is PPTXToDocument._process_paragraph at line 131), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(pptx): keep soft line breaks with markdown and plain link formats (#13222)\u201D; \u201Cfix: preserve PowerPoint field text when extracting links (#13377)\u201D; \u201Cfix: read grouped shapes and tables in PPTXToDocument (#12768)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/converters/pptx.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":"haystack/components/converters/pptx.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3f70c30845ab9029a9f0fd7dbe9f38fe53d9e3fe23a1b6e9a9ac9ab8363066"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/preprocessors/text_cleaner.py: haystack/components/preprocessors/text_cleaner.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is TextCleaner.run at line 80), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: apply each TextCleaner remove_regexps pattern independently (#13293)\u201D; \u201Cfix: raise TypeError for non-string TextCleaner inputs (#12792)\u201D; \u201Cfix: keep init parameters when serializing RecursiveDocumentSplitter and TextCleaner (#12738)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/preprocessors/text_cleaner.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":"haystack/components/preprocessors/text_cleaner.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3cad5387f13316d196ee23bd4e06f4941e2ab505a2b9fd6dc8c91f0c1ea31e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/document_stores/types/filter_policy.py: haystack/document_stores/types/filter_policy.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is filter_policy.apply_filter_policy at line 322), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: warn when MERGE combines two AND filters on the same field (#13637)\u201D; \u201Cfix: keep both filters when FilterPolicy.MERGE combines OR/NOT filters (#12816)\u201D; \u201Cfix: avoid mutating filters during FilterPolicy.MERGE (#12501)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/document_stores/types/filter_policy.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":"haystack/document_stores/types/filter_policy.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c7df68d1cbd8a5f0ba673810e645865aa004f77cb9f87a4db455e65165e756"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/retrievers/multi_query_embedding_retriever.py: haystack/components/retrievers/multi_query_embedding_retriever.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is MultiQueryEmbeddingRetriever.warm_up_async at line 102), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: validate max_workers at init in MultiRetriever and other parallel components (#13430)\u201D; \u201Cfix: sort unscored retriever results last (#13090)\u201D; \u201Cfix: honour max_workers in the multi-retrievers\u0027 run_async (#12662)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/retrievers/multi_query_embedding_retriever.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":"haystack/components/retrievers/multi_query_embedding_retriever.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa026c728e80a9f80bd598e39f8445cb63766c4c3c0bac91b17d8a922920962a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/components/retrievers/multi_query_text_retriever.py: haystack/components/retrievers/multi_query_text_retriever.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is MultiQueryTextRetriever.run at line 109), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: validate max_workers at init in MultiRetriever and other parallel components (#13430)\u201D; \u201Cfix: sort unscored retriever results last (#13090)\u201D; \u201Cfix: honour max_workers in the multi-retrievers\u0027 run_async (#12662)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/components/retrievers/multi_query_text_retriever.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":"haystack/components/retrievers/multi_query_text_retriever.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e61a721e93148d3a741d0cfc07c47a18e8795de7268eb396d862f0330b77480"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: haystack/logging.py: haystack/logging.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is logging.configure_logging at line 415), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: bound log values nested in lists and dicts (#13031)\u201D; \u201Cfix: log traceback in \u0060logger.exception()\u0060 of Haystack loggers (#13189)\u201D; \u201Cfix: bound log field sizes to stop exceptions leaking payloads (#12849)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 14:04:07 \u002B00:00\u0027 --until=\u00272026-11-16 14:04:07 \u002B00:00\u0027 --full-history --no-merges -- haystack/logging.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":"haystack/logging.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8f9df0c349452173015de9db8839e6229fd408ceac776be96cc8a6c2f3466b"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 8 significant file(s) lose their only recent owner: haystack/hooks/compaction/summarization.py, haystack/hooks/tool_result_offloading/hooks.py, haystack/hooks/compaction/tool_result_offloading.py, haystack/hooks/compaction/utils.py, haystack/hooks/tool_result_offloading/utils.py, haystack/token_counters/utils.py, haystack/hooks/tool_result_offloading/types/protocol.py, haystack/hooks/invocation.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d7c9a34ed63f3f113587facae67f978c172cc33b16aeb301858f574c1fbf5182"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (10 single-owned of 200 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 200 of the 300 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: haystack/core/serialization_security.py, haystack/testing/telemetry.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this, this should be a component test. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/core/pipeline/test_pipeline_base.py"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"b898c37ac3322301780b54aa0b4a0df8b2ee3d1b05dbee88240ee38e214e690a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO Unneeded streaming chunk \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/components/generators/chat/test_openai_responses_conversion.py"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaadadf8682a17d2bdbe10422b7de0f6545e23d9472effed0c697e38fbdbcfd5"}},{"ruleId":"D27","level":"note","message":{"text":"Scattered collaborators: 77 % of calls cross a namespace and only 44 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c273328d7ed44ae026bf85600cefbae9557f3115b11a4fb400c77770d488efa7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d015fb9f141fdca6f3b2f2696a2c2d34a32a31360be62517fc6fe74471eb2ddf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"444cb11eccd9c4ef8102b23e35a1d13f442e86a1f60d94e5117affb1372cf1cd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59ea84e3d9d7e8f5b0b748488f9b61d98921c7940749e96c6ae5274b6bdb7197"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3c29a4225410aca1dd87c78b062793bcd6cc7191befb1ca27fddbac13c03d2c"},"taxa":[{"id":"CWE-807","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46242f37b22a4dbb3a7fc7f3d1ae02504903d95e489f39935cc7cc25409a7ea3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6296ea7748b4dd1beaa3bb6b9ff15bb6f777a613f12b6ae5998d6cf36933add0"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8c4320376fb417e2ea649feac7e64d7049217cb29b853f4c230761b62729179"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d47a86ec3b928a3728dbab64ac1eead865ad85726e330498ca849d9d24f01a7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe57bed652d17cc366419ca57783f09f309fdc1ed940398ff71e7bd700794301"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d05c72ab179252f8bbba8aa046ed559e0d6e1f2892a532cd70d19dc06b8ba2b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9427339c903760ee0c91ca07014859d9055989b9a980a89d4b07814f17810cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09d8bbb85846cffa13c954ef8b7b9c4242b86e8a32351530eff8423653fa1251"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c83611000c18c806ed8f93fa41f0a15363150ad621561ecad5b61697aefb524"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e53432efe47583aefb7083c9c1cfde92d589303d66f6b567d73ff145130294d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2d4f1812e88a4bd06eec577e25441ebe805762b76dca331590955c0398647f8"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e17f99eb8017dcef96be5da4ca43cfc54fd8f03043251a7b4a06f1393b378345"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e0483a697a63d5be85f85ca0f449197374d0cbe53e6d99180519e247233ac4b"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a062546dcdd9172509e97ac2662433e56b640e2917f97df56a2464d1f4958213"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d533f6737ec72ee61689a6d36ba604e12c89cccb13d21db3d73a980233fdb41"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cf6b4f2704625709ab4d242a057330c05a2e740a4aa220a97f8c821b1744948"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01905d97479265a93d571e61867e520b25ad52f5283a895265084eed41e528b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b024af877145faff850b78fee3c2547bc93935804747a6cb8d0fc709b874c22e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63b67a8cfc567c85321bf0b1ba49cb114b73440e5ffefb7e9dadea8a6fb5fcfc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81f4445777f0c0db36175ed22c4dbd634c3d96071d43d875c3e28b301b3f48aa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ed059458dc0d864f79fffc2c8cd3f09ac2213f256b255ba1e07734350228541"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"ea07d96ac14384c58deeb7ea21aa84a1c82751eb0198edc3af626c17d06aa1e8"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"97180aa1208e3accdea8b80bb3c9a46e6cf7bd16f7c443c8f9ec7c334f1d346a"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e297124041166b37eaf169e454e831bddf9fd2c515b9072bea4269c578132f56"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6647824a7f699c7311184aec0fa1e5b46c5b153286f07061776f30dd914b1559"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 5 of 200 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 200 of the 300 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: haystack/testing/factory.py, haystack/document_stores/types/protocol.py, haystack/telemetry/_environment.py, haystack/components/agents/state/state_utils.py, haystack/components/evaluators/answer_exact_match.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/testing/factory.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca37b4758b515edf1ec60566f5eca44c0a3eaec43d118c7a7438a4b709796780"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/document_stores/types/protocol.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae000a412e59747b443fe9306db52975c2d5de649652cd87fbe01a12b60f94c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/telemetry/_environment.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44800d5a0c63822b41dd34080d0e5599a7b4a383d67c226752a6cdaea3274c4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/agents/state/state_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b5c70b1c8b8593c9f7ce3278d0e33a4e622413566047fc343e1434e76d8113"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/answer_exact_match.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ed81adaac7cce125793214c10c2228c5e86c1616ce9d00095e04f438ca4449"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: bm25_retriever.py \u2194 embedding_retriever.py: \u0060haystack/components/retrievers/in_memory/bm25_retriever.py\u0060 and \u0060haystack/components/retrievers/in_memory/embedding_retriever.py\u0060 change together 88% of the time (14 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u0060b3d1fbdc\u0060 fix: validate top_k in MultiRetriever (#12719); \u006020d9bc4e\u0060 fix: apply FilterPolicy.MERGE correctly in in-memory retrievers (#12066); \u0060f43b28de\u0060 docs: document type errors in docstrings (#10656) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/in_memory/bm25_retriever.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2b54dda9a3f7babeb3cb4e4bf060b348876d891dbe566e674d6ca1adbd1ac5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: multi_query_embedding_retriever.py \u2194 multi_query_text_retriever.py: \u0060haystack/components/retrievers/multi_query_embedding_retriever.py\u0060 and \u0060haystack/components/retrievers/multi_query_text_retriever.py\u0060 change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060bab6a0ae\u0060 fix: validate max_workers at init in MultiRetriever and other paralle\u2026; \u0060cd01d569\u0060 fix: honour max_workers in the multi-retrievers\u0027 run_async (#12662); \u0060a68ed4ac\u0060 fix: cancel sibling tasks when concurrent retrieval fails (#11967) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/retrievers/multi_query_embedding_retriever.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc917bb0afb9702f1a0e4cdfeb66325a4432beff4b8d5f760db0b291c509638"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: context_relevance.py \u2194 faithfulness.py: \u0060haystack/components/evaluators/context_relevance.py\u0060 and \u0060haystack/components/evaluators/faithfulness.py\u0060 change together 67% of the time (14 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u0060e65bd61e\u0060 fix: fill in the LLMEvaluator failure summary and clarify its fallbac\u2026; \u0060e8f88975\u0060 fix: add missing output sockes to LLM evaluators (#12049); \u006095d17ca7\u0060 feat: expose evaluator row status for LLM evaluators (#11333) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/context_relevance.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5fa42919d376f7e13c5b78c68cde598623e753b86ffbde8ad6dba2b46f4d03"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: output_adapter.py \u2194 conditional_router.py: \u0060haystack/components/converters/output_adapter.py\u0060 and \u0060haystack/components/routers/conditional_router.py\u0060 change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006098d75dd7\u0060 fix: preserve string outputs in OutputAdapter (#12322); \u0060cf4cadbe\u0060 fix!: require unsafe loading for serialized Jinja filters (#12415); \u0060efcf6b89\u0060 fix: prevent RCE by hardening deserialization and Jinja sandbox (#12312) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/output_adapter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3febf16b49ca0ae55e4673bbc1960e1dfba8f970434ae61569dd0a8a6ba74f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: azure_document_embedder.py \u2194 azure_text_embedder.py: \u0060haystack/components/embedders/azure_document_embedder.py\u0060 and \u0060haystack/components/embedders/azure_text_embedder.py\u0060 change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006063e94e2e\u0060 chore: unpin openai (#12348); \u006049863778\u0060 feat: Allow OpenAI client config in \u0060OpenAIChatGenerator\u0060 and \u0060AzureO\u2026; \u0060dd6ff10d\u0060 feat: allow OpenAI client config in AzureOpenAI embedders (#9136) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/azure_document_embedder.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04845ba6c6b6ca776addd6b3594cedc5312e86fa19d9158dee6c84bd38c89e7a"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable role=\u0022button\u0022 that no keyboard user can reach: This \u003Cdiv\u003E announces itself as a role=\u0022button\u0022 and binds a click, but nothing can put focus on it: no tabIndex={0} in any spelling, no key handler, and nothing in this file moves focus or sets aria-activedescendant. The role tells assistive tech what the control IS; it does not make the control reachable, so a keyboard user cannot operate it at all (WCAG 2.1.1). Give it tabIndex={0}=\u00220\u0022 and an Enter/Space key handler, or make it a native \u003Cbutton\u003E. If a parent widget owns the keyboard model, that parent must move focus onto the active role=\u0022button\u0022 or point aria-activedescendant at it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs-website/src/components/ClickableImage/index.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5060022961d316a2e7e3616adb4478c6cc72aaf922fbc26c23492440a054a36"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs-website/src/components/ClickableImage/index.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cd1f581eb1272f5021625a2d085a52998b5f04c35a9f7003d305e6b63462f3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.spinner\u0060 moves (\u0060animation: spin 0.8s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs-website/src/theme/styles.module.css"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f03a5d07a345f345c280025a632d44ec3064c75d466dc22f8d66ce8bd3c459"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.footer-social-icon\u0060 moves (\u0060transition: opacity 0.2s ease, transform 0.2s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs-website/src/css/custom.css"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e86554c719ee2e6cc94b33a76fdfb6338cb143623cbb2a9be9e8d292eec6460"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.dropdownMenu\u0060 moves (\u0060animation: fadeIn 0.15s ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs-website/src/components/CopyDropdown/styles.module.css"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"574261b62bd2aa6332f1fbe8660122f3ff9b3998a750c8780164d29caa012e58"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is configured \u2014 defense in depth, even when a reverse proxy could set them. This is reported because \u0060vercel.json\u0060 configures this repository\u0027s static hosting, including its response headers, so the configuration that would carry these headers is in this repository and was read in full. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs-website/vercel.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0039f0af59816f9942e0c145b8c11020c32ae429295aa0bc8cf8df7857c4ffbf"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: docs-website/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs-website/package.json"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f65819a3bb1bbc79611d4a46cd8d228b74c7f77d3b9c1f538a420e96430160"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022outputs_to_state\u0022 in inner_data and inner_data[\u0022outputs_to_state\u0022]\u0060 appears character-identically in 2 files \u2014 haystack/tools/component_tool.py, haystack/tools/pipeline_tool.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/tools/component_tool.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"447374a4fb0436942ef27f2f70f2e1642c2fd2cb5bbac65888786bb374a8f99d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060answer.type != \u0022choice\u0022 or not isinstance(answer.choice, str) or answer.choice not in self.labels\u0060 appears character-identically in 2 files \u2014 haystack/components/routers/openai_decisions_image_router.py, haystack/components/routers/openai_decisions_text_router.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/openai_decisions_image_router.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b697e2c90aeabf7995421dc5cc2ec2e34e48cf19a83a01bd8ca6b67bc0dc00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060api_key is None and azure_ad_token is None\u0060 appears character-identically in 3 files \u2014 haystack/components/embedders/azure_document_embedder.py, haystack/components/embedders/azure_text_embedder.py, haystack/components/generators/chat/azure.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/azure_document_embedder.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb47f24681bef11e5a901929fcddadc28538c5adc93a388603d6063141b114f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060azure_endpoint or os.environ.get(\u0022AZURE_OPENAI_ENDPOINT\u0022)\u0060 appears character-identically in 3 files \u2014 haystack/components/embedders/azure_document_embedder.py, haystack/components/embedders/azure_text_embedder.py, haystack/components/generators/chat/azure.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/azure_document_embedder.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e73b178023041e7d047a1e915b6468957ff6a7fe451851422a35a044370896"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060custom_filters and not _is_unsafe_deserialization()\u0060 appears character-identically in 2 files \u2014 haystack/components/converters/output_adapter.py, haystack/components/routers/conditional_router.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/output_adapter.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8859a292dd5a48302b9d245b7b9e1bbf8aa99069023e5cdaf4e6bc81ab8cb106"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060documents and not isinstance(documents[0], Document)\u0060 appears character-identically in 3 files \u2014 haystack/components/embedders/mock_document_embedder.py, haystack/components/preprocessors/document_splitter.py, haystack/components/preprocessors/embedding_based_document_splitter.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/mock_document_embedder.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a93cbc90cb553d76741159bb401ea93d2d567ffe87de6cf2537ee25770c5f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060embedding is None and embedding_fn is None and dimension \u003C= 0\u0060 appears character-identically in 2 files \u2014 haystack/components/embedders/mock_document_embedder.py, haystack/components/embedders/mock_text_embedder.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/mock_document_embedder.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24f2da188f397ea523731758213b94ae89ba8648b0345bf1a0c3d30ee04c2f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060embedding is not None and embedding_fn is not None\u0060 appears character-identically in 2 files \u2014 haystack/components/embedders/mock_document_embedder.py, haystack/components/embedders/mock_text_embedder.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/mock_document_embedder.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"387874653172d9216ce569587bb9b1d17d5fdb76e34d87a7ccfe949faf14fd6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060init_params.get(\u0022unsafe\u0022) and not _is_unsafe_deserialization()\u0060 appears character-identically in 2 files \u2014 haystack/components/converters/output_adapter.py, haystack/components/routers/conditional_router.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/output_adapter.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15a077ba47ef3eb6a21130cc48257975516de70efe7385fa171b825b3044532"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(key, tuple) and tool_name in key\u0060 appears character-identically in 2 files \u2014 haystack/hooks/human_in_the_loop/strategies.py, haystack/hooks/tool_result_offloading/hooks.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/hooks/human_in_the_loop/strategies.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c723f30f4312d4b6339fe0e3933e5b4acab84204aad9645af4d2a78d2b34e48a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(tools, dict) and \u0022type\u0022 in tools and \u0022data\u0022 in tools or isinstance(tools, list) and isinstance(tools[0], dict) and \u0022type\u0022 in tool\u2026\u0060 appears character-identically in 2 files \u2014 haystack/components/generators/chat/azure_responses.py, haystack/components/generators/chat/openai_responses.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/azure_responses.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c61d9b4f13925573c37bd678a577645b7700534a71081b7b65223a847bc95ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key in doc.meta and doc.meta[key] is not None\u0060 appears character-identically in 2 files \u2014 haystack/components/embedders/openai_document_embedder.py, haystack/document_stores/in_memory/document_store.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/openai_document_embedder.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"1021b06956d4b5cff7b9393f56afd73759eefa147f5764b9a0a941bde64777bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(ground_truth_documents) == 0 or len(retrieved_documents) == 0\u0060 appears character-identically in 3 files \u2014 haystack/components/evaluators/document_map.py, haystack/components/evaluators/document_mrr.py, haystack/components/evaluators/document_recall.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/document_map.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"30943ad581c92e710a0fa233304528e7f30801bdb95023706455fe2d29894e55"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(self.variables) \u003E 0 and required_variables is None\u0060 appears character-identically in 2 files \u2014 haystack/components/builders/chat_prompt_builder.py, haystack/components/builders/prompt_builder.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/builders/chat_prompt_builder.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8468cf9fcca3652a4a4de1e7ee71c6887e29d2df6bec4d867cbbeaf75c5e455"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mime_type == bucket_key or pattern.fullmatch(mime_type)\u0060 appears character-identically in 2 files \u2014 haystack/components/routers/document_type_router.py, haystack/components/routers/file_type_router.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/document_type_router.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fb9dfec6af7a7638dff232dd6a4133e27a98e0b6e866a69a734a8149128a76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060min_confidence is not None and not 0 \u003C= min_confidence \u003C= 1\u0060 appears character-identically in 2 files \u2014 haystack/components/routers/openai_decisions_image_router.py, haystack/components/routers/openai_decisions_text_router.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/openai_decisions_image_router.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6fd3a395f8c232c18ffd3ea8305959b805fe40cfcacf60b35607bf50403a49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not has_content and not message.is_from(ChatRole.ASSISTANT)\u0060 appears character-identically in 2 files \u2014 haystack/components/generators/chat/openai_responses.py, haystack/utils/hf.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/openai_responses.py"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7d5f48f5e5dbd1a48d4f697dbabfa4601897dd388f66f540850afd2a047d3b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(batch_size, int) or batch_size \u003C 1\u0060 appears character-identically in 3 files \u2014 haystack/components/embedders/azure_document_embedder.py, haystack/components/embedders/openai_document_embedder.py, haystack/components/evaluators/sas_evaluator.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/azure_document_embedder.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c568262f456d711d3c8e4874e9886bd4299701dc481448dced5767219eb0da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(documents, list) or documents and not isinstance(documents[0], Document)\u0060 appears character-identically in 2 files \u2014 haystack/components/embedders/openai_document_embedder.py, haystack/components/preprocessors/document_cleaner.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/embedders/openai_document_embedder.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e165dbda169d550430e8562ed16fe2082cc2c75a495519dc394a88c210d6a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(query, str) or not query.strip()\u0060 appears character-identically in 2 files \u2014 haystack/components/query/query_expander.py, haystack/components/rankers/llm_ranker.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/query/query_expander.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd5c2aac0b2bcc751271d6c32b98fe22c0cd615be0abb92adc5da4da802fc39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, dict) or part not in value\u0060 appears character-identically in 4 files \u2014 haystack/components/evaluators/document_map.py, haystack/components/evaluators/document_mrr.py, haystack/components/evaluators/document_ndcg.py, haystack/components/evaluators/document_recall.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/evaluators/document_map.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1d9be8407535bd839fb809e5504f3dba3e2db740d6022f4938a9b9c36914f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not self.store_full_path and \u0022file_path\u0022 in bytestream.meta\u0060 appears character-identically in 5 files \u2014 haystack/components/converters/csv.py, haystack/components/converters/docx.py, haystack/components/converters/html.py, haystack/components/converters/msg.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/csv.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"138766e35aa5d6ff2cd2d9504609c8b542f4c8e20f2ddb146180e0d625659cb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response_format and isinstance(response_format, type) and issubclass(response_format, BaseModel)\u0060 appears character-identically in 2 files \u2014 haystack/components/generators/chat/azure.py, haystack/components/generators/chat/openai.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/azure.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac33c1f57f4dd0fa1fa3c94bf4b0d5391de2536e0e4ff117f9b7477aee407a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.min_confidence is not None and answer.confidence \u003C self.min_confidence\u0060 appears character-identically in 2 files \u2014 haystack/components/routers/openai_decisions_image_router.py, haystack/components/routers/openai_decisions_text_router.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/openai_decisions_image_router.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ad1d8a6712c45e9b6d80e1f3c08a7c7ed880aaeaf7d103fee8e3df29fc0aa4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.required_variables == \u0022*\u0022 or var in self.required_variables\u0060 appears character-identically in 2 files \u2014 haystack/components/builders/chat_prompt_builder.py, haystack/components/builders/prompt_builder.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/builders/chat_prompt_builder.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9eff888d12684ba7dd55195288e0f1738c79cb0c1d5d90200d8f7e25c240d06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.tools and isinstance(self.tools, list) and isinstance(self.tools[0], dict)\u0060 appears character-identically in 2 files \u2014 haystack/components/generators/chat/azure_responses.py, haystack/components/generators/chat/openai_responses.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/azure_responses.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2ab874973bf59729d4ec1d8decb9068e20096ee65eebe5bd5dd51ee6836c3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text is not None and not isinstance(text, str)\u0060 appears character-identically in 2 files \u2014 haystack/components/converters/json.py, haystack/components/routers/openai_decisions_image_router.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/json.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3713bc5edb3450dadee7ba0d62861612c21b014f47300ab7e40b1210b9ce4658"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text_format and isinstance(text_format, type) and issubclass(text_format, BaseModel)\u0060 appears character-identically in 2 files \u2014 haystack/components/generators/chat/azure_responses.py, haystack/components/generators/chat/openai_responses.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/generators/chat/azure_responses.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"964840c708efb0ba35486e2bba86ea2a885a10e00e886946f2775d1836fa8d5b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060serialize_hf_model_kwargs\u0060 is public and takes \u0060kwargs: dict[str, Any]\u0060 from its caller, and it calls itself at line 31 (\u0060serialize_hf_model_kwargs\u0060) with a piece of \u0060kwargs\u0060 \u2014 and nowhere in \u0060serialize_hf_model_kwargs\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060serialize_hf_model_kwargs\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/hf.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02ab5fbe29e4e657b8902ec86ffba81ddc201a9dd3f0477a9eff619b0cbda55"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deserialize_hf_model_kwargs\u0060 is public and takes \u0060kwargs: dict[str, Any]\u0060 from its caller, and it calls itself at line 51 (\u0060deserialize_hf_model_kwargs\u0060) with a piece of \u0060kwargs\u0060 \u2014 and nowhere in \u0060deserialize_hf_model_kwargs\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060deserialize_hf_model_kwargs\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/hf.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f40261adf7aba3f647a8c812f96234a541ceed8f5aa08610962873bf1ab4215"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060serialize_type\u0060 is public and takes \u0060target: Any\u0060 from its caller, and it calls itself at line 102 (\u0060serialize_type\u0060) with a piece of \u0060target\u0060 \u2014 and nowhere in \u0060serialize_type\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060serialize_type\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/type_serialization.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e33393044a18cb78425408f712e11d3312fd65859f851d4eed95f5eb6e199f6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060coerce_tag_value\u0060 is public, takes a document from its caller (line 15) and hands it to \u0060_serializable_value\u0060, which calls itself at line 58 (\u0060_serializable_value\u0060) with a piece of \u0060value\u0060 (and at line 61, line 64, line 67) \u2014 and nowhere in \u0060_serializable_value\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_serializable_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/tracing/utils.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6694b7e30373a544ca914ce4a92f73836488a3c703c8365d6437024d2d94db0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060component_to_dict\u0060 is public, takes a document from its caller (line 43) and hands it to \u0060check_dict\u0060, which calls itself at line 124 (\u0060check_dict\u0060) with a piece of \u0060d\u0060 \u2014 and nowhere in \u0060check_dict\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060check_dict\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/serialization.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dd6a424ff5c62215ff21b190688768e83c1f5fec210e565a522e96197e0b6c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060default_from_dict\u0060 is public and takes \u0060data: dict[str, Any]\u0060 from its caller, and it calls itself at line 334 (\u0060default_from_dict\u0060) with a piece of \u0060data\u0060 \u2014 and nowhere in \u0060default_from_dict\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060default_from_dict\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/core/serialization.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ce2933f8a7715a7229fcae592b65515d9d6e43c26a197ef23e9af3cd41ee6a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060run\u0060 is public, takes a document from its caller (line 403) and hands it to \u0060_output_matches_type\u0060, which calls itself at line 600 (\u0060self._output_matches_type\u0060) with a piece of \u0060value\u0060 (and at line 612) \u2014 and nowhere in \u0060_output_matches_type\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_output_matches_type\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/routers/conditional_router.py"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"245de52cd303304631ce88ebb1758604afdaa7328817a078843fd3b223411194"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/utils/misc.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3f6e1717c64e7dd277cc12ffa918ed15f81047d5778c8c97b45ef7bc98b055"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"haystack/components/converters/csv.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d7e1972c3fe8b01935bc7924ca728c57e19b2ecb122b151b75ff9b5e209a6b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_parse_frontmatter\u0060 returns \u0060{}\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_platform_components_table.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"923f664ebca61993fc2b5696021a146d3515319e66fc3fec083450836c859bf8"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"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":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-807","guid":"7b9d7bab-2171-935b-9279-889089164770","name":"Reliance on Untrusted Inputs in a Security Decision","shortDescription":{"text":"Reliance on Untrusted Inputs in a Security Decision"},"helpUri":"https://cwe.mitre.org/data/definitions/807.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":34,"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."]}]}