{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"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":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"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":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"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":"chat_models._format_messages (cyclomatic 95): chat_models._format_messages has cyclomatic complexity 95 (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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc032a125a35fc7be056de667cce9c2cf61ceb67a5bf43ed4bb6e552a4bf0c5"}},{"ruleId":"D1","level":"warning","message":{"text":"factory.create_agent (cyclomatic 78): factory.create_agent has cyclomatic complexity 78 (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":"libs/langchain_v1/langchain/agents/factory.py"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cf88d40ced054a4420f44396f4058639c61fe850155a09ea76986d415fe12a"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.convert_to_openai_messages (cyclomatic 77): utils.convert_to_openai_messages has cyclomatic complexity 77 (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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b7c4d3b98fa7419945b52dfd5c09e7cbd77b27550351ebdabcfcc29020bb36"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatAnthropic._get_request_payload (cyclomatic 73): ChatAnthropic._get_request_payload has cyclomatic complexity 73 (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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"a477629fcb153013238f22047c909a4d3917ef9396840e394c6ece77db19bf6d"}},{"ruleId":"D1","level":"warning","message":{"text":"langchain_v0._convert_legacy_v0_content_block_to_v1 (cyclomatic 57): langchain_v0._convert_legacy_v0_content_block_to_v1 has cyclomatic complexity 57 (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":"libs/core/langchain_core/messages/block_translators/langchain_v0.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cf8969fafab5f0cb9eb91204d93f610155f404786369bd0a259713efe5e44f"}},{"ruleId":"D1","level":"warning","message":{"text":"manager._configure (cyclomatic 55): manager._configure has cyclomatic complexity 55 (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":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6d0891a3c3194accf24cbb174517c3127e38b594919357c7542facf1f50765"}},{"ruleId":"D1","level":"warning","message":{"text":"base._construct_responses_api_input (cyclomatic 54): base._construct_responses_api_input has cyclomatic complexity 54 (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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":4938}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a2ded355d20dd11f37e84fa7dee628b07aeef79b44008230827bb1a7b319c4"}},{"ruleId":"D1","level":"warning","message":{"text":"google_genai._convert_to_v1_from_genai (cyclomatic 52): google_genai._convert_to_v1_from_genai has cyclomatic complexity 52 (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":"libs/core/langchain_core/messages/block_translators/google_genai.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef21e5bc20c3b22bfc3b5efd76aa4aedb22a0cdb9e4e1a44cfc5b2cc0b978b2"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatAnthropic._make_message_chunk_from_anthropic_event (cyclomatic 50): ChatAnthropic._make_message_chunk_from_anthropic_event has cyclomatic complexity 50 (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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cb925d984f3f0bfe8491a586312555c344f04bbf87d51a46cb6e723f1864b6"}},{"ruleId":"D1","level":"warning","message":{"text":"langchain_classic.__getattr__ (cyclomatic 47): langchain_classic.__getattr__ has cyclomatic complexity 47 (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":"libs/langchain/langchain_classic/__init__.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae12f6714a6c20a8ed4d5e4a2a72dc6a9e6d031740680ae4e2195dc99de190a"}},{"ruleId":"D1","level":"warning","message":{"text":"_compat._consolidate_calls (cyclomatic 47): _compat._consolidate_calls has cyclomatic complexity 47 (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":"libs/partners/openai/langchain_openai/chat_models/_compat.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"231df87b898cb6771697901ec58717d7e6cde66a03d5a691d065ae2478ddc339"}},{"ruleId":"D1","level":"warning","message":{"text":"_compat._convert_from_v1_to_responses (cyclomatic 43): _compat._convert_from_v1_to_responses has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/_compat.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"b774266d13f1dbed001a12dfeb01fdc46f61cc17faa13054ede21ee494e37170"}},{"ruleId":"D1","level":"warning","message":{"text":"Crawler.crawl (cyclomatic 42): Crawler.crawl 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":"libs/langchain/langchain_classic/chains/natbot/crawler.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbf478a3c95644dcb90ebf0c7530224ac487608f934710750e5cd5b619adb39"}},{"ruleId":"D1","level":"warning","message":{"text":"_compat._convert_from_v1_to_anthropic (cyclomatic 41): _compat._convert_from_v1_to_anthropic has cyclomatic complexity 41 (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":"libs/partners/anthropic/langchain_anthropic/_compat.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"909cc29535870964df40c6bdad06b41b747133fff9b8bd5acd2d98b2157e8b36"}},{"ruleId":"D1","level":"warning","message":{"text":"base._convert_responses_chunk_to_generation_chunk (cyclomatic 41): base._convert_responses_chunk_to_generation_chunk has cyclomatic complexity 41 (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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":5408}}}],"partialFingerprints":{"codehealthFindingId/v1":"efebff2a68691108c0064954a2737b33e8eb373c9856c235fb2eb0eac6200eec"}},{"ruleId":"D1","level":"warning","message":{"text":"utils._first_max_tokens (cyclomatic 38): utils._first_max_tokens has cyclomatic complexity 38 (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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d047953d5219eaedde257bd79cdac588a8953aa40df7a1720cc62dc86e9213"}},{"ruleId":"D1","level":"warning","message":{"text":"api.aindex (cyclomatic 37): api.aindex has cyclomatic complexity 37 (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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e7d544a66baac876eca4468f8bd4e7a557235e5597a209940d589e07185387"}},{"ruleId":"D1","level":"warning","message":{"text":"HuggingFacePipeline.from_model_id (cyclomatic 37): HuggingFacePipeline.from_model_id has cyclomatic complexity 37 (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":"libs/partners/huggingface/langchain_huggingface/llms/huggingface_pipeline.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"23577681ec8f3b3f92a4e8464b77dfd107bf921d733e476527d5b78dfcc30cfe"}},{"ruleId":"D1","level":"warning","message":{"text":"base._construct_responses_api_payload (cyclomatic 36): base._construct_responses_api_payload has cyclomatic complexity 36 (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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c84227f38b7ae5934d6ef7b8002f7346a9e7e95f8b07974ca7b8e5b9595668"}},{"ruleId":"D1","level":"warning","message":{"text":"api.index (cyclomatic 35): api.index has cyclomatic complexity 35 (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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"88865639e832a93cc6f165d7bfc35890ea81f340f21265276f92f5ba6e446ce9"}},{"ruleId":"D1","level":"warning","message":{"text":"_ChatModelStreamBase._push_content_block_delta (cyclomatic 35): _ChatModelStreamBase._push_content_block_delta has cyclomatic complexity 35 (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":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8171d0c911829670758bc97cf786e89b85a2abfba2c23ab7eea402179d4fdae"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatModel._generate_with_cache (cyclomatic 35): BaseChatModel._generate_with_cache has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BaseChatModel._agenerate_with_cache) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"babe3c98c6197612c43f5e66586565ab6110cc44b9dadca47e66db644ee5a8b4"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatModel._agenerate_with_cache (cyclomatic 35): BaseChatModel._agenerate_with_cache has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BaseChatModel._generate_with_cache) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"929d967ec37a0178ffc26691f3ea62906e0a93054a92e1be44ce379d7d9e6c4b"}},{"ruleId":"D1","level":"warning","message":{"text":"_compat_bridge._accumulate (cyclomatic 34): _compat_bridge._accumulate 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":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4bb4bd81b3b114bf18e5522a93c9c52becf3419abe2535967275cf2dac802e"}},{"ruleId":"D1","level":"warning","message":{"text":"mustache.render (cyclomatic 34): mustache.render 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":"libs/core/langchain_core/utils/mustache.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e2c1c679f382f932d49bec3117fd2705093ccdd812453cfceda3848fdf1b69"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.get_buffer_string (cyclomatic 32): utils.get_buffer_string has cyclomatic complexity 32 (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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fd0a3eb83bf8b07132ea4a6428f5915a2c841a233c787bea3e9055dedfcc88"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._convert_chunk_to_message_chunk (cyclomatic 32): chat_models._convert_chunk_to_message_chunk has cyclomatic complexity 32 (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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7171d8e0e3c7f98018911cafe5aa27ddb1e6deaf3aac1cc38b361ac57f97759"}},{"ruleId":"D1","level":"warning","message":{"text":"base._get_builtin_translator (cyclomatic 31): base._get_builtin_translator has cyclomatic complexity 31 (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":"libs/langchain/langchain_classic/retrievers/self_query/base.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84299ead108c28f910aef9cb79bf41fcc689eee3154b386edbb8eb6efaaea6f"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPerplexity._stream (cyclomatic 31): ChatPerplexity._stream has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (ChatPerplexity._astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cb13367ee16cf1066a08295fa528755a770859763fcaa847e1bd69ae943868"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPerplexity._astream (cyclomatic 31): ChatPerplexity._astream has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (ChatPerplexity._stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"195b3a7dc8ce408c9c1b94a92b19b83a6b74ed4b40ca1fe22206c951191ce649"}},{"ruleId":"D1","level":"warning","message":{"text":"function_calling.convert_to_openai_function (cyclomatic 29): function_calling.convert_to_openai_function has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/utils/function_calling.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e592eb35d9b1405a387702592de909f53172f39dd6128e6e72981e4c901413"}},{"ruleId":"D1","level":"warning","message":{"text":"_compat._convert_annotation_from_v1 (cyclomatic 29): _compat._convert_annotation_from_v1 has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/anthropic/langchain_anthropic/_compat.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff0dc8b876a30db012b0c3833062c2c68dad474ff54b5030d819e15a3f16dce"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._convert_chunk_to_message_chunk (cyclomatic 29): chat_models._convert_chunk_to_message_chunk has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0ca61cdc06194a6bbfe35492557c96b220fbd4a374a8339629a2f76090eb35"}},{"ruleId":"D1","level":"warning","message":{"text":"utils._format_content_block_xml (cyclomatic 28): utils._format_content_block_xml has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22891725d8654f62594c6b103f29b99506629a3be0161f306087e0ab051fd26"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._format_data_content_block (cyclomatic 28): chat_models._format_data_content_block 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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cd6943564bb89e96488af5ad026183087a8732ee113a916cc6526697c4d06f"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatOllama._convert_messages_to_ollama_messages (cyclomatic 28): ChatOllama._convert_messages_to_ollama_messages has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/ollama/langchain_ollama/chat_models.py"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65259dde68535ab1c8d23e1b3ef50f1b8e7a7c49b5da27f6ca6ff7093681e64"}},{"ruleId":"D1","level":"warning","message":{"text":"RecursiveCharacterTextSplitter.get_separators_for_language (cyclomatic 28): RecursiveCharacterTextSplitter.get_separators_for_language 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":"libs/text-splitters/langchain_text_splitters/character.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"595a6e11677ebffda0061842a830280eea90fbf4561bb78a3c28525915efa4a4"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseLLM.generate (cyclomatic 27): BaseLLM.generate has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"d501dd073b37300747ac3b0604459d598e51fbbec199151610035bdaeb9e7ed9"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.filter_messages (cyclomatic 27): utils.filter_messages has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5adc83087635eabb1095da0f06faae4a97d8104f9f3ea2b64c204ee88aff13b"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseTool._parse_input (cyclomatic 27): BaseTool._parse_input has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"648ac034d28882aa8b2a4712f3ea5f443949f1c342f6533fc0c200f0c3a50cf4"}},{"ruleId":"D1","level":"warning","message":{"text":"base._construct_lc_result_from_responses_api (cyclomatic 27): base._construct_lc_result_from_responses_api has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":5195}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff54fbd928e26e89a6be00e37d4158cfc60d423b8fb2fe507fc3b6186cac6c2"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseLLM.agenerate (cyclomatic 26): BaseLLM.agenerate 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":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aed95e05452d1d984260871966f9220742137e2a25bc42c0c7af17070b103c"}},{"ruleId":"D1","level":"warning","message":{"text":"openai._convert_from_v03_ai_message (cyclomatic 26): openai._convert_from_v03_ai_message 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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61cccea12270a4c2660b91a91cbd76bb9fcc310649129db3406850f165aeb2d"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.count_tokens_approximately (cyclomatic 26): utils.count_tokens_approximately 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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":2262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dbee5cfced928fdd935b0c01df37a09a8f666d5875f2cb10bafebb4d37b84e"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._convert_chunk_to_message_chunk (cyclomatic 26): chat_models._convert_chunk_to_message_chunk 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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"46352dd6a39cb5be3475e1254e52df66bd95db50b387c2e25e8b1b86a3f7b7dd"}},{"ruleId":"D1","level":"warning","message":{"text":"AzureChatOpenAI.validate_environment (cyclomatic 26): AzureChatOpenAI.validate_environment 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":"libs/partners/openai/langchain_openai/chat_models/azure.py"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a52a2b94a542ee023681db35d19425f0e77c5c8b8cb62b78cd7bf5291c34ae0"}},{"ruleId":"D1","level":"warning","message":{"text":"base._init_chat_model_helper (cyclomatic 25): base._init_chat_model_helper has cyclomatic complexity 25 (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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"726b71e1dc1a2bc5c82d30ccd902778761a401537b2beb53d13fec0d60e9e2b8"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatOpenAI.validate_environment (cyclomatic 25): BaseChatOpenAI.validate_environment has cyclomatic complexity 25 (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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0de207bdfbf34cd2fd6e9fe0a04617f5411287de0ad41ebefceec579771202e"}},{"ruleId":"D1","level":"warning","message":{"text":"base._convert_message_to_dict (cyclomatic 25): base._convert_message_to_dict has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf074d52213e3b3ec627fb377784846c2d3175e9fa01a9ff46c3e797fa044b7"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._convert_responses_stream_event_to_chunk (cyclomatic 25): chat_models._convert_responses_stream_event_to_chunk has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"774a052078a2f09ef086173216f70856b13faeb60e80e57046e34a84f03a4143"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownHeaderTextSplitter.split_text (cyclomatic 25): MarkdownHeaderTextSplitter.split_text has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/text-splitters/langchain_text_splitters/markdown.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fac00b597ff89d2455960a6bfa2b21d011cc6e50db63a0126d70779b69c759b"}},{"ruleId":"D1","level":"warning","message":{"text":"_policy._ip_in_blocked_networks (cyclomatic 24): _policy._ip_in_blocked_networks 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":"libs/core/langchain_core/_security/_policy.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b639728ba8a114609c3c566c86f1f38be26c2228815e47317b404acbd85a25ca"}},{"ruleId":"D1","level":"warning","message":{"text":"openai.convert_to_openai_data_block (cyclomatic 24): openai.convert_to_openai_data_block 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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d759b3cacebcb0fcbe8cc958f92fc12c2284a24c561ae0acf4188faf2d0067ac"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnableSequence.batch (cyclomatic 24): RunnableSequence.batch 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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3525}}}],"partialFingerprints":{"codehealthFindingId/v1":"14702ed001dc06846125b9193409bdea6e3cd5a9ac34f5f59e3436d202b32f26"}},{"ruleId":"D1","level":"warning","message":{"text":"config.merge_configs (cyclomatic 24): config.merge_configs 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":"libs/core/langchain_core/runnables/config.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b5c886eb9025c632e4b78d4f20ec6a54deaaf48403df63e002b6f3025a2746"}},{"ruleId":"D1","level":"warning","message":{"text":"function_calling._parse_google_docstring (cyclomatic 24): function_calling._parse_google_docstring 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":"libs/core/langchain_core/utils/function_calling.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"8345407b70b47281c9e5c663354857200c8b60244fb84f9cd4e87f2f37028ee4"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._convert_message_to_dict (cyclomatic 24): chat_models._convert_message_to_dict 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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf99b5cf4b2a5dcbec3bed7762a43236a35047d6c7650ca8f9153da916454ffb"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnableSequence.abatch (cyclomatic 23): RunnableSequence.abatch 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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3653}}}],"partialFingerprints":{"codehealthFindingId/v1":"6606196024ed132cd8f9e8f211136ec33982a35ffbaa3bfcbfac3862aad957c7"}},{"ruleId":"D1","level":"warning","message":{"text":"_merge.merge_lists (cyclomatic 23): _merge.merge_lists 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":"libs/core/langchain_core/utils/_merge.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d2eea30b4eb335c4c0f62e181b2a5de35a6e3d9bdc89b9558bc6c786c68101"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatAnthropic.bind_tools (cyclomatic 23): ChatAnthropic.bind_tools 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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf1a3ba4f6dae6435c737599beefeda4f56f885544a81d167af3df56234287e"}},{"ruleId":"D1","level":"warning","message":{"text":"base._format_message_content (cyclomatic 23): base._format_message_content 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a46d604dd848141e8d3932c38829de52fc60f31072aa9ade4fab1d81286a5d3"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatAnthropic._format_output (cyclomatic 22): ChatAnthropic._format_output 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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce817f8b7c67714be84578a353068339d1a4ce135ce56a877d60e142f687b6c"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatFireworks._stream (cyclomatic 22): ChatFireworks._stream has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (ChatFireworks._astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca49975144dc36814dc45be6d1a04cd597bd5f5a978c8bc640847257b7bf0af8"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatFireworks._astream (cyclomatic 22): ChatFireworks._astream has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (ChatFireworks._stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f03adcc29ae55706acff16b48112da7b435c81abd5958f0630e96098dfc838"}},{"ruleId":"D1","level":"warning","message":{"text":"_compat._convert_to_v1_from_mistral (cyclomatic 22): _compat._convert_to_v1_from_mistral 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":"libs/partners/mistralai/langchain_mistralai/_compat.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4b8f0ec66352458aadb986f367d5d7cbdcd58e575cd89af4c4771b02bd96bf"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._convert_message_to_mistral_chat_message (cyclomatic 22): chat_models._convert_message_to_mistral_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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ba4e0d08843e1647ddc2154986e1a73cf7e3b4fd5ac5d0b4f8e3920e7cfdc0"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatOpenAI.bind_tools (cyclomatic 22): BaseChatOpenAI.bind_tools 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d82df5a91e929a4f7ad049cea9d35fe26f16c088a6106b8bfcc2607f0ba2a2"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._convert_message_to_dict (cyclomatic 22): chat_models._convert_message_to_dict 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":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a46e4cef3d58d52ccf833689da4f46605f90e6940fea13d90bf8b952f6de117"}},{"ruleId":"D1","level":"warning","message":{"text":"_utils.is_openai_data_block (cyclomatic 21): _utils.is_openai_data_block has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/_utils.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab68d4c4d3939d696632fe99611f72f715ad53b2ac01749d6516bec57d612c3"}},{"ruleId":"D1","level":"warning","message":{"text":"_ChatModelStreamBase._push_content_block_finish (cyclomatic 21): _ChatModelStreamBase._push_content_block_finish has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8ad99449e8c1417d9277651e30e25902ada709818a85130301e8e60f9bbef0"}},{"ruleId":"D1","level":"warning","message":{"text":"utils._create_message_from_message_type (cyclomatic 21): utils._create_message_from_message_type has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc80d5171582e06a6b739ee7d14d88298e795415ab8de258652e7d8d2c2e748"}},{"ruleId":"D1","level":"warning","message":{"text":"graph_mermaid.draw_mermaid (cyclomatic 21): graph_mermaid.draw_mermaid has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/graph_mermaid.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b4fdeb78f0ba1fc8f82374c5360955a4e51f0b87144e403b3dfba1e42afbf6"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatAnthropic._assert_valid_model_configuration (cyclomatic 21): ChatAnthropic._assert_valid_model_configuration has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b035e6c77919c24b81dbfaebf808b9fc96bd1f7dd4a6258a3f9cc51efd69cf6"}},{"ruleId":"D1","level":"warning","message":{"text":"_compat._convert_from_v1_to_groq (cyclomatic 21): _compat._convert_from_v1_to_groq has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/groq/langchain_groq/_compat.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01461ffd6b7e5cfb7ab61afdc0d3383c529450e67072170ef2a2f250e0bfe18"}},{"ruleId":"D1","level":"warning","message":{"text":"_compat._convert_from_v1_to_mistral (cyclomatic 21): _compat._convert_from_v1_to_mistral has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/mistralai/langchain_mistralai/_compat.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c682f24dc57dbca43976a78907ce66530c2b6ccd046945a69f4264fd0147690c"}},{"ruleId":"D1","level":"warning","message":{"text":"_compat._convert_to_v03_ai_message (cyclomatic 21): _compat._convert_to_v03_ai_message has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/_compat.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b990aeaaab5b2c3f2ebf3d46835bd0e427c527497e2f43f49f6baf3fb42a9db7"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatOpenAI.get_num_tokens_from_messages (cyclomatic 21): BaseChatOpenAI.get_num_tokens_from_messages has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"59debfaeb8acc24fb29c27684d809aceda817980d7d87033f3561294d8e9ec44"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._convert_chunk_to_message_chunk (cyclomatic 21): chat_models._convert_chunk_to_message_chunk has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c7cc9765dd299fd726f82cdce2f7ca1828c6e4c689a4ade9f25b7fae079a21"}},{"ruleId":"D1","level":"warning","message":{"text":"Reviver.__call__ (cyclomatic 20): Reviver.__call__ 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":"libs/core/langchain_core/load/load.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc72b60360a63fa43a6e8706aa2fd4e8508d1475441ea66338b2edd9977d9d0"}},{"ruleId":"D1","level":"warning","message":{"text":"_StringImageMessagePromptTemplate.from_template (cyclomatic 20): _StringImageMessagePromptTemplate.from_template 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":"libs/core/langchain_core/prompts/chat.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bbc39a950ec2c28bcedbb9e074296f5cab9f4534b898ef8a508d8fd098f321"}},{"ruleId":"D1","level":"warning","message":{"text":"base.create_schema_from_function (cyclomatic 20): base.create_schema_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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"905b1a63eaa993b15e0bfc2050eb62706493dc0b1cb17266fb5ddbf0e2fad1c7"}},{"ruleId":"D1","level":"warning","message":{"text":"json.parse_partial_json (cyclomatic 20): json.parse_partial_json 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":"libs/core/langchain_core/utils/json.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d6ca9aea99d936423be6c906f51cd1568aea016b35ad16f557d513e691a921"}},{"ruleId":"D1","level":"warning","message":{"text":"huggingface._convert_chunk_to_message_chunk (cyclomatic 20): huggingface._convert_chunk_to_message_chunk 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":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b273629f33f480a0ef85f53abe9aa693370c6ac4651300ce7a8638001ab0981"}},{"ruleId":"D1","level":"warning","message":{"text":"base._convert_delta_to_message_chunk (cyclomatic 20): base._convert_delta_to_message_chunk 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9eb115c98bac9a39133d59f9132d71c34b6baf7e75d7397f99552559cc07257"}},{"ruleId":"D1","level":"warning","message":{"text":"AzureOpenAI.validate_environment (cyclomatic 20): AzureOpenAI.validate_environment 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":"libs/partners/openai/langchain_openai/llms/azure.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad105628f9e77348af0ed6e942b788231ba60835bb949d2024ca0b1e8275e232"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPerplexity._to_responses_payload (cyclomatic 20): ChatPerplexity._to_responses_payload 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":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7a4b7a459008ea86193b26a9f019a16bbaef5a2d600b9e60f252548c60b41f"}},{"ruleId":"D1","level":"warning","message":{"text":"Serializable.to_json (cyclomatic 19): Serializable.to_json 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":"libs/core/langchain_core/load/serializable.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5c0d207f5f198a4fca4b7a7b56fde3e72517e055e42ee7fbe320e80c0f4075"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnableWithFallbacks.batch (cyclomatic 19): RunnableWithFallbacks.batch 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":"libs/core/langchain_core/runnables/fallbacks.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74f9a8cbf35a3a5fefd6b255ac3cf9470476a430a5c9f7b7c63ab73d28750aa"}},{"ruleId":"D1","level":"warning","message":{"text":"StructuredTool.from_function (cyclomatic 19): StructuredTool.from_function has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/tools/structured.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d44d0eae61a06ee8749ce36ccb9a5cbd6a912259f31d740d29d2787a4215a77"}},{"ruleId":"D1","level":"warning","message":{"text":"_merge.merge_dicts (cyclomatic 19): _merge.merge_dicts 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":"libs/core/langchain_core/utils/_merge.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf2b3283254ba6c2c9274a8696b38094ba4f2e77ecc9d4b413adc051d594e00"}},{"ruleId":"D1","level":"warning","message":{"text":"PIIMiddleware.before_model (cyclomatic 19): PIIMiddleware.before_model 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":"libs/langchain_v1/langchain/agents/middleware/pii.py"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c0ea12ab47e60df21897c8ba2107ed1a3e52579279d045fc50e7f987288344"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._convert_message_to_dict (cyclomatic 19): chat_models._convert_message_to_dict 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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a419ea103d8e8f130dead70588319edda4e7540234263c47f6ccc7c2d08030f3"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatOpenAI._create_chat_result (cyclomatic 19): BaseChatOpenAI._create_chat_result 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"983d358063434f030c021254619db5b86518674249f3de1ff34698790f27a3d2"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatOpenAI.with_structured_output (cyclomatic 19): BaseChatOpenAI.with_structured_output 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2620}}}],"partialFingerprints":{"codehealthFindingId/v1":"13752b4b81d9aa89f03b7d68bba1026de37be78a7473dd532593f42703f5e5d3"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatOpenRouter._create_chat_result (cyclomatic 19): ChatOpenRouter._create_chat_result 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":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dad52c52cd0be2c00d6c648d81aab4e9e51d8b6b27ce53b9573b12a693e05c7"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatModel.stream (cyclomatic 18): BaseChatModel.stream 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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"044247bfc21329b93a02391f33aa04e6577252dd6c4b8613d29f5f6d552e8816"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatModel.astream (cyclomatic 18): BaseChatModel.astream 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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4c8c45b08ccd1449c6fd4f78dc58d22a40dbad9c83bc0f6447b332e6e9163e"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatModel._get_ls_params (cyclomatic 18): BaseChatModel._get_ls_params 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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f55073928d041ce0a644563dd40c60c81fea2397df5797437778d9c5239183"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericFakeChatModel._stream (cyclomatic 18): GenericFakeChatModel._stream 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":"libs/core/langchain_core/language_models/fake_chat_models.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e34b7211b438b0ff6ee8f8da0a7a163aabcad50700066592a0ff0aa0c4c527"}},{"ruleId":"D1","level":"warning","message":{"text":"groq._convert_to_v1_from_groq (cyclomatic 18): groq._convert_to_v1_from_groq 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":"libs/core/langchain_core/messages/block_translators/groq.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b90f67121fd302ea47379cdabcb091132e66842dec2b9a14b931339812ab5e3"}},{"ruleId":"D1","level":"warning","message":{"text":"PydanticToolsParser.parse_result (cyclomatic 18): PydanticToolsParser.parse_result 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":"libs/core/langchain_core/output_parsers/openai_tools.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"293d82afac3c9244b43f749cfdd3e7e0bc5487fe10cfb7e24da4950d3fb8c5ef"}},{"ruleId":"D1","level":"warning","message":{"text":"event_stream._astream_events_implementation_v1 (cyclomatic 18): event_stream._astream_events_implementation_v1 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":"libs/core/langchain_core/tracers/event_stream.py"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"7957f6dbacf7156f1579d4b368f4fa0091f5d5388514b6b1393348cdade64c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"HumanInTheLoopMiddleware.after_model (cyclomatic 18): HumanInTheLoopMiddleware.after_model 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":"libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.py"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf25c723d5c3809a19a217d0d3bb745ad00ed333d7b0cda633ee8835109f8685"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatOpenAI._stream (cyclomatic 18): BaseChatOpenAI._stream 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. This shape REPEATS in the file: one other method here (BaseChatOpenAI._astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"90639a600b2391a196e95b459777342b50043d17f18768ce0d1dc316635467a7"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatOpenAI._generate (cyclomatic 18): BaseChatOpenAI._generate 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e73e0f7aa6b3b37782232329780e048a86233a04f4afc95df72e3ac36bda300"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatOpenAI._astream (cyclomatic 18): BaseChatOpenAI._astream 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. This shape REPEATS in the file: one other method here (BaseChatOpenAI._stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"90673634ad673dd7ca74cd60a896f0ce350fa35327c4fdcd2fb9674627dc44d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPerplexity._convert_delta_to_message_chunk (cyclomatic 18): ChatPerplexity._convert_delta_to_message_chunk 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":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87ed455d5c574b253f257fbcd1369732ee9e0cab35229ccad39bb97d7c961c5"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPerplexity._generate (cyclomatic 18): ChatPerplexity._generate 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. This shape REPEATS in the file: one other method here (ChatPerplexity._agenerate) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c2a775c6565a757d57a7406e0a7373e6486eac1df46462d9601ff6596f8403"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPerplexity._agenerate (cyclomatic 18): ChatPerplexity._agenerate 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. This shape REPEATS in the file: one other method here (ChatPerplexity._generate) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09eb4859d1ff3c79175bd68f388f4fd42ebcb75373dcbcf5d31388b93a7c47f"}},{"ruleId":"D1","level":"warning","message":{"text":"HTMLHeaderTextSplitter._generate_documents (cyclomatic 18): HTMLHeaderTextSplitter._generate_documents 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":"libs/text-splitters/langchain_text_splitters/html.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"619cfa1e8674d7a1c045b2c1b619b74818f372e095053ccb675c4805a013e557"}},{"ruleId":"D1","level":"warning","message":{"text":"openai._convert_openai_format_to_data_block (cyclomatic 17): openai._convert_openai_format_to_data_block 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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf9baf52702352b822d95c3ff93421cf4b8a90c59225fad9b56b7fe1ae95956"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonOutputKeyToolsParser.parse_result (cyclomatic 17): JsonOutputKeyToolsParser.parse_result 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":"libs/core/langchain_core/output_parsers/openai_tools.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9eaeb097db9ae6c401e8069da33b084c9409ce563cebbc13da2f498dc70f15"}},{"ruleId":"D1","level":"warning","message":{"text":"RunnableWithFallbacks.abatch (cyclomatic 17): RunnableWithFallbacks.abatch 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":"libs/core/langchain_core/runnables/fallbacks.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d497b9b734df5268595167710fe4f45728ba4fecf2129eeeec9e6af5483866"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseTool.arun (cyclomatic 17): BaseTool.arun has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca65cf2f07713ee0fb15b03082c3affe902e655ee90793138b3716dcbc63dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"LogStreamCallbackHandler.include_run (cyclomatic 17): LogStreamCallbackHandler.include_run has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/tracers/log_stream.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb76656ab048bd6cdb954d2b7674e57c9da89334e4ed85eddf7fd1986152e64"}},{"ruleId":"D1","level":"warning","message":{"text":"function_calling._recursive_set_additional_properties_false (cyclomatic 17): function_calling._recursive_set_additional_properties_false 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":"libs/core/langchain_core/utils/function_calling.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"28696fc85ec0533759134067f5d627b162110abb99736c9213feff6dba119513"}},{"ruleId":"D1","level":"warning","message":{"text":"mustache._get_key (cyclomatic 17): mustache._get_key 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":"libs/core/langchain_core/utils/mustache.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"004f0fe4e62c4a737404e8384d39565e88ab8e6c98d48a6a3fdf0a5881684d23"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._convert_dict_to_message (cyclomatic 17): chat_models._convert_dict_to_message 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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3913aff0afa658e3788c1cf38f039d5f651265fadedabc5aec50a167c7b2b90"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatOpenAI._convert_chunk_to_generation_chunk (cyclomatic 17): BaseChatOpenAI._convert_chunk_to_generation_chunk has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a79490495b376f92e35c1d1cba4f49cef66f70b3c74a4d3ab7c854d0dad5126"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatPerplexity._default_params (cyclomatic 17): ChatPerplexity._default_params has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"18519d3d84569789359eb92a9f16035661347c12e6a4f9616980138bd479ee0d"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._convert_responses_to_chat_result (cyclomatic 17): chat_models._convert_responses_to_chat_result 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":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9052a6db374ba2ff0e8e2bb3d330d3bfb3e6c518c23047b07bc8423ca216e1"}},{"ruleId":"D1","level":"warning","message":{"text":"_compat_bridge.chunks_to_events (cyclomatic 16): _compat_bridge.chunks_to_events 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. This shape REPEATS in the file: one other method here (_compat_bridge.achunks_to_events) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6760bf4a1fffed470b32104958bdc4e200380486ed2f38806db5fcbca79d111"}},{"ruleId":"D1","level":"warning","message":{"text":"_compat_bridge.achunks_to_events (cyclomatic 16): _compat_bridge.achunks_to_events 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. This shape REPEATS in the file: one other method here (_compat_bridge.chunks_to_events) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"314141309aa58bfad2aae3695533ab1e4c6cfbe1dfae7fc43840d2e8cff3c98d"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._format_for_tracing (cyclomatic 16): chat_models._format_for_tracing 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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"703d1771ba6c79da33e3abbfc45add5f061f25c51be4f2d3c6df4c18a9b5a048"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseLLM._get_ls_params (cyclomatic 16): BaseLLM._get_ls_params 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":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f7af4d39a31e333760e475905def5b8f20780beeaed9845880903c83a69e6a"}},{"ruleId":"D1","level":"warning","message":{"text":"AIMessage.content_blocks (cyclomatic 16): AIMessage.content_blocks 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":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeceb6ace9bd0c2cc523507b077ad2337b3e21d00acfb4fc06142e954cfe43c"}},{"ruleId":"D1","level":"warning","message":{"text":"AIMessageChunk.init_tool_calls (cyclomatic 16): AIMessageChunk.init_tool_calls 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":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"976f94820e0eb72f1686ec2f0a90d852c1fe3fbfae229c3ec3184f5354f8ba15"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.trim_messages (cyclomatic 16): utils.trim_messages 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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2522ae6390bee8876d00aff36d71f3ea47a4cb8dffa608fab86159997eab0d2"}},{"ruleId":"D1","level":"warning","message":{"text":"_RootEventFilter.include_event (cyclomatic 16): _RootEventFilter.include_event has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/utils.py"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"78553aef62bd0c0899bd726cdbedc03f3e17e53c0f483ade46cc8df4a5f2b76a"}},{"ruleId":"D1","level":"warning","message":{"text":"sys_info.print_sys_info (cyclomatic 16): sys_info.print_sys_info 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":"libs/core/langchain_core/sys_info.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df87bd6981fbc8064d62c9ccd270eadd84bf670f681d035675fb6e6df5faaaa"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseTool.run (cyclomatic 16): BaseTool.run 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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c12f37bc53326b790371a6d100a7a6b8eb0245d64868a51a5e0b58f5906340"}},{"ruleId":"D1","level":"warning","message":{"text":"openapi.openapi_spec_to_openai_fn (cyclomatic 16): openapi.openapi_spec_to_openai_fn 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":"libs/langchain/langchain_classic/chains/openai_functions/openapi.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de626c747611786b89e7809514c1fedac96790d06139b284593023eca6cab05"}},{"ruleId":"D1","level":"warning","message":{"text":"base.fix_filter_directive (cyclomatic 16): base.fix_filter_directive 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":"libs/langchain/langchain_classic/chains/query_constructor/base.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8773a6aa1e3055eed378505503d524f385d8e4ff00abf4571b02cd46f08d4b4f"}},{"ruleId":"D1","level":"warning","message":{"text":"_redaction._apply_mask_strategy (cyclomatic 16): _redaction._apply_mask_strategy 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":"libs/langchain_v1/langchain/agents/middleware/_redaction.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"753b92fb69a7c90461970c3a94cfa24045ea7aa668fc929f6183f11559d9e6ac"}},{"ruleId":"D1","level":"warning","message":{"text":"ClearToolUsesEdit.apply (cyclomatic 16): ClearToolUsesEdit.apply 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":"libs/langchain_v1/langchain/agents/middleware/context_editing.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac95ef87d13d49e7535f3ebd25aae709bff5568769a3cdd8ba22364b7938e2d6"}},{"ruleId":"D1","level":"warning","message":{"text":"chat_models._merge_messages (cyclomatic 16): chat_models._merge_messages 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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ac20fefabc9edd542a1af18f550affe33816ccfeb4e6d3c230f37f8b2a8e15"}},{"ruleId":"D1","level":"warning","message":{"text":"BaseChatOpenAI._agenerate (cyclomatic 16): BaseChatOpenAI._agenerate 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b50225db0021f0c10bc58517a9c641c499a8280a220d3ad0876c11e44aba34"}},{"ruleId":"D1","level":"warning","message":{"text":"AzureOpenAIEmbeddings.validate_environment (cyclomatic 16): AzureOpenAIEmbeddings.validate_environment 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":"libs/partners/openai/langchain_openai/embeddings/azure.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aef1fe2a201bcf8fbd40e1995116c5c93e63bd73840cd76bd4b734e693fd636"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatOpenRouter._default_params (cyclomatic 16): ChatOpenRouter._default_params 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":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22b1f7a2dbd4c623bacdfd6dfe7a836e8036537dc4f6d7d12e25d572cf2873e"}},{"ruleId":"D1","level":"warning","message":{"text":"Qdrant.construct_instance (cyclomatic 16): Qdrant.construct_instance 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. This shape REPEATS in the file: one other method here (Qdrant.aconstruct_instance) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c7ff3e578a189f630ad47a1d1553e27a284ad07c523de16244d20276158fab"}},{"ruleId":"D1","level":"warning","message":{"text":"Qdrant.aconstruct_instance (cyclomatic 16): Qdrant.aconstruct_instance 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. This shape REPEATS in the file: one other method here (Qdrant.construct_instance) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b861d95b6c92a223da2b699998b5694d28f65b3d3e4f23da67133d01727a0e7"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._format_messages (cognitive 278): chat_models._format_messages has cognitive complexity 278 (threshold 15). Drivers by points: if/else 50 (204 pts), boolean chains 23, loops 6 (22 pts), error handling 3 (19 pts), ternaries 3 (10 pts) (nesting depth added 193). 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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aa1dd5caf36c5b7596c143a71e1312a438344cc29540e6a0299c69c141d3a1"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.convert_to_openai_messages (cognitive 204): utils.convert_to_openai_messages has cognitive complexity 204 (threshold 15). Drivers by points: if/else 47 (175 pts), boolean chains 14, ternaries 3 (11 pts), loops 2 (4 pts) (nesting depth added 138). 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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"507e712d53eefa0c5d0e6bd6733e67f28353c16c866186725ac3612e33594ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"base._construct_responses_api_input (cognitive 182): base._construct_responses_api_input has cognitive complexity 182 (threshold 15). Drivers by points: if/else 34 (150 pts), loops 6 (24 pts), boolean chains 8 (nesting depth added 134). 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":4938}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a58b5be39eb609344af664445270978ee2489c67bee046036f3d73ae810d9f0"}},{"ruleId":"D2","level":"warning","message":{"text":"langchain_v0._convert_legacy_v0_content_block_to_v1 (cognitive 155): langchain_v0._convert_legacy_v0_content_block_to_v1 has cognitive complexity 155 (threshold 15). Drivers by points: if/else 44 (127 pts), loops 9 (27 pts), boolean chains 1 (nesting depth added 101). 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":"libs/core/langchain_core/messages/block_translators/langchain_v0.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebedf1049376d05b86211b2bb4378c6e988784f6b46d4cd20e2f609f2d3ac50"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat._consolidate_calls (cognitive 132): _compat._consolidate_calls has cognitive complexity 132 (threshold 15). Drivers by points: if/else 33 (114 pts), loops 4 (13 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 91). 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":"libs/partners/openai/langchain_openai/chat_models/_compat.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a78ffc42567f879c5f1a6348b0b6a443aa1372bf1c26307190c8a19f3f3c26"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatAnthropic._get_request_payload (cognitive 125): ChatAnthropic._get_request_payload has cognitive complexity 125 (threshold 15). Drivers by points: if/else 50 (92 pts), boolean chains 21, ternaries 4 (7 pts), loops 3 (5 pts) (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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b5b094e8cd03c185608c9f3798b73b7b62e9f54605566938f414df58a4cc38"}},{"ruleId":"D2","level":"warning","message":{"text":"google_genai._convert_to_v1_from_genai (cognitive 115): google_genai._convert_to_v1_from_genai has cognitive complexity 115 (threshold 15). Drivers by points: if/else 32 (87 pts), boolean chains 9, loops 5 (9 pts), error handling 1 (6 pts), ternaries 1 (4 pts) (nesting depth added 67). 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":"libs/core/langchain_core/messages/block_translators/google_genai.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9613d3a00edf95df197b5b9bd3ae80df55e4ddf0ebb355f1cb7298c739b0180"}},{"ruleId":"D2","level":"warning","message":{"text":"factory.create_agent (cognitive 108): factory.create_agent has cognitive complexity 108 (threshold 15). Drivers by points: if/else 48 (55 pts), ternaries 10 (26 pts), boolean chains 16, loops 6 (11 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/factory.py"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afd31205101a982ac32b657075e08bc3ef08451761a475710d80837058d5a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._first_max_tokens (cognitive 103): utils._first_max_tokens has cognitive complexity 103 (threshold 15). Drivers by points: if/else 29 (81 pts), loops 6 (17 pts), boolean chains 5 (nesting depth added 63). 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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":1988}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d093bd56d44bb516ffef2aa6269727d29c65c7f47e2a9e1b42233499b1550b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatAnthropic._make_message_chunk_from_anthropic_event (cognitive 92): ChatAnthropic._make_message_chunk_from_anthropic_event has cognitive complexity 92 (threshold 15). Drivers by points: if/else 32 (69 pts), boolean chains 14, ternaries 4 (9 pts) (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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ec56f3ea1c6c6407f910c1994840a81fb417c5814639a31947ef4d59d776fa"}},{"ruleId":"D2","level":"warning","message":{"text":"manager._configure (cognitive 90): manager._configure has cognitive complexity 90 (threshold 15). Drivers by points: if/else 24 (48 pts), boolean chains 23, ternaries 5 (9 pts), loops 3 (6 pts), error handling 1 (4 pts) (nesting depth added 34). 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":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39ad998f4a9d93b6118a805425554c583bf5e97b651572216976a2dd28d5231"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat._convert_from_v1_to_responses (cognitive 87): _compat._convert_from_v1_to_responses has cognitive complexity 87 (threshold 15). Drivers by points: if/else 22 (71 pts), boolean chains 8, loops 3 (8 pts) (nesting depth added 54). 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":"libs/partners/openai/langchain_openai/chat_models/_compat.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f93174c7012bfdba2a8429ac9e8c24fbceab0c07d3b480066cd9ece73ad955"}},{"ruleId":"D2","level":"warning","message":{"text":"_merge.merge_lists (cognitive 86): _merge.merge_lists has cognitive complexity 86 (threshold 15). Drivers by points: if/else 16 (67 pts), ternaries 2 (8 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 59). 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":"libs/core/langchain_core/utils/_merge.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ee2119db51b788886a96469e5220ee7c9bf156fa372a4463117fe096bd923c"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat._convert_from_v1_to_anthropic (cognitive 85): _compat._convert_from_v1_to_anthropic has cognitive complexity 85 (threshold 15). Drivers by points: if/else 26 (69 pts), boolean chains 8, error handling 1 (4 pts), loops 2 (4 pts) (nesting depth added 48). 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":"libs/partners/anthropic/langchain_anthropic/_compat.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfce3c4ee1dff647ed1f6a04c9c636f81421563e7d4818d95797f86f62f5308b"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat._convert_annotation_from_v1 (cognitive 80): _compat._convert_annotation_from_v1 has cognitive complexity 80 (threshold 15). Drivers by points: if/else 20 (56 pts), loops 8 (24 pts) (nesting depth added 52). 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":"libs/partners/anthropic/langchain_anthropic/_compat.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8360a94cea94973ce9c1c16fd6c0e833a4fd4aadc3016919440c9ce1ddd5f3a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Crawler.crawl (cognitive 77): Crawler.crawl has cognitive complexity 77 (threshold 15). Drivers by points: if/else 21 (45 pts), boolean chains 14, loops 4 (8 pts), ternaries 4 (8 pts), error handling 1 (2 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/chains/natbot/crawler.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b9a3280bd70ea2f9323364de043d4cfa309a776d0f6a4636a6bc03874f79b9"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat._convert_to_v1_from_mistral (cognitive 74): _compat._convert_to_v1_from_mistral has cognitive complexity 74 (threshold 15). Drivers by points: if/else 15 (62 pts), loops 3 (8 pts), boolean chains 4 (nesting depth added 52). 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":"libs/partners/mistralai/langchain_mistralai/_compat.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caa42981dd223f11a0d47a5b4b9f5837d9e7a7607c9e4d61cbfc53a55fdc7d8"}},{"ruleId":"D2","level":"warning","message":{"text":"base._construct_responses_api_payload (cognitive 74): base._construct_responses_api_payload has cognitive complexity 74 (threshold 15). Drivers by points: if/else 29 (59 pts), boolean chains 12, loops 2 (3 pts) (nesting depth added 31). 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f15caafb336289d9589bd98634d34810a36a92c2d7735e664bdc0c16a89d28"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.get_buffer_string (cognitive 72): utils.get_buffer_string has cognitive complexity 72 (threshold 15). Drivers by points: if/else 18 (51 pts), loops 3 (10 pts), boolean chains 7, ternaries 1 (4 pts) (nesting depth added 43). 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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a4a669fe59cc33d13f59135af6be51f241352105014f566c2428eb8c8d4a20"}},{"ruleId":"D2","level":"warning","message":{"text":"mustache.render (cognitive 71): mustache.render has cognitive complexity 71 (threshold 15). Drivers by points: if/else 18 (54 pts), loops 4 (13 pts), boolean chains 4 (nesting depth added 45). 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":"libs/core/langchain_core/utils/mustache.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c24e3ee48aef45931397a18220a69b7730a01648d176fa7cc86c76d77b8b989"}},{"ruleId":"D2","level":"warning","message":{"text":"api.aindex (cognitive 70): api.aindex has cognitive complexity 70 (threshold 15). Drivers by points: if/else 22 (46 pts), loops 7 (16 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 34). 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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f61fcc258831a41d583821210f08b4d0d005ff9bfa2304d9e319337080e98f"}},{"ruleId":"D2","level":"warning","message":{"text":"api.index (cognitive 69): api.index has cognitive complexity 69 (threshold 15). Drivers by points: if/else 22 (46 pts), loops 7 (16 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 34). 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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b8688a61532385edf504badf30311a13029f76d56f0fe25e5bd2c8e19575e6"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatModel._generate_with_cache (cognitive 68): BaseChatModel._generate_with_cache has cognitive complexity 68 (threshold 15). Drivers by points: if/else 19 (42 pts), loops 5 (11 pts), ternaries 5 (11 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BaseChatModel._agenerate_with_cache) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f500926d01b66f4d7985b75bcf3cfe6313e0fb4ef4659fd3fdedcc9bf132034"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatModel._agenerate_with_cache (cognitive 68): BaseChatModel._agenerate_with_cache has cognitive complexity 68 (threshold 15). Drivers by points: if/else 19 (42 pts), loops 5 (11 pts), ternaries 5 (11 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BaseChatModel._generate_with_cache) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"94dc71cc08987c0551b549e96864acf6bc76965a03b326eec23c1eeebda4093d"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_chunk_to_message_chunk (cognitive 68): chat_models._convert_chunk_to_message_chunk has cognitive complexity 68 (threshold 15). Drivers by points: if/else 18 (40 pts), boolean chains 11, loops 3 (10 pts), ternaries 1 (4 pts), error handling 1 (3 pts) (nesting depth added 34). 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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d0b7de2bd90aaca0b1250081b3283edbd922a65d8af0fe28cac01d6e54214b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPerplexity._stream (cognitive 68): ChatPerplexity._stream has cognitive complexity 68 (threshold 15). Drivers by points: if/else 25 (58 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ChatPerplexity._astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bca6ad6381c48d78439af412be350eab1b200d97e4e7c77ea930977e0b9600d"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPerplexity._astream (cognitive 68): ChatPerplexity._astream has cognitive complexity 68 (threshold 15). Drivers by points: if/else 25 (58 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ChatPerplexity._stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a57dc982d4baf07dea8895573390bb575e53d7ddec60f84bcf3d74b3eba331b"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseTool._parse_input (cognitive 63): BaseTool._parse_input has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (48 pts), loops 4 (10 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 40). 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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d6bc8d02c60935af52cad600e5b80190114f502ee338cbc452e14a705ad33c"}},{"ruleId":"D2","level":"warning","message":{"text":"base._construct_lc_result_from_responses_api (cognitive 59): base._construct_lc_result_from_responses_api has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (43 pts), error handling 2 (5 pts), ternaries 1 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":5195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4db51f462c461152fad80cc538f4f1d1273e35fe9e5e28eb94a237f1e5e3b9"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownHeaderTextSplitter.split_text (cognitive 58): MarkdownHeaderTextSplitter.split_text has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (45 pts), loops 3 (8 pts), boolean chains 5 (nesting depth added 35). 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":"libs/text-splitters/langchain_text_splitters/markdown.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dd6dcec517f5bfd6fa4cbc8400dac1fa664dc7b1df81fc3f069b7e13e6f890"}},{"ruleId":"D2","level":"warning","message":{"text":"_ChatModelStreamBase._push_content_block_delta (cognitive 57): _ChatModelStreamBase._push_content_block_delta has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (55 pts), boolean chains 2 (nesting depth added 31). 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":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"41388a142c3fe3212a5f942cd297c0a5e77788d3ad128fa531c550ed6a2fb65c"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat._convert_from_v1_to_mistral (cognitive 57): _compat._convert_from_v1_to_mistral has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (47 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 38). 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":"libs/partners/mistralai/langchain_mistralai/_compat.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4510e64d0340dd7c1f039a580405eff35bb87bae7bce01470f0e1d0e117efeea"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericFakeChatModel._stream (cognitive 54): GenericFakeChatModel._stream has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (39 pts), loops 4 (14 pts), boolean chains 1 (nesting depth added 35). 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":"libs/core/langchain_core/language_models/fake_chat_models.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8842216c5e237619d04c45ad0ed0e266344b8a988d9a8bf78647d9242bfa26"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatOllama._convert_messages_to_ollama_messages (cognitive 54): ChatOllama._convert_messages_to_ollama_messages has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (44 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/ollama/langchain_ollama/chat_models.py"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d948c4969fd69bd757f6a3ddf92f44da888e40c5983b712a54757166dc9265"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat_bridge._accumulate (cognitive 51): _compat_bridge._accumulate has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 17, loops 3 (6 pts) (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":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f52a19eaf7108df8014682972933f990209dd8f54fe4f0b5a5f16359005ac88"}},{"ruleId":"D2","level":"warning","message":{"text":"HuggingFacePipeline.from_model_id (cognitive 51): HuggingFacePipeline.from_model_id has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 9, ternaries 3 (5 pts), error handling 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":"libs/partners/huggingface/langchain_huggingface/llms/huggingface_pipeline.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"357886a900f50727743fb7e1b9c4bb6747e1f7c009fa73280518785b79db1c5e"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.count_tokens_approximately (cognitive 50): utils.count_tokens_approximately has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":2262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb9ce08b8e1b570235f658e438054af1ccea787087cede69b182c40d3c64f37"}},{"ruleId":"D2","level":"warning","message":{"text":"_StringImageMessagePromptTemplate.from_template (cognitive 50): _StringImageMessagePromptTemplate.from_template has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 2 (7 pts), boolean chains 4 (nesting depth added 31). 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":"libs/core/langchain_core/prompts/chat.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6c4ac5b51979a81d8704138320523b9e5c7c35ca7cbc97c83b0bbe1def214d"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnableSequence.batch (cognitive 50): RunnableSequence.batch has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 5 (9 pts), ternaries 2 (6 pts), boolean chains 3, error handling 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3525}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a6a074d8e2dc6ed89e5d0a344f7e8463a8dea40cb01a2e2f73f1e3f100a761"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_chunk_to_message_chunk (cognitive 50): chat_models._convert_chunk_to_message_chunk has cognitive complexity 50 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 10, loops 2 (5 pts) (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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c808d899c4cf42be9b0a04e547d1768ef1214e10908882e385ff9bad8336ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._merge_messages (cognitive 49): chat_models._merge_messages has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 2 (6 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 30). 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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8c10fb2d39fe24e229305c557696b5384b13bd1522562dd9d5512dcff0e3d4"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat._convert_to_v03_ai_message (cognitive 49): _compat._convert_to_v03_ai_message has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (43 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 31). 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":"libs/partners/openai/langchain_openai/chat_models/_compat.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55119bfbdcdb0d0d32a2f8a0710c1228ce43d8aefbee4f3ef11cf3baffc1616"}},{"ruleId":"D2","level":"warning","message":{"text":"_policy._ip_in_blocked_networks (cognitive 48): _policy._ip_in_blocked_networks has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 5 (12 pts), boolean chains 5 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/_security/_policy.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1e579fd8c7e243a163be70c683c1a8f7fadd178faf3da6d55d7023fa724253"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnableSequence.abatch (cognitive 48): RunnableSequence.abatch has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (31 pts), loops 4 (7 pts), ternaries 2 (6 pts), boolean chains 3, error handling 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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3653}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f063fb10d86e67926cc8eded5df055c0c71ed9178c5ad891cc7ac577ef250c"}},{"ruleId":"D2","level":"warning","message":{"text":"event_stream._astream_events_implementation_v1 (cognitive 48): event_stream._astream_events_implementation_v1 has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (41 pts), ternaries 1 (4 pts), loops 2 (3 pts) (nesting depth added 30). 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":"libs/core/langchain_core/tracers/event_stream.py"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b4bae4a7edf4f396ef47d24beb1dbab8a3988db6615c8ed34f8f05a11cc9d3"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI.get_num_tokens_from_messages (cognitive 48): BaseChatOpenAI.get_num_tokens_from_messages has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 3 (7 pts), ternaries 1 (6 pts), boolean chains 1 (nesting depth added 30). 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"89734cea770079fa54c32f938d96c72c8562d6a3f1fdcf0f5c3769cf46bd38e5"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_responses_stream_event_to_chunk (cognitive 47): chat_models._convert_responses_stream_event_to_chunk has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (24 pts), ternaries 5 (11 pts), loops 3 (8 pts), boolean chains 4 (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":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4ab055e3e31c3f0344083e08c5f4439b9bfba166056d1830509b540da5d81c"}},{"ruleId":"D2","level":"warning","message":{"text":"langchain_classic.__getattr__ (cognitive 46): langchain_classic.__getattr__ has cognitive complexity 46 (threshold 15). Drivers by points: if/else 46. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/__init__.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"14936aae463b302f20b2cc015a674be566dd303050fee34962e537e94861072c"}},{"ruleId":"D2","level":"warning","message":{"text":"config.merge_configs (cognitive 45): config.merge_configs has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 4 (15 pts), boolean chains 5 (nesting depth added 27). 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":"libs/core/langchain_core/runnables/config.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b15319e7ea495d852faa8861f0dd55be92f20e9cb2cbd8cb57ff2c463cfdbf"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatGroq._combine_llm_outputs (cognitive 45): ChatGroq._combine_llm_outputs has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 3 (10 pts), boolean chains 2 (nesting depth added 28). 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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd84dde6e44b92cc40a0c90c5c677707cc3b180c2b24b91af216eb423c0bb4d6"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatModel.stream (cognitive 44): BaseChatModel.stream has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 2 (6 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 25). 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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"102a094c257c7b591b5057a45022ed2caaa5017d054bb0bf2d980e9fe4518704"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.filter_messages (cognitive 44): utils.filter_messages has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (28 pts), boolean chains 15, loops 1 (nesting depth added 19). 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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b993f7adf6d3c27897be8751951e8b0452549dbc41e75dc7c336869dd7b23df"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._format_for_tracing (cognitive 43): chat_models._format_for_tracing has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (35 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 30). 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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"896478c3e28e2dd64deb41094dcbc362fba08c8e7666f74a0bbc976dad9dc314"}},{"ruleId":"D2","level":"warning","message":{"text":"function_calling._parse_google_docstring (cognitive 43): function_calling._parse_google_docstring has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/utils/function_calling.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a33885c777a485e19aa3ff158ba3112c3a609ac2a9251ed40d7d9967e947414"}},{"ruleId":"D2","level":"warning","message":{"text":"HTMLHeaderTextSplitter._generate_documents (cognitive 42): HTMLHeaderTextSplitter._generate_documents has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 3 (7 pts), error handling 1 (3 pts), 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":"libs/text-splitters/langchain_text_splitters/html.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f688caf832c365c2bc44d49c96e4e205ad766d27157f86147499fff0fb4da8"}},{"ruleId":"D2","level":"warning","message":{"text":"openai.convert_to_openai_data_block (cognitive 41): openai.convert_to_openai_data_block has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (27 pts), ternaries 3 (9 pts), boolean chains 5 (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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52bb9817c54080c27013742cc9ca88f82b570f88d09939b1b7e5c6864fafa39"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._format_content_block_xml (cognitive 41): utils._format_content_block_xml has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (32 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1c6b7dc11dcb56275483a8f812a3e4539aa1e6a9259fcd5453b6dc21596db6"}},{"ruleId":"D2","level":"warning","message":{"text":"PIIMiddleware.before_model (cognitive 41): PIIMiddleware.before_model has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/pii.py"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"9980869a0142d22a6d23bb33428c5f916c1f3fc9764baca92c24fcddb6722d88"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_message_to_mistral_chat_message (cognitive 41): chat_models._convert_message_to_mistral_chat_message has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (30 pts), ternaries 2 (6 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffabd1068e6cb352fcae65ac538ad24fc89240f11aa646d6aad7e314135a963"}},{"ruleId":"D2","level":"warning","message":{"text":"openapi.openapi_spec_to_openai_fn (cognitive 40): openapi.openapi_spec_to_openai_fn has cognitive complexity 40 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 6 (16 pts), ternaries 1 (5 pts), boolean chains 1, error handling 1 (nesting depth added 26). 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":"libs/langchain/langchain_classic/chains/openai_functions/openapi.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5048210109f1b8516c957120adf6d8fa7668972b3c54a3597bed801e451796"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnableBranch.stream (cognitive 39): RunnableBranch.stream has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (20 pts), error handling 3 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (RunnableBranch.astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/branch.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff6c78a4585778f18ceebfc885d2f14f564a04cc5f07a403facc3080d70f14e"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnableBranch.astream (cognitive 39): RunnableBranch.astream has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (20 pts), error handling 3 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (RunnableBranch.stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/branch.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3acf1ec26b17af8cb52168acd6c0fa9f5fde211f36178b9d38f268db8821812"}},{"ruleId":"D2","level":"warning","message":{"text":"groq._convert_to_v1_from_groq (cognitive 38): groq._convert_to_v1_from_groq has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (22 pts), error handling 2 (10 pts), boolean chains 4, loops 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":"libs/core/langchain_core/messages/block_translators/groq.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"450250d984149801926e96d8f1437674b9b09de0b509c0aef777b1e8647943a9"}},{"ruleId":"D2","level":"warning","message":{"text":"openai._convert_from_v03_ai_message (cognitive 38): openai._convert_from_v03_ai_message has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 10, loops 4 (5 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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99774c65d34a30df60d1d855f7aa6bb5454df73b085609eebef46b1b311d1f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatFireworks._stream (cognitive 36): ChatFireworks._stream has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 6, error handling 2, loops 1 (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. This shape REPEATS in the file: one other method here (ChatFireworks._astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ba2940c2315330abed6534b80367bd105e65ad7272838417db93230ab7a22a"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatFireworks._astream (cognitive 36): ChatFireworks._astream has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 6, error handling 2, loops 1 (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. This shape REPEATS in the file: one other method here (ChatFireworks._stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed80f1cd1969c966a552c79e6855fada493c066a559750308326cdf1286c2e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat._convert_from_v1_to_groq (cognitive 35): _compat._convert_from_v1_to_groq has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 5, loops 2 (5 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":"libs/partners/groq/langchain_groq/_compat.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf604a3afef4edf6b8317f665a307c4245ade959f4ba3c98c719a57538f4e4e7"}},{"ruleId":"D2","level":"warning","message":{"text":"function_calling._recursive_set_additional_properties_false (cognitive 34): function_calling._recursive_set_additional_properties_false has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (15 pts), boolean chains 3 (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":"libs/core/langchain_core/utils/function_calling.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba711897271aa162f48389c499576d3f11be7a7ad722d8cd4ede42256456509"}},{"ruleId":"D2","level":"warning","message":{"text":"_redaction._apply_mask_strategy (cognitive 34): _redaction._apply_mask_strategy has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 6 (19 pts), if/else 7 (14 pts), loops 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":"libs/langchain_v1/langchain/agents/middleware/_redaction.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a566e27bcc5f98aaf6569beeac680c938261e29b9f346d89f69927be462862b4"}},{"ruleId":"D2","level":"warning","message":{"text":"SummarizationMiddleware._should_summarize (cognitive 34): SummarizationMiddleware._should_summarize has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (28 pts), boolean chains 3, loops 2 (3 pts) (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":"libs/langchain_v1/langchain/agents/middleware/summarization.py"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e20efc6c4f7e87306ad54500f29d8d0ebecfb97d32f71b4384156c8d89e4f3"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatOpenRouter._stream (cognitive 34): ChatOpenRouter._stream has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 1, loops 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. This shape REPEATS in the file: one other method here (ChatOpenRouter._astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fee43d1a1449fab558b24f8a1e5651c023d5ab2dd1e7f9da438c87d58d57c5"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatOpenRouter._astream (cognitive 34): ChatOpenRouter._astream has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 1, loops 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. This shape REPEATS in the file: one other method here (ChatOpenRouter._stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe1dca226f94ee3f1b3299f972a9d1de2d35b81ac5265b9744347cf960d6a5c"}},{"ruleId":"D2","level":"warning","message":{"text":"mustache._get_key (cognitive 33): mustache._get_key has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 4 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/utils/mustache.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"da291bf0b0d7c60eac80f03c60838aa904a263174eddc90a19bb3250dd0cd4d9"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesystemFileSearchMiddleware._python_search (cognitive 33): FilesystemFileSearchMiddleware._python_search has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 3 (6 pts), error handling 2 (4 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":"libs/langchain_v1/langchain/agents/middleware/file_search.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"713d4c14d75b626fb16929922095607a0d1467d168ac9c998cc9e8aad9b5425b"}},{"ruleId":"D2","level":"warning","message":{"text":"Chroma.add_images (cognitive 33): Chroma.add_images has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 3 (8 pts), error handling 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bad1e865f72d46929e67830d0b4df9eac3184daa6ea16e8b9f01af2603a8326"}},{"ruleId":"D2","level":"warning","message":{"text":"Chroma.add_texts (cognitive 33): Chroma.add_texts has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 3 (8 pts), error handling 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d02dc0a414ae2b8f353b9a7904101e8184b433271b7a4b31d40004f501b985"}},{"ruleId":"D2","level":"warning","message":{"text":"base._convert_responses_chunk_to_generation_chunk (cognitive 33): base._convert_responses_chunk_to_generation_chunk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 10, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":5408}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cafad11ecd6e2fcc0d48c40ff3ce7e3fc570ff09abff4f1fff3e199e077e83"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseOpenAI._generate (cognitive 33): BaseOpenAI._generate has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), ternaries 2 (6 pts), loops 2 (4 pts) (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":"libs/partners/openai/langchain_openai/llms/base.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"237a1a30c9a9b920ccfdb7ec4936e0c97fea4c5d7404df35684002f967146ca2"}},{"ruleId":"D2","level":"warning","message":{"text":"TextSplitter._merge_splits (cognitive 33): TextSplitter._merge_splits has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 4 (13 pts), loops 2 (5 pts), boolean chains 2 (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":"libs/text-splitters/langchain_text_splitters/base.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f144d56eeae991ef0bd79bd899337c15fced95979ecf41a2d4a93b022deb7f43"}},{"ruleId":"D2","level":"warning","message":{"text":"manager.handle_event (cognitive 32): manager.handle_event has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), error handling 3 (6 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":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4b15b68785aeb433cb3f914d42f9137992cd0d670bbc2c9a20c90ffc758de6"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseLLM.generate (cognitive 32): BaseLLM.generate has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 15, if/else 11 (15 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf0c27ba6d5c573c18a23a84df5ed3a4788cbc7ac0c6624d6e9223fd3f2b21b"}},{"ruleId":"D2","level":"warning","message":{"text":"Serializable.to_json (cognitive 32): Serializable.to_json has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (8 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/load/serializable.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b0828f0dd8b4f140f68f8a5291b2d88ac36df7f4d5762c2a6a41d31c1d69ee"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPerplexity._to_responses_payload (cognitive 32): ChatPerplexity._to_responses_payload has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 5, ternaries 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1fae6e0bea0a2fd8826fe3d782929b5278832f3aa1e57637ac9b498da262b5a"}},{"ruleId":"D2","level":"warning","message":{"text":"_utils.is_openai_data_block (cognitive 31): _utils.is_openai_data_block has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 8 (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":"libs/core/langchain_core/language_models/_utils.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb2ab063a104adbf770ae5c479e58ce652cf79bc68920cfe816ddcaa5ad3296"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseLLM.agenerate (cognitive 31): BaseLLM.agenerate has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 15, if/else 10 (14 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6deb7c8635f8e1c5159d14d30b547949ca11563bcff29e864c26c0eb05ab9012"}},{"ruleId":"D2","level":"warning","message":{"text":"graph_mermaid.draw_mermaid (cognitive 31): graph_mermaid.draw_mermaid has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 6 (11 pts), boolean chains 4, ternaries 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":"libs/core/langchain_core/runnables/graph_mermaid.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f92f5b725309c025aa90794af527afb7a865492c69723809ea57f332308439d"}},{"ruleId":"D2","level":"warning","message":{"text":"base._get_builtin_translator (cognitive 31): base._get_builtin_translator has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (18 pts), error handling 12, boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/retrievers/self_query/base.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb2c0b0bf0130ddf7b4609efcd56d7f44a74b39cf5ba7f087fc737524ab50ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatAnthropic._format_output (cognitive 31): ChatAnthropic._format_output has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 8, 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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa02533e1f3c4d70dfb1d5efef775a6014ce43fff9457ae7bfb4e04025cd980"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_dict_to_message (cognitive 31): chat_models._convert_dict_to_message has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (6 pts), error handling 1 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"403fe3d0a9d91c1b84c1b0e9ba6950edf3820f2b23d316a96743b9c5633952df"}},{"ruleId":"D2","level":"warning","message":{"text":"base._convert_message_to_dict (cognitive 31): base._convert_message_to_dict has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 6, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c6eba06507d282c3df8c54171133d180a34ae1670f77f51f617e126490ee05"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatOpenRouter._create_chat_result (cognitive 31): ChatOpenRouter._create_chat_result has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"512df92f2ae9a447801cb2121f1b62dfc571112939df00e6d45e0899d3d26c09"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatModel.astream (cognitive 30): BaseChatModel.astream has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (2 pts), error handling 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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7cda6517b3de377073e7fa193fcebb846edd656d5069d61ff8542070dd1e68"}},{"ruleId":"D2","level":"warning","message":{"text":"PydanticToolsParser.parse_result (cognitive 30): PydanticToolsParser.parse_result has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 3 (5 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/output_parsers/openai_tools.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5624356fe89b6f4685543ee01f292bb311dce83cbe1070f80c7e51d8e423609"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnableWithFallbacks.batch (cognitive 30): RunnableWithFallbacks.batch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, loops 3 (4 pts), ternaries 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":"libs/core/langchain_core/runnables/fallbacks.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"260952fd7c1daa1f5138b03fa8fb4f04aa5a7b4c9ad821cf972bc3189b52e983"}},{"ruleId":"D2","level":"warning","message":{"text":"base.create_schema_from_function (cognitive 30): base.create_schema_from_function has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 5, loops 3 (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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad75bb2248372c70c621ff789d4f1f111868db5692940f5708feeb8308648aa"}},{"ruleId":"D2","level":"warning","message":{"text":"function_calling.convert_to_openai_function (cognitive 30): function_calling.convert_to_openai_function has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 10 (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":"libs/core/langchain_core/utils/function_calling.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"2460bcbf5fbbf36df393eec796cd60c4821a55ef5eb267f3e53f33598a7530d5"}},{"ruleId":"D2","level":"warning","message":{"text":"HumanInTheLoopMiddleware.after_model (cognitive 30): HumanInTheLoopMiddleware.after_model has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 2, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.py"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"75138845d998b5ebb01a6d4c19f021b933a8ecc685ef272de5e89e1fa1aea6e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatAnthropic.bind_tools (cognitive 30): ChatAnthropic.bind_tools has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 6, ternaries 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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f4add2b99594128d0d9ad3a2c3328e58c18ad147d59788cca01af68cadff6b"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_chunk_to_message_chunk (cognitive 30): chat_models._convert_chunk_to_message_chunk has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 10, ternaries 2 (4 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"35bbd1b2ce1fbb73c8c2c84dbd7137b0dd99a2b4f808dcc7947e8ba860638069"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_message_to_dict (cognitive 30): chat_models._convert_message_to_dict has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 7 (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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d529b1dd283a26c4896aaf14e60d2311c988df5d33811b655148d312c8eb3bea"}},{"ruleId":"D2","level":"warning","message":{"text":"AzureChatOpenAI.validate_environment (cognitive 30): AzureChatOpenAI.validate_environment has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 9, ternaries 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/azure.py"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"a985310aeffdbcdb570b8ea4c5fa0a471d3a458a0224104f77a5b1a26c423085"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI.validate_environment (cognitive 30): BaseChatOpenAI.validate_environment has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (18 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, 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f246f563992781b613648903c2ea3c01f1bd087538584f4dca18af17b94206"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI.bind_tools (cognitive 30): BaseChatOpenAI.bind_tools has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (22 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b387ffa796864d4182753241245c4aaabb544ce947ee5018926a8d8388d11b"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIEmbeddings._tokenize (cognitive 30): OpenAIEmbeddings._tokenize has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (10 pts), error handling 3 (6 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":"libs/partners/openai/langchain_openai/embeddings/base.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d372ce98f2d837c591ad49bbfee64410feac85de3ff5d10fa254ecf4e172c7a2"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_chunk_to_message_chunk (cognitive 30): chat_models._convert_chunk_to_message_chunk has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 6, error handling 1 (3 pts), 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":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f7dfc12a1ab6ace205def28590dac0c576d4b6bd2c35e547af0639a5810fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"anthropic._convert_citation_to_v1 (cognitive 29): anthropic._convert_citation_to_v1 has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/block_translators/anthropic.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"44edfad5121c13c31ac1b8495e51f1a5e63e76d95799dada2e6ec7ef57a94d60"}},{"ruleId":"D2","level":"warning","message":{"text":"Reviver.__call__ (cognitive 28): Reviver.__call__ has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 6 (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":"libs/core/langchain_core/load/load.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce926109fd93f98dce5768a5c43bb71c8d565adb53a657e67e2391aadcc153c2"}},{"ruleId":"D2","level":"warning","message":{"text":"AIMessage.content_blocks (cognitive 28): AIMessage.content_blocks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5666913bf9534391eafbc89899d8604c62cdc5f0973a4f6920f01ab836ebd8"}},{"ruleId":"D2","level":"warning","message":{"text":"AIMessageChunk.init_tool_calls (cognitive 28): AIMessageChunk.init_tool_calls has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40de9b6140afb9e54338d21d1725a76a2e677de66bba326cf74936d3ab474f2"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._create_message_from_message_type (cognitive 28): utils._create_message_from_message_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 1 (2 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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"412d8eeea1cfd9875a54f2e71ce84277ce27f434601576c78014d6af0eb00614"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnableWithFallbacks.abatch (cognitive 28): RunnableWithFallbacks.abatch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/fallbacks.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"3322b3eac75f7addfd5b539089ee649431ddcfa376f2ebfc80459c0b9ec92d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatOllama.with_structured_output (cognitive 28): ChatOllama.with_structured_output has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (26 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/ollama/langchain_ollama/chat_models.py"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7365e8ef9246cbc12d032f754b2fbbaa7ededdcf67ec12b794e3fcdfe05bd30"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI._stream (cognitive 28): BaseChatOpenAI._stream has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, error handling 2, ternaries 1 (2 pts), 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. This shape REPEATS in the file: one other method here (BaseChatOpenAI._astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd5712acc2d0f342707e6a67d41439138e400f0f245ffe0b3ad550ca7a9793d"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI._astream (cognitive 28): BaseChatOpenAI._astream has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3, error handling 2, ternaries 1 (2 pts), 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. This shape REPEATS in the file: one other method here (BaseChatOpenAI._stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4223e80f9c8f65e90e77196b3ee72f03d6283a8272ecb7e5609f4ad182ca3da"}},{"ruleId":"D2","level":"warning","message":{"text":"base._format_message_content (cognitive 28): base._format_message_content has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 11, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05faba14d2f7e0c3f3c62222b031af90dfe8b572a63bcff90777a645e35cf9f"}},{"ruleId":"D2","level":"warning","message":{"text":"check_diff.dependents_graph (cognitive 28): check_diff.dependents_graph has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (9 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/check_diff.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"278089eef83929750f02673821c0f14cbe4846e1a9b20883c61548fd08a5850c"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat_bridge.chunks_to_events (cognitive 27): _compat_bridge.chunks_to_events has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (4 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. This shape REPEATS in the file: one other method here (_compat_bridge.achunks_to_events) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"19111a48fe5da5a71ce251b79b9242d3355581c4f7807dce784ed1be4895427d"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat_bridge.achunks_to_events (cognitive 27): _compat_bridge.achunks_to_events has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (4 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. This shape REPEATS in the file: one other method here (_compat_bridge.chunks_to_events) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c05948748b3d9f05270c4b7c6bdd62629538626f46b357848f8ed5c0979c6b6"}},{"ruleId":"D2","level":"warning","message":{"text":"_AsyncProjectionIterator.__anext__ (cognitive 27): _AsyncProjectionIterator.__anext__ has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (4 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":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7fac12f8dd1ed59c606d0940c358f257f3dc3d44e27919def3a95bf93edb9d"}},{"ruleId":"D2","level":"warning","message":{"text":"openai._convert_openai_format_to_data_block (cognitive 27): openai._convert_openai_format_to_data_block has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 5 (10 pts), boolean chains 4 (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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ea36aebd36e19e874b90c36ecb2e77ffda270706a35ada51ab2fa696547fa6"}},{"ruleId":"D2","level":"warning","message":{"text":"openai._convert_annotation_to_v1 (cognitive 27): openai._convert_annotation_to_v1 has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbc84a390b18e99b18bcee951cdad8c9fdd6809a6a7c148d4d4a650114e3df6"}},{"ruleId":"D2","level":"warning","message":{"text":"base._init_chat_model_helper (cognitive 27): base._init_chat_model_helper has cognitive complexity 27 (threshold 15). Drivers by points: if/else 22, error handling 2 (5 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"678ea84b5592bc140d113234ac5355d28f34c7085ce2df9274bc656e187438ae"}},{"ruleId":"D2","level":"warning","message":{"text":"_EmbeddingDistanceChainMixin._cosine_distance (cognitive 27): _EmbeddingDistanceChainMixin._cosine_distance has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (16 pts), ternaries 2 (6 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/evaluation/embedding_distance/base.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5364500730fd6e23106f70f4535d939ef79ae802fde43170e71eac805d3418c4"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._format_data_content_block (cognitive 27): chat_models._format_data_content_block has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 9, 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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48ecf320bb42f2e390850b46be698b83a4f2a0ea07fc8abb3a33d30ee5221fe"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatOllama._iterate_over_stream (cognitive 27): ChatOllama._iterate_over_stream has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 2 (7 pts), boolean chains 3, loops 1 (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. This shape REPEATS in the file: one other method here (ChatOllama._aiterate_over_stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/ollama/langchain_ollama/chat_models.py"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f56ab74e667d618701b6b5b732b70ca543e4d505e9f4e6eafe412ba4879bd78"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatOllama._aiterate_over_stream (cognitive 27): ChatOllama._aiterate_over_stream has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 2 (7 pts), boolean chains 3, loops 1 (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. This shape REPEATS in the file: one other method here (ChatOllama._iterate_over_stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/ollama/langchain_ollama/chat_models.py"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e54b012f800ce7798b094561bbc7155dca2cf0a9472587554b2c47dc798b60"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI.with_structured_output (cognitive 27): BaseChatOpenAI.with_structured_output has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2620}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade577b4b9bd3133bd7c1abb16de054ed77fb2745a8e85576d186eb2bc12ad42"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseOpenAI._agenerate (cognitive 27): BaseOpenAI._agenerate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 2 (6 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/llms/base.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f53e777b42587c413235aa5ffea5e4a2326abaf667a3f62c1a29397943784a4"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_message_to_dict (cognitive 27): chat_models._convert_message_to_dict has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 7 (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":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"920d91d8779c8b0bf141729a7e40980a2e7976a79cb6f9c15dca26c8695ffbb2"}},{"ruleId":"D2","level":"warning","message":{"text":"RecursiveCharacterTextSplitter.get_separators_for_language (cognitive 27): RecursiveCharacterTextSplitter.get_separators_for_language has cognitive complexity 27 (threshold 15). Drivers by points: if/else 27. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/text-splitters/langchain_text_splitters/character.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee0956497ab68cfb7cbfc70fd3da17f4223c29a9d1f229c061061e4d341f73b"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonOutputKeyToolsParser.parse_result (cognitive 26): JsonOutputKeyToolsParser.parse_result has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 pts), ternaries 2 (3 pts), boolean chains 2, error handling 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":"libs/core/langchain_core/output_parsers/openai_tools.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e802bd298cb82afab3a6ba582dd1a07db9d21f0be42839a0f3210e6106c1a90"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnableRetry._batch (cognitive 26): RunnableRetry._batch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (4 pts), boolean chains 1, error handling 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. This shape REPEATS in the file: one other method here (RunnableRetry._abatch) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/retry.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"389eb8eca020b3ca33b77dc7ac0b808fafd96caf36a2a15b88791074e4fa4477"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnableRetry._abatch (cognitive 26): RunnableRetry._abatch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (4 pts), boolean chains 1, error handling 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. This shape REPEATS in the file: one other method here (RunnableRetry._batch) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/retry.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aaeae502ec87d6feae6d7f6f2081f385b51212ec2648260939aed42f6ca301e"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.get_function_nonlocals (cognitive 26): utils.get_function_nonlocals has cognitive complexity 26 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts), error handling 2 (6 pts), boolean chains 2, ternaries 1 (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":"libs/core/langchain_core/runnables/utils.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c647387ac5af3675c1c7e94d7a04165beb4148c8a050f45948ed11ed701941"}},{"ruleId":"D2","level":"warning","message":{"text":"sys_info.print_sys_info (cognitive 26): sys_info.print_sys_info has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 3 (7 pts), loops 4 (6 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":"libs/core/langchain_core/sys_info.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c397b6fd497e6a04c862c35fa1f0a986f27d19b6235b23ae5a9fbfb263a91f3c"}},{"ruleId":"D2","level":"warning","message":{"text":"function_calling._convert_any_typed_dicts_to_pydantic (cognitive 26): function_calling._convert_any_typed_dicts_to_pydantic has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/utils/function_calling.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8249bf03af6cde49aaee20301aa0cdc26834e5c70f7dbd35f858db992bafedfb"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_responses_to_chat_result (cognitive 26): chat_models._convert_responses_to_chat_result has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (7 pts), boolean chains 4, error handling 1 (3 pts), loops 3 (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":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"5789aa12f684781a3073d82c496fa27547b0983f8ea23ca6d6f3d932cc9ed56f"}},{"ruleId":"D2","level":"warning","message":{"text":"get_min_versions.get_min_version_from_toml (cognitive 26): get_min_versions.get_min_version_from_toml has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 5 (8 pts), boolean chains 4 (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":".github/scripts/get_min_versions.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a4920ae3cd9f339da9efb3866c86b202b4723c3fce17a0345e41ae36beab2e"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseTool.arun (cognitive 25): BaseTool.arun has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), error handling 4 (6 pts), ternaries 4, boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"178081bd057deadca23c685814c1380084d3020e8e64a5a385466b227569b51e"}},{"ruleId":"D2","level":"warning","message":{"text":"json.parse_partial_json (cognitive 25): json.parse_partial_json has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, error handling 2 (3 pts), loops 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":"libs/core/langchain_core/utils/json.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dd7199a0dc28f93aaea268acd83f72c7f5266d20c17260c5534c06a4d9b0df"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._collect_code_execution_tool_ids (cognitive 25): chat_models._collect_code_execution_tool_ids has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9bdb5ea754386769c02ac889eefcfb61db659e768609676c176f36f51adf71"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._format_message_content (cognitive 25): chat_models._format_message_content has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ef5625f129b2376b647ef54e7f8873c9f98220ff53984bee9781007cf73b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHuggingFace._stream (cognitive 25): ChatHuggingFace._stream 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":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cbe1bb54170f979ee3db6ed75ad677c8b0530e1d48e353f9148dcec2e28e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"base._convert_dict_to_message (cognitive 25): base._convert_dict_to_message has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), error handling 1 (4 pts), loops 1 (3 pts), ternaries 1 (2 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b8a80572256eac7478bda0b5f89b53ad9e73f17a00bb6b091a832d7b142a73"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._translate_responses_input (cognitive 25): chat_models._translate_responses_input has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06f5bfd8c4f93a132aaab86beb624f5342bdf33283028b01c32f73ac81aecdf"}},{"ruleId":"D2","level":"warning","message":{"text":"deprecation.warn_deprecated (cognitive 24): deprecation.warn_deprecated has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 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":"libs/core/langchain_core/_api/deprecation.py"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcba374311ab349c55c4c495ced37a660335b3f6e5f3fa92a4d4d8979939382"}},{"ruleId":"D2","level":"warning","message":{"text":"_ChatModelStreamBase._push_content_block_finish (cognitive 24): _ChatModelStreamBase._push_content_block_finish has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5 (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":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"396a8d840ddec2b6db540c5b3618d2890fbd988e58d61021739759825bf6ac91"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._generate_response_from_error (cognitive 24): chat_models._generate_response_from_error has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 3 (10 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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c323fdef58b9982538fa1df8c3132a11acc73ab3b5f42c51f92c416e4d930c"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseTool.run (cognitive 24): BaseTool.run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), error handling 4 (6 pts), ternaries 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdc630673d37eba99d83f4f4e649d3dda437ad1946c134217d761de9d49665c"}},{"ruleId":"D2","level":"warning","message":{"text":"base.get_all_basemodel_annotations (cognitive 24): base.get_all_basemodel_annotations has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (7 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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"6768845b7f11d50542eb4b7dc45ee72b5f1b125316e8c776c982ff52cb8a3dde"}},{"ruleId":"D2","level":"warning","message":{"text":"html.extract_sub_links (cognitive 24): html.extract_sub_links has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 1 (2 pts), loops 2, 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":"libs/core/langchain_core/utils/html.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9d3f4758485c2510db3839d44c61b13f5c10a147254d0dd9df720cb3aff180"}},{"ruleId":"D2","level":"warning","message":{"text":"ClearToolUsesEdit.apply (cognitive 24): ClearToolUsesEdit.apply has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/context_editing.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d317ac3651b5b98d9a47c309b39c1d5662e9d8cd2982c2c0a6ae01eacca06d1"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatAnthropic._assert_valid_model_configuration (cognitive 24): ChatAnthropic._assert_valid_model_configuration has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 8 (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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":1804}}}],"partialFingerprints":{"codehealthFindingId/v1":"e289d1cee21b24f1a51e861b52a05e28c2be3394796795cb853ddbe787825287"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicLLM._format_messages (cognitive 24): AnthropicLLM._format_messages has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/anthropic/langchain_anthropic/llms.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2eec81e16d43f671587f2583e4937f0c5afc961f6883e3b27b30e9d1f43e271"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatFireworks._combine_llm_outputs (cognitive 24): ChatFireworks._combine_llm_outputs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e080cdb7968f18d52871e4011ece44e83a7b84d7b1112e003b2a9fa427cc357"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI._generate (cognitive 24): BaseChatOpenAI._generate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, error handling 3, loops 1 (3 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea9de8e1671db9dcc482fadbc41bc30816b4d1b615379addbb29175f7c64316"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI._create_chat_result (cognitive 24): BaseChatOpenAI._create_chat_result has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, ternaries 2 (3 pts), error handling 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b97c3d811a47144cf0ebbb23309fb93d635084389a2804776d167eb7adb7a3"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIEmbeddings.validate_environment (cognitive 24): OpenAIEmbeddings.validate_environment has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 2 (7 pts), boolean chains 4 (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":"libs/partners/openai/langchain_openai/embeddings/base.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6a4f1126d374302fc0b017f5cc0ee00bf7b5b3c8ace6579bde79e5b1a24762"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPromptTemplate.validate_input_variables (cognitive 23): ChatPromptTemplate.validate_input_variables has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2, 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":"libs/core/langchain_core/prompts/chat.py"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92cffcd4b311f15bb166d4199f2d07967d636ce08f3bad15a4a236e6d4eb29f"}},{"ruleId":"D2","level":"warning","message":{"text":"NonLocals.visit_Attribute (cognitive 23): NonLocals.visit_Attribute has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (6 pts) (nesting depth added 14). 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":"libs/core/langchain_core/runnables/utils.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"1384462e322c673f2eaaab113521bb0778bd7bfccdcf7041a3c055001bfdfc05"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIAssistantRunnable._get_response (cognitive 23): OpenAIAssistantRunnable._get_response has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (2 pts), ternaries 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. This shape REPEATS in the file: one other method here (OpenAIAssistantRunnable._aget_response) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"c650a7574027f4950ebf40ce7dcdf130ec8754118df3692c396c0b0b7eccfab1"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIAssistantRunnable._aget_response (cognitive 23): OpenAIAssistantRunnable._aget_response has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (2 pts), ternaries 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. This shape REPEATS in the file: one other method here (OpenAIAssistantRunnable._get_response) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f41a9d3f1a3fbb53b0429bc1504b364bed3fd5da5f4e675f00b1d1090b23d56"}},{"ruleId":"D2","level":"warning","message":{"text":"openapi._format_url (cognitive 23): openapi._format_url has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 3 (11 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/chains/openai_functions/openapi.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2811ed8bd88153a156b212287f99f34c477a5f54e961b21dbeba6f18b9f7a71c"}},{"ruleId":"D2","level":"warning","message":{"text":"StateFileSearchMiddleware._handle_grep_search (cognitive 23): StateFileSearchMiddleware._handle_grep_search has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), boolean chains 2, error handling 1, ternaries 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":"libs/partners/anthropic/langchain_anthropic/middleware/file_search.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98032147bbe897f70127db5cbaaacc6799036b852ebe0a030d2c239f894e511"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_dict_to_message (cognitive 23): chat_models._convert_dict_to_message has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 1 (4 pts), boolean chains 3, loops 1 (3 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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a049a39c638509e3c98ce3043c7c33f54db1a5b11dc151add0b3dcbda04a2b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatGroq._stream (cognitive 23): ChatGroq._stream has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ChatGroq._astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ee537ca51ef29559ea9425be33420e277512e57e96bdcb072f835a3d7804e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatGroq._astream (cognitive 23): ChatGroq._astream has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ChatGroq._stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b182ba54634b285927d60875c8b65d1045b886a038bd94e231b094a9225e941"}},{"ruleId":"D2","level":"warning","message":{"text":"huggingface._convert_chunk_to_message_chunk (cognitive 23): huggingface._convert_chunk_to_message_chunk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 8, loops 1 (2 pts) (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":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"52659e64f230cb1122de7945b1d04492e5fe4582e3d21aead39dcf168f85becf"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat._implode_reasoning_blocks (cognitive 23): _compat._implode_reasoning_blocks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, 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":"libs/partners/openai/langchain_openai/chat_models/_compat.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"244e7fad1b3642b3f62a834710ae289b843b82f6866eed4b0722c713ca173fb7"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI._stream_responses (cognitive 23): BaseChatOpenAI._stream_responses has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, error handling 2, ternaries 1 (2 pts), 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. This shape REPEATS in the file: one other method here (BaseChatOpenAI._astream_responses) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2238e3784547eda89eb424650dfdff114b37ef2a3524b38820a3028ca3e0123"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI._astream_responses (cognitive 23): BaseChatOpenAI._astream_responses has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, error handling 2, ternaries 1 (2 pts), 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. This shape REPEATS in the file: one other method here (BaseChatOpenAI._stream_responses) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00e4f8b97cc18fcc42788acd1d6b4dea9b76066b43a33025beb444a7073de12"}},{"ruleId":"D2","level":"warning","message":{"text":"base._convert_delta_to_message_chunk (cognitive 23): base._convert_delta_to_message_chunk has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 8, error handling 1 (2 pts) (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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34d6a32fa0229c8426de86311aff448c3b72c3241e8ab6bf46cf8bc40aaf84d"}},{"ruleId":"D2","level":"warning","message":{"text":"chat._create_template_from_message_type (cognitive 22): chat._create_template_from_message_type has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/prompts/chat.py"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"046a39c8d406aea56885d483de64b0b17b332b9cbb08bc521949eae50b05956f"}},{"ruleId":"D2","level":"warning","message":{"text":"config.ensure_config (cognitive 22): config.ensure_config has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/config.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2284ecc75e7f71ceabc6f2a659bcec046b463760076d6c85496f73ed582b2a03"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentExecutor._iter_next_step (cognitive 22): AgentExecutor._iter_next_step has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 3 (4 pts), loops 2, error handling 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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"d576be328759ae458d59ecaf15615f33333ce39b3512018dc44ddc9c4fbf19f4"}},{"ruleId":"D2","level":"warning","message":{"text":"ShellSession._collect_output (cognitive 22): ShellSession._collect_output has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, error handling 1 (2 pts), 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":"libs/langchain_v1/langchain/agents/middleware/shell_tool.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"30abf18b9615672e472a6fdf2d94a166d42e267d1c6bcebf93df6e877f290874"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_message_to_dict (cognitive 22): chat_models._convert_message_to_dict has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5e0eb9024544d81648216cc647a39e1e90db181290b6cfc24181fde0c88302"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHuggingFace._inherit_llm_properties (cognitive 22): ChatHuggingFace._inherit_llm_properties has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, loops 2 (3 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":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c6b8c533e09fa3581009c78db968f1f381b08300f0a16ed4e58d31bad8e1f7"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat._convert_annotation_from_v1 (cognitive 22): _compat._convert_annotation_from_v1 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/_compat.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8193c8848c118fb3f5e807754cfacef96224754a3b2261d62758f49093337e"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI._agenerate (cognitive 22): BaseChatOpenAI._agenerate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, error handling 3, loops 1 (3 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"55522f922c5558b800b4b995207f0571b161df99ed8f9e740e229c44f4c8d12b"}},{"ruleId":"D2","level":"warning","message":{"text":"AzureOpenAI.validate_environment (cognitive 22): AzureOpenAI.validate_environment has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, 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":"libs/partners/openai/langchain_openai/llms/azure.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"429ad06bbbaa4bf3578eb281894b49451cba01435a38a3fdcf8914b8783c3bc9"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPerplexity._generate (cognitive 22): ChatPerplexity._generate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (ChatPerplexity._agenerate) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0766fdd2f1c97bb322328d93540f03f07de2244902b94461642cbedc5ea354e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPerplexity._agenerate (cognitive 22): ChatPerplexity._agenerate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, ternaries 2 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (ChatPerplexity._generate) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc40f0d523150186d41b162e3428febab523acf59dafb612b659441cce7fdbec"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.trim_messages (cognitive 21): utils.trim_messages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3, ternaries 1 (2 pts) (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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de82c6b3fbd5cf5a95fa825a48edcca4705048d9a1e8096a2507d3a35e9c442"}},{"ruleId":"D2","level":"warning","message":{"text":"_StreamingParser.parse (cognitive 21): _StreamingParser.parse has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), error handling 1, 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":"libs/core/langchain_core/output_parsers/xml.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8a1d26b5050b541700cb3ccd751ba567862e802e0726ea6529d342713c3629"}},{"ruleId":"D2","level":"warning","message":{"text":"base._get_injected_args_keys_from_signature (cognitive 21): base._get_injected_args_keys_from_signature has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aba656a3b4935f95a1960027a711551db98c9f1b9fd27733d599ae52b6f0072"}},{"ruleId":"D2","level":"warning","message":{"text":"_TracerCore._complete_llm_run (cognitive 21): _TracerCore._complete_llm_run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (6 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":"libs/core/langchain_core/tracers/core.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"063836c17e1ba66d216a22c71787d7ed552152d6c303d18d3c0e90b50035759c"}},{"ruleId":"D2","level":"warning","message":{"text":"_gateway._resolve_gateway_config (cognitive 21): _gateway._resolve_gateway_config has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (6 pts), boolean chains 3 (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":"libs/core/langchain_core/utils/_gateway.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"593e6c3943c2d536b6da5af6cc47430954dcb6443a3e0b1cac2c6320793cbb91"}},{"ruleId":"D2","level":"warning","message":{"text":"_merge.merge_dicts (cognitive 21): _merge.merge_dicts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 5, loops 2 (3 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":"libs/core/langchain_core/utils/_merge.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dad128893e7801238eb2663d2b0c61a3403e31b6ac23498361e2e81dee27d26"}},{"ruleId":"D2","level":"warning","message":{"text":"mustache.tokenize (cognitive 21): mustache.tokenize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), error handling 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/utils/mustache.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c5df6f274c5a38662455a1ae28b866a17fbed754cca95c39d9dd522cf4f8ea"}},{"ruleId":"D2","level":"warning","message":{"text":"base.fix_filter_directive (cognitive 21): base.fix_filter_directive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6 (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":"libs/langchain/langchain_classic/chains/query_constructor/base.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"6859dcbec9a23abd9b21d91d89ceed96e5ba327a4d913d64bffadb7a3602c606"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatGroq.with_structured_output (cognitive 21): ChatGroq.with_structured_output has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 2 (4 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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf996d58634fb8f8153eced9577028c67f29b4b7709af20c49cf9d0fe2fce68"}},{"ruleId":"D2","level":"warning","message":{"text":"OllamaLLM._astream_with_aggregation (cognitive 21): OllamaLLM._astream_with_aggregation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 1 (3 pts), 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. This shape REPEATS in the file: one other method here (OllamaLLM._stream_with_aggregation) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/ollama/langchain_ollama/llms.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8846ef3e709575323e6814331fbb47bbaa31e82836bb30ad6c58b34190ff620"}},{"ruleId":"D2","level":"warning","message":{"text":"OllamaLLM._stream_with_aggregation (cognitive 21): OllamaLLM._stream_with_aggregation has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), ternaries 1 (3 pts), 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. This shape REPEATS in the file: one other method here (OllamaLLM._astream_with_aggregation) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/ollama/langchain_ollama/llms.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"432520921c72fd80c0ed943a4b302b1805daa9a0b16c34c39fb649d7dd8b1178"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._convert_dict_to_message (cognitive 21): chat_models._convert_dict_to_message has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 1 (4 pts), loops 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":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8dda6940b4b422c713d8c045db006a7909d13ecd3f4866e0dc6097f2040bad"}},{"ruleId":"D2","level":"warning","message":{"text":"Qdrant.construct_instance (cognitive 21): Qdrant.construct_instance has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5 (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. This shape REPEATS in the file: one other method here (Qdrant.aconstruct_instance) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"e117c5960e636e0b6e303f3a8100125f319de587e47dd8ac0f572122641ee047"}},{"ruleId":"D2","level":"warning","message":{"text":"Qdrant.aconstruct_instance (cognitive 21): Qdrant.aconstruct_instance has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5 (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. This shape REPEATS in the file: one other method here (Qdrant.construct_instance) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51050fa02e456d47e2e72add3ecb5ed0a7216385fdfe7d9275eb12a74390177"}},{"ruleId":"D2","level":"warning","message":{"text":"client._parse_retry_after (cognitive 21): client._parse_retry_after has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/typesafe/langchain_typesafe/client.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad4739993158d61f99c418e17839ace0706a76d3f3c00f8b81683fcb4a24925"}},{"ruleId":"D2","level":"warning","message":{"text":"RecursiveCharacterTextSplitter._split_text (cognitive 21): RecursiveCharacterTextSplitter._split_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 3 (4 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/text-splitters/langchain_text_splitters/character.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ecb910c40ef7f240ae3b643f925febe432710dd89d9500c40680b7cbb590bb"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncProjection.__iter__ (cognitive 20): SyncProjection.__iter__ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 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. This shape REPEATS in the file: one other method here (ChatModelStream.__iter__) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eadb8d317ccf33af9f80d502e2aa8a9beeea532c185d8b7cba0d1abf7e425d"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatModelStream.__iter__ (cognitive 20): ChatModelStream.__iter__ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 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. This shape REPEATS in the file: one other method here (SyncProjection.__iter__) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0067dd6742cdd2512e2a6d6f31d49f973a0d11f59b525d8cd5d995f1c185c66"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatGeneration.set_text (cognitive 20): ChatGeneration.set_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 10). 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":"libs/core/langchain_core/outputs/chat_generation.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dd809c1813982bb713534c114e6fe605e46ec215f18de0618c769740731ab2"}},{"ruleId":"D2","level":"warning","message":{"text":"graph_mermaid._render_mermaid_using_api (cognitive 20): graph_mermaid._render_mermaid_using_api has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 1 (2 pts), boolean chains 1, loops 1, ternaries 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":"libs/core/langchain_core/runnables/graph_mermaid.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfa9a9cc998d1bbae770a7d62ead9d4080dbd9ec57333cb3c4dc159ef4e5b1b"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnablePassthrough.atransform (cognitive 20): RunnablePassthrough.atransform has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 1 (4 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/passthrough.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a9786552dd126dd03833d696cc5fd5be11ae50b1fef12a38c9f0136eb9211a"}},{"ruleId":"D2","level":"warning","message":{"text":"StructuredTool.from_function (cognitive 20): StructuredTool.from_function has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7 (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":"libs/core/langchain_core/tools/structured.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8396dd659a10e7bc3e75ecf77c1d9ef45898358d3151b4a9ba01870520ca52f4"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentExecutor._aiter_next_step (cognitive 20): AgentExecutor._aiter_next_step has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 3 (4 pts), loops 2, error handling 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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4514259ac53f6db136cf4363a15ac0f75f1ebdb81d34821cdfbf27c8c4f6b08"}},{"ruleId":"D2","level":"warning","message":{"text":"PandasDataFrameOutputParser.parse (cognitive 20): PandasDataFrameOutputParser.parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), ternaries 1 (2 pts), error handling 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":"libs/langchain/langchain_classic/output_parsers/pandas_dataframe.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7805555494ea382562caa29ab0d678b1bca717aa644efe808b99ba6631dbd02"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models.convert_to_anthropic_tool (cognitive 20): chat_models.convert_to_anthropic_tool has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":3208}}}],"partialFingerprints":{"codehealthFindingId/v1":"859aa5312b7461864e0e97f416c5f1d1a978cec3a1b5fe6e1fd62cf50216a4b7"}},{"ruleId":"D2","level":"warning","message":{"text":"huggingface._convert_dict_to_message (cognitive 20): huggingface._convert_dict_to_message has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 1 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d1e14fbb9a1bdd6b69065969a26eb7acd86527699ead31e9925bb072c14a71"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI._combine_llm_outputs (cognitive 20): BaseChatOpenAI._combine_llm_outputs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5df997f8747120d2f2008b8e461399222d8f084b577d9603ea1368b892d956b"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatOpenAI._convert_chunk_to_generation_chunk (cognitive 20): BaseChatOpenAI._convert_chunk_to_generation_chunk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, ternaries 2 (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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7463beb2a470cb73aa8362f4f613e44081c01d0478199b596c7733018702832"}},{"ruleId":"D2","level":"warning","message":{"text":"_classifier_input._without_media (cognitive 20): _classifier_input._without_media has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), boolean chains 3 (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":"libs/partners/openai/langchain_openai/decisions/_classifier_input.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d80894c61cc937c9890bbe910eaf1d77271827d7464ba14eab5c92735f8fdb7"}},{"ruleId":"D2","level":"warning","message":{"text":"AIMessageChunk.content_blocks (cognitive 19): AIMessageChunk.content_blocks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, error handling 1 (3 pts), 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":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94f7fe70966ab987bc0b1c1b91ab7fb9cfcb8cce2312618bf3446abec2da10f"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._convert_to_message (cognitive 19): utils._convert_to_message has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59a0ea8dc034b7e3a7170c48e779344f40238fe5befb6c5b2e2e0e4d4b156bc"}},{"ruleId":"D2","level":"warning","message":{"text":"ListOutputParser._transform (cognitive 19): ListOutputParser._transform has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts), error handling 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. This shape REPEATS in the file: one other method here (ListOutputParser._atransform) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/output_parsers/list.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11d2b1c7e9207302519a01230644c147b8893edec90eee2292a49a009af8876"}},{"ruleId":"D2","level":"warning","message":{"text":"ListOutputParser._atransform (cognitive 19): ListOutputParser._atransform has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts), error handling 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. This shape REPEATS in the file: one other method here (ListOutputParser._transform) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/output_parsers/list.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"076c3e0fb47abe7509d3979f920aa87c82ddf196042af6f93d32fa2920c0c119"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnableWithFallbacks.stream (cognitive 19): RunnableWithFallbacks.stream has cognitive complexity 19 (threshold 15). Drivers by points: error handling 4 (7 pts), if/else 3 (4 pts), boolean chains 3, ternaries 1 (3 pts), 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. This shape REPEATS in the file: one other method here (RunnableWithFallbacks.astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/fallbacks.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a64ce0e2374453ae28f5ae4fb53a15445099634e66c4e7fb4934d86a384763"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnableWithFallbacks.astream (cognitive 19): RunnableWithFallbacks.astream has cognitive complexity 19 (threshold 15). Drivers by points: error handling 4 (7 pts), if/else 3 (4 pts), boolean chains 3, ternaries 1 (3 pts), 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. This shape REPEATS in the file: one other method here (RunnableWithFallbacks.stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/fallbacks.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"100094549ff7a8d07ff56d2d649b11cb307fbbeed48976dcc3523c928a31e3e2"}},{"ruleId":"D2","level":"warning","message":{"text":"AsciiCanvas.line (cognitive 19): AsciiCanvas.line has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (9 pts), loops 3 (6 pts), if/else 3, 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":"libs/core/langchain_core/runnables/graph_ascii.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfceb2d84580ccbbb206ce2a2bd52f0e318abda94e56887772227f380e8da0bd"}},{"ruleId":"D2","level":"warning","message":{"text":"base._parse_ai_message (cognitive 19): base._parse_ai_message has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (4 pts), ternaries 1 (3 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":"libs/langchain/langchain_classic/agents/openai_functions_multi_agent/base.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a005e074e9548824c8ecf84ca7b8c9ef54a0fa509c953c6aa49433fb3d2efb92"}},{"ruleId":"D2","level":"warning","message":{"text":"_DatasetRunContainer._collect_metrics (cognitive 19): _DatasetRunContainer._collect_metrics has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 2 (8 pts), loops 3 (7 pts), if/else 1 (3 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":"libs/langchain/langchain_classic/smith/evaluation/runner_utils.py"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e86faefad7e532e74ba35af4d48d97548feb7a1124a740323b03165092e486"}},{"ruleId":"D2","level":"warning","message":{"text":"factory._resolve_schema (cognitive 19): factory._resolve_schema has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (7 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":"libs/langchain_v1/langchain/agents/factory.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f200031a12b0ce302c6e9034af4e0de768279771accfa14ea9cc3684bd3c1420"}},{"ruleId":"D2","level":"warning","message":{"text":"ShellSession._collect_output_after_exit (cognitive 19): ShellSession._collect_output_after_exit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 1 (2 pts), boolean chains 1, 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":"libs/langchain_v1/langchain/agents/middleware/shell_tool.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c57bb3796a350cebf85c8992c527ba62059f5380ae2d587611590209be17b2"}},{"ruleId":"D2","level":"warning","message":{"text":"experimental._xml_to_function_call (cognitive 19): experimental._xml_to_function_call has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 4, 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":"libs/partners/anthropic/langchain_anthropic/experimental.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8f46828a745177bdfc1353b92fd3eea9503ce367b1ddcdd24d9067b7b98c1f"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat_bridge._iter_protocol_blocks (cognitive 18): _compat_bridge._iter_protocol_blocks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), boolean chains 1, error handling 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":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4fdcec27bb22a99164a3dc71927e94dd7431b05409949ab6dffb20898c803c"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat_bridge._start_skeleton (cognitive 18): _compat_bridge._start_skeleton has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (18 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":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6757a84e450da0c9591ed62b2557c79c44c217eb850c0d08b7444ba0f9a4103d"}},{"ruleId":"D2","level":"warning","message":{"text":"ai.add_ai_message_chunks (cognitive 18): ai.add_ai_message_chunks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), ternaries 2 (3 pts), boolean chains 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":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95a535fdf2b0e7023f9376a6a93fb7ee3be81fbcd01c6a6e761deebfb56c99e"}},{"ruleId":"D2","level":"warning","message":{"text":"SequentialChain.validate_chains (cognitive 18): SequentialChain.validate_chains has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 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":"libs/langchain/langchain_classic/chains/sequential.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1457b53ddc3a45e35bfb5dc594443c9cb0b22e74539c23ed44042db3b280de"}},{"ruleId":"D2","level":"warning","message":{"text":"_PIIStreamTransformer._process_tools_event (cognitive 18): _PIIStreamTransformer._process_tools_event has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 1 (2 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":"libs/langchain_v1/langchain/agents/middleware/pii.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe1c7abcf81eeb72459c6b105ff7d7b74507f98d851195d9f3c65e72973ffbd"}},{"ruleId":"D2","level":"warning","message":{"text":"provider_tool_search._get_model_provider (cognitive 18): provider_tool_search._get_model_provider has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, ternaries 1 (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":"libs/langchain_v1/langchain/agents/middleware/provider_tool_search.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b235ba37b57f01a3f1e831de33d3fa0c87fed34775f2643d81079a48b5e13b"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRetryMiddleware.wrap_tool_call (cognitive 18): ToolRetryMiddleware.wrap_tool_call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 2 (4 pts), loops 1, ternaries 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. This shape REPEATS in the file: one other method here (ToolRetryMiddleware.awrap_tool_call) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/tool_retry.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d821621d35914a8525369b397086ebb08822dfa15fb1c56a1fb733b1235bfe6"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRetryMiddleware.awrap_tool_call (cognitive 18): ToolRetryMiddleware.awrap_tool_call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 2 (4 pts), loops 1, ternaries 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. This shape REPEATS in the file: one other method here (ToolRetryMiddleware.wrap_tool_call) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/tool_retry.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d88b18d95b3b215975d5c621f56ec5d3df94106bfc5e0a6f12b24a601c6f27"}},{"ruleId":"D2","level":"warning","message":{"text":"tools._convert_content_block (cognitive 18): tools._convert_content_block has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4 (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":"libs/langchain_v1/langchain/mcp/tools.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44057d6528822248ad2f0645e3e59f083f09a01830dbb793a45474401a89924"}},{"ruleId":"D2","level":"warning","message":{"text":"_summary.summarize (cognitive 18): _summary.summarize has cognitive complexity 18 (threshold 15). Drivers by points: error handling 4 (9 pts), if/else 3 (5 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":"libs/model-profiles/langchain_model_profiles/_summary.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4ee0ddbc0f116f57b554f7dd4eef928f9c05e5e8523f8feb7c25bc2076077e"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._parse_arguments_from_tool_call (cognitive 18): chat_models._parse_arguments_from_tool_call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 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":"libs/partners/ollama/langchain_ollama/chat_models.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"894847642cd82453807f252b746382112f797f3659f4d56b6f193ddebc97fe50"}},{"ruleId":"D2","level":"warning","message":{"text":"AzureOpenAIEmbeddings.validate_environment (cognitive 18): AzureOpenAIEmbeddings.validate_environment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, ternaries 2 (nesting depth added 3). 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":"libs/partners/openai/langchain_openai/embeddings/azure.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"542baa0673fbe42c9515b95daa3616ca49ad706ab53e065f808bcc07f056101e"}},{"ruleId":"D2","level":"warning","message":{"text":"AIMessageChunk.init_server_tool_calls (cognitive 17): AIMessageChunk.init_server_tool_calls has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 1 (4 pts), boolean chains 3, 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":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb16e8d4c56dbceefecaf54e0d164220e48ab0b6ef1ab8b27463b2d0c19dc5c"}},{"ruleId":"D2","level":"warning","message":{"text":"openai._explode_reasoning (cognitive 17): openai._explode_reasoning has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb52c5f772c20cbfaa4469fe7221bb154028ed466e96be4d2f214bc63939c0a"}},{"ruleId":"D2","level":"warning","message":{"text":"string.mustache_schema (cognitive 17): string.mustache_schema has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/prompts/string.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f947a0a3b914ac666395c981e3e60ac2049a688b8ccb06a4e4f0d76afb31f799"}},{"ruleId":"D2","level":"warning","message":{"text":"graph_ascii.draw_ascii (cognitive 17): graph_ascii.draw_ascii has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (8 pts), if/else 2 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/graph_ascii.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"81985c68c8f97997377e28c8a67330fdb21af4f20e2ff91bca882d871dc03390"}},{"ruleId":"D2","level":"warning","message":{"text":"LogStreamCallbackHandler.include_run (cognitive 17): LogStreamCallbackHandler.include_run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/tracers/log_stream.py"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dbc325e030b84294f6f6b91afa366a05fc13d710bc3dfdb96969d185e49112"}},{"ruleId":"D2","level":"warning","message":{"text":"aiter.tee_peer (cognitive 17): aiter.tee_peer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (5 pts), error handling 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":"libs/core/langchain_core/utils/aiter.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"52658c71f5cfd2df8e608f8dace30c60ecf7239a8d553d7adf02419e506eb894"}},{"ruleId":"D2","level":"warning","message":{"text":"iter.tee_peer (cognitive 17): iter.tee_peer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (5 pts), error handling 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":"libs/core/langchain_core/utils/iter.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea054093cb4b50ebeec86799cf32e5db417593ac96f9c0ea3f3446482a98310"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentExecutorIterator.__aiter__ (cognitive 17): AgentExecutorIterator.__aiter__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), error handling 2, 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":"libs/langchain/langchain_classic/agents/agent_iterator.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f816dc63f22e85bcbd2ea3f532804afebd900a9e87ecff9bcf263c5674b88dd"}},{"ruleId":"D2","level":"warning","message":{"text":"model_fallback._sanitize_request_for_fallback (cognitive 17): model_fallback._sanitize_request_for_fallback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3 (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":"libs/langchain_v1/langchain/agents/middleware/model_fallback.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f40ae5486ebec46b8afc13b6efdfe74221e1b58d35bf6c866da40fd7836ee71"}},{"ruleId":"D2","level":"warning","message":{"text":"SummarizationMiddleware._find_token_based_cutoff (cognitive 17): SummarizationMiddleware._find_token_based_cutoff has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), 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":"libs/langchain_v1/langchain/agents/middleware/summarization.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c4f295f2bb348d2cf39d8edd8ddc826ea5b84220266cd38e0c953fcf1b70e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatAnthropic.with_structured_output (cognitive 17): ChatAnthropic.with_structured_output has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa81082cf082508e2280d1f3a5bc1ab9f91562ff5bf77eb3f96caa5642c283ab"}},{"ruleId":"D2","level":"warning","message":{"text":"chat_models._create_usage_metadata (cognitive 17): chat_models._create_usage_metadata has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 1 (2 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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":3340}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cb3694dda57aeeefb8e78078c0efaf6d394096b6d00b466fa6c124a75e6ade"}},{"ruleId":"D2","level":"warning","message":{"text":"_compat._convert_from_v1_to_chat_completions (cognitive 17): _compat._convert_from_v1_to_chat_completions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (2 pts) (nesting depth added 10). 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":"libs/partners/openai/langchain_openai/chat_models/_compat.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6ce48a14fd88fbf7ed4c852d6db5742a6f794287ed069c64a4f62214d9d643"}},{"ruleId":"D2","level":"warning","message":{"text":"codex._maybe_has_system_messages (cognitive 17): codex._maybe_has_system_messages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, 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":"libs/partners/openai/langchain_openai/chat_models/codex.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0dce4e17c63746e50789904ead89bf03180784f282fe3bb40258e76966fda0"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatPerplexity._default_params (cognitive 17): ChatPerplexity._default_params has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16 (17 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacc4caea9117bf73aff6b9150c28d16bdfe360a5db2108ee175396b0d615e0e"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseChatModel.agenerate (cognitive 16): BaseChatModel.agenerate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 1, ternaries 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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1761}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3991f47ed62840ed23fa96f17e93e4e8b753dab72f5e1e2dae73dd7b7fa67e"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseLLM.stream (cognitive 16): BaseLLM.stream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"f334a5019f6eaeabfd6cbb92a17be3fba8bf53e6dffe06767592bcc0cfce48a7"}},{"ruleId":"D2","level":"warning","message":{"text":"AIMessage._backwards_compat_tool_calls (cognitive 16): AIMessage._backwards_compat_tool_calls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 1 (2 pts), boolean chains 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":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"8557edcf31e80f697486e708e21fc65ce015890f794df063ace7cf2fc6e7b3d8"}},{"ruleId":"D2","level":"warning","message":{"text":"google_genai.translate_grounding_metadata_to_citations (cognitive 16): google_genai.translate_grounding_metadata_to_citations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 5, loops 2 (3 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":"libs/core/langchain_core/messages/block_translators/google_genai.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d766bd8dd139537dea588128a4ad013594bb9806fdc0f1c3afa21cbb14629bea"}},{"ruleId":"D2","level":"warning","message":{"text":"content.is_data_content_block (cognitive 16): content.is_data_content_block has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7 (nesting depth added 3). 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":"libs/core/langchain_core/messages/content.py"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a56538ad16ffbce7155b1dc4f0be9e583be21c532a9d0f3869f092d43d59ee"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonOutputFunctionsParser.parse_result (cognitive 16): JsonOutputFunctionsParser.parse_result has cognitive complexity 16 (threshold 15). Drivers by points: error handling 5 (8 pts), if/else 6 (8 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/output_parsers/openai_functions.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"435cce2021a09688e427704316b29930f2182e25c57c4423d8c60ddbf382fd91"}},{"ruleId":"D2","level":"warning","message":{"text":"dict._insert_input_variables (cognitive 16): dict._insert_input_variables has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 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":"libs/core/langchain_core/prompts/dict.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e211f58d263553c6ac5104011dfc92aeab81586d088c72d368c417e9108c19"}},{"ruleId":"D2","level":"warning","message":{"text":"Runnable._batch_with_config (cognitive 16): Runnable._batch_with_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, loops 2 (3 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, 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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3124b4419fd5c189842beed449f280064dbafae142e3bc383648aa9341de97"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnableLambda.get_graph (cognitive 16): RunnableLambda.get_graph has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":5119}}}],"partialFingerprints":{"codehealthFindingId/v1":"917ccfb7565e6bb9ff683c6d8d0cdb5c9e404ea38b35a9a9b9240fd72cc313c0"}},{"ruleId":"D2","level":"warning","message":{"text":"RunnablePassthrough.transform (cognitive 16): RunnablePassthrough.transform has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 1 (4 pts), 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":"libs/core/langchain_core/runnables/passthrough.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c60681df986c9c98caf823be93e93931d3e9ebff80180b76504cc4826a58e9"}},{"ruleId":"D2","level":"warning","message":{"text":"_RootEventFilter.include_event (cognitive 16): _RootEventFilter.include_event has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/utils.py"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ba92279fb1c461b693b929b44c5844ba9bfe5be11b5deb2b1c85bd1a8296cd"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentExecutorIterator.__iter__ (cognitive 16): AgentExecutorIterator.__iter__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 1, error handling 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":"libs/langchain/langchain_classic/agents/agent_iterator.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa6d8e8ada3890fb2610a5d5180f23e27f5e2a5f0e8269ebafd56155efd26a7"}},{"ruleId":"D2","level":"warning","message":{"text":"openapi.get_openapi_chain (cognitive 16): openapi.get_openapi_chain has cognitive complexity 16 (threshold 15). Drivers by points: error handling 3 (7 pts), if/else 3 (4 pts), boolean chains 3, 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":"libs/langchain/langchain_classic/chains/openai_functions/openapi.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad5603206560847d40473d29b2cd30624594e3572ac3c5578226fc19f646a36"}},{"ruleId":"D2","level":"warning","message":{"text":"runner_utils._sanitize_git_remote_url (cognitive 16): runner_utils._sanitize_git_remote_url has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, error handling 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/smith/evaluation/runner_utils.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5824563b8675e2623661f9073e884794a2e494df7ed382481d46a2d205ad4392"}},{"ruleId":"D2","level":"warning","message":{"text":"runner_utils._wrap_in_chain_factory (cognitive 16): runner_utils._wrap_in_chain_factory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), 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":"libs/langchain/langchain_classic/smith/evaluation/runner_utils.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ab8f0a50a2bdad8190d17c42263c1f4390fbb8e6e4422a94506a69158956a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelRetryMiddleware.wrap_model_call (cognitive 16): ModelRetryMiddleware.wrap_model_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (4 pts), 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. This shape REPEATS in the file: one other method here (ModelRetryMiddleware.awrap_model_call) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/model_retry.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"7967f4c65f1485cd0c4266546a190eacfb8f2bbf443e2682b31bd348ed7781d4"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelRetryMiddleware.awrap_model_call (cognitive 16): ModelRetryMiddleware.awrap_model_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (4 pts), 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. This shape REPEATS in the file: one other method here (ModelRetryMiddleware.wrap_model_call) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/model_retry.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"85196230a6a124b4daf2cb3edffeec88e4a5a12808d602d9328b417957180502"}},{"ruleId":"D2","level":"warning","message":{"text":"SummarizationMiddleware._find_safe_cutoff_point (cognitive 16): SummarizationMiddleware._find_safe_cutoff_point has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, 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":"libs/langchain_v1/langchain/agents/middleware/summarization.py"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"500d62c6abe4d86ddab1e086c2e6406e3d7984266325e4799dbef5840e79d0f0"}},{"ruleId":"D2","level":"warning","message":{"text":"StateFileSearchMiddleware._handle_glob_search (cognitive 16): StateFileSearchMiddleware._handle_glob_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 1, loops 1, ternaries 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":"libs/partners/anthropic/langchain_anthropic/middleware/file_search.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c2de6c938b1567e6ec6c4ad53fb9eba13d5235fc8f1efb3afe744cd5ae0c37"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatHuggingFace.from_model_id (cognitive 16): ChatHuggingFace.from_model_id has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"9301e20dcf50df06c8f92b0ea27569a6a6ed2a693c39c0df6534e6a53ce33f0c"}},{"ruleId":"D2","level":"warning","message":{"text":"HuggingFaceEndpoint._stream (cognitive 16): HuggingFaceEndpoint._stream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (HuggingFaceEndpoint._astream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f9a844432ac26e6481f4e7ed3b170ed0eaed4a43eb71ed0058290a2584a258"}},{"ruleId":"D2","level":"warning","message":{"text":"HuggingFaceEndpoint._astream (cognitive 16): HuggingFaceEndpoint._astream has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (HuggingFaceEndpoint._stream) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"2931d9890a1a9cae74be61fd55383a4d40a090dc6267f4b94100e16f9a5d72f4"}},{"ruleId":"D2","level":"warning","message":{"text":"_utils.parse_url_with_auth (cognitive 16): _utils.parse_url_with_auth has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, error handling 1 (2 pts), ternaries 1 (2 pts) (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":"libs/partners/ollama/langchain_ollama/_utils.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"579eb6413a0e97d91752c5cd2aab16eb6921f086f61914887ad8fb3b5a09dc4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runnables/base.py: FileTooLong \u2014 3556 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3056 over it, 7.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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff680769ddf2949024d75dd13b79f50ec8067cacd0af29c6be1c825961396d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chat_models/base.py: FileTooLong \u2014 3538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3038 over it, 7.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38eb9c5f9f0f2ee6092bbbabf0bcc01eff44f71d9064dc9adddcd08e1303fe6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: langchain_anthropic/chat_models.py: FileTooLong \u2014 1867 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1367 over it, 3.73\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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"954ae04b1f025de7d3addf44efb67157f79a4c66363dfc1fe6d3deaae05b9571"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: language_models/chat_models.py: FileTooLong \u2014 1755 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1255 over it, 3.51\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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f073e37e8875c1a93fd65601540ae74e2721507cc2e51862562932ec76f4ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: callbacks/manager.py: FileTooLong \u2014 1582 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1082 over it, 3.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bf75258591bce9ec5ec33ce6b123f5384e377aef31a3de9cf1fbc5b82b7177"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/factory.py: FileTooLong \u2014 1269 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 769 over it, 2.54\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":"libs/langchain_v1/langchain/agents/factory.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a71690f24c0aa2a68a5b5ce50ceacc646dc7f246343e3b6a49c48515a8dc94b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: langchain_qdrant/vectorstores.py: FileTooLong \u2014 1254 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 754 over it, 2.51\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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba005450519ffda55c9b791fa9addd4bff8a3af4302c050c1f6ac794a226148"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: langchain_fireworks/chat_models.py: FileTooLong \u2014 1169 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 669 over it, 2.34\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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5912f033816cdd43338e5e592201c1e51607e344f442ef1b31767ad7101cb41b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: evaluation/runner_utils.py: FileTooLong \u2014 1155 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 655 over it, 2.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/smith/evaluation/runner_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e5af7353a99a18b4ce0150039fa1b32e2f5c3b59664eef3cb2e85fb2f70658"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: langchain_ollama/chat_models.py: FileTooLong \u2014 1042 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 542 over it, 2.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/ollama/langchain_ollama/chat_models.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4586cb128aee80fecba08c607cb9c48d4a98f43ccfc7f9cedc42545bc2fbe09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agents/agent.py: FileTooLong \u2014 1038 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 538 over it, 2.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"668570a785ab749b24fed03debc7033feffafd6d6404c103d7a9036d9d3d46b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: langchain_perplexity/chat_models.py: FileTooLong \u2014 1038 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 538 over it, 2.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feefc7a1532c64ca941197ea3400b62322c266cb1f03cf84617acc8fdb2cef2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: language_models/llms.py: FileTooLong \u2014 1033 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 533 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f6b027c1baec0b25aca385807d51b4e53c829b25ffc33afa74e12a73c1a1ef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Runnable: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d360bd06d53e72449c7e3aa89be62a79f3c5e3cc5b77832fc61839c31f0e645d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/base.py: FileTooLong \u2014 984 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 484 over it, 1.97\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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f5d49fa492d5be5ac8a1e76d902ca117e773935caebe023aa15ac7e24a3258"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: langchain_openrouter/chat_models.py: FileTooLong \u2014 953 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 453 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6215aa43a83d6891c3c77c81108262834a9f85b2ada2f5cdff7c76a26ad14644"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chat_models/huggingface.py: FileTooLong \u2014 894 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 394 over it, 1.79\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":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"938992e0dc56241922980a5b14a49b90cf483b56f1b1ebc439986f7fb73cde8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: langchain_mistralai/chat_models.py: FileTooLong \u2014 890 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 390 over it, 1.78\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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0e4c4f8f631c920561806a1969de09c2b12d9a6fa68265f7b752857e415e9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: language_models/chat_model_stream.py: FileTooLong \u2014 882 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 382 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6afb7555ff085bff45b28671a4ee8ffe0c843d0f6e5846fedcb3f1382c8dad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: messages/utils.py: FileTooLong \u2014 877 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 377 over it, 1.75\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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c41ec19cb62653a83b8461fab895cd8cb5fd09b1fccab5664376128755c8ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: langchain_groq/chat_models.py: FileTooLong \u2014 835 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 335 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d68714c50651b1b4f9132a87b3dbbcec37cfa397094e21cf87fc0b742021f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: block_translators/openai.py: FileTooLong \u2014 803 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 303 over it, 1.61\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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63f8b2c4a0c568918443aa306f10d07913ba5b53c40acfe0b42984d41168d78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: middleware/types.py: FileTooLong \u2014 800 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 300 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/types.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbbc9a98c5e02f472eef3c5dd4cb63e1b4790801ceb72156ae2de3fc9c686bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chat_models/azure.py: FileTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 272 over it, 1.54\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":"libs/partners/openai/langchain_openai/chat_models/azure.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c44c25dc90ed894c5045584559e0393d0b50fb47fa6d0d3de7e484ac57a0f79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BaseChatModel: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"1006b35ffae2564034cd08e8553e13f31db87df487688dfce77232647635cfd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tracers/event_stream.py: FileTooLong \u2014 763 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 263 over it, 1.53\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":"libs/core/langchain_core/tracers/event_stream.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f34bd5efba58b46a1c92154a7ce7705598699da68ed2a267105049fe79907ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _TracerCore: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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":"libs/core/langchain_core/tracers/core.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5e9f6ab518d6f56576a743fb094d02786f5b07616256b80617a62973f40e80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: langchain_chroma/vectorstores.py: FileTooLong \u2014 726 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 226 over it, 1.45\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":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14f445e398791fe9bea96d5b59e80f480fcf1dcfb1713b752bf0f960a0a0766"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: langchain_openai/chatgpt_oauth.py: FileTooLong \u2014 668 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 168 over it, 1.34\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":"libs/partners/openai/langchain_openai/chatgpt_oauth.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5a332696c952b93f3e2dc481124a22c4f21da722fdd66411abb324c4d88211"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: middleware/shell_tool.py: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/shell_tool.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65143c94bf1d9a418454e33faf247dbf5862de4a8d86b2719516b871cc3c84d2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Qdrant: 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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e6fe55e985a08114f6032581ced6ba1a693a2af4eb6989590015ae14a4d466"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: middleware/anthropic_tools.py: FileTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 147 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96da28bb93d36c0c7280d383ca040ef1fc12728ff7b9c05342ca5c4a6b51205e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chat_models/base.py: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 121 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3535dcc13b93b260481bfd3b3f9cd37f32c333e13436ec2d1992a12b6050aa8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tracers/base.py: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 105 over it, 1.21\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":"libs/core/langchain_core/tracers/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f601401af0d5a38387dca234745993950596721d0c211e2e25e15faa30b8ce7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: prompts/chat.py: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 102 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/prompts/chat.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb0065faec64f886d47dfce267fb13ec5575d8cf612d57a1c2de77193166c54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chains/loading.py: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 83 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/chains/loading.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd43a2cbd099e357538b3ef04fffbb77cb6b6fa873a2a5b91b56463d6421e108"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chat_models/base.py: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/chat_models/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cee63e79f87b67e61c699dd33a398909b3137dd7ece24a4bd8d6ef71f63db3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: langchain_text_splitters/character.py: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 74 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":"libs/text-splitters/langchain_text_splitters/character.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7bb65a39e7d673a1049a493e860b9662b85bbc4630ea7fbef9b5a747aec0be"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AsyncBaseTracer: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/tracers/base.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"21625b1348322476f8e48a0c7a24d4e73c79f59a3f2041a7ce8778ed542cdc2a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: VectorStore: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/vectorstores/base.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"248d165de3643a68f6f511089bde2f0d02352343535de37fe04937c581f06612"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: callbacks/base.py: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 41 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/callbacks/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea179eea745cbfee17e060aa8196bd3ebeb33ef5f3390db008fc5f0c6955dd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: middleware/summarization.py: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 31 over it, 1.06\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":"libs/langchain_v1/langchain/agents/middleware/summarization.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcffd7fb65bdea0d7acb444543dd48df75a20a433a8b6d74e03e4938000ea862"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: langchain_text_splitters/html.py: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 24 over it, 1.05\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":"libs/text-splitters/langchain_text_splitters/html.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"485ca231d15e1d9ad3409ca016faaef34c3b637795ed25493f0d567bcaa2dbdc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tracers/core.py: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/tracers/core.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df9448d550726dae734fffe55307713f7a315f8393d30050728e0849d53fca4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runnables/passthrough.py: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 5 over it, 1.01\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":"libs/core/langchain_core/runnables/passthrough.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2f6973374ec6742458b57dcff78e93c9cf7a65d2070a64008ed54dd876ec03"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (17 members, 32 shared lines): libs/core/scripts/check_version.py:28-61 | libs/langchain_v1/scripts/check_version.py:28-61 | libs/partners/anthropic/scripts/check_version.py:28-61 | libs/partners/chroma/scripts/check_version.py:28-61 | libs/partners/deepseek/scripts/check_version.py:28-61 | libs/partners/exa/scripts/check_version.py:28-61 | libs/partners/fireworks/scripts/check_version.py:28-61 | libs/partners/groq/scripts/check_version.py:28-61 | libs/partners/huggingface/scripts/check_version.py:28-61 | libs/partners/mistralai/scripts/check_version.py:28-61 | libs/partners/nomic/scripts/check_version.py:28-61 | libs/partners/ollama/scripts/check_version.py:28-61 | libs/partners/openai/scripts/check_version.py:28-61 | libs/partners/openrouter/scripts/check_version.py:28-61 | libs/partners/perplexity/scripts/check_version.py:28-61 | libs/partners/qdrant/scripts/check_version.py:28-61 | libs/partners/xai/scripts/check_version.py:28-61 \u2014 These 17 members are variants of one another: a block of 32 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 17 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 17 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/scripts/check_version.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d51f76a8e47ad6495df46b15b5cd3e1a185fc0e4ec49b6b2ad179f728278d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (194 shared lines): libs/core/langchain_core/indexing/api.py:310-603 | libs/core/langchain_core/indexing/api.py:649-954 \u2014 These two members are variants of one another: 194 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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3039552fb12c74b2f97648b1dcd8975b1eec6d9a8d0a3b51c34b42c2106354d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (91 shared lines): libs/core/langchain_core/messages/block_translators/anthropic.py:233-518 | libs/core/langchain_core/messages/block_translators/bedrock_converse.py:153-294 \u2014 These two members are variants of one another: 91 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":"libs/core/langchain_core/messages/block_translators/anthropic.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfa4e0f4f1cc3b5f3c8519fcd19586cfb06736f73b688c74c9279de37542edc"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (89 shared lines): libs/core/langchain_core/language_models/llms.py:864-1072 | libs/core/langchain_core/language_models/llms.py:1145-1351 \u2014 These two members are variants of one another: 89 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":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2cd611feae41d8bd01e6ae5b9bb3de0f70dee44f339985067136c878507d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (70 shared lines): libs/core/langchain_core/tools/base.py:1026-1136 | libs/core/langchain_core/tools/base.py:1154-1267 \u2014 These two members are variants of one another: 70 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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"59378086ec4305c5b2e7b16a167c95fb00793f8e430bf93cd54b83a19e40f642"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): libs/partners/openrouter/langchain_openrouter/chat_models.py:599-680 | libs/partners/openrouter/langchain_openrouter/chat_models.py:689-772 \u2014 These two members are variants of one another: 62 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":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"e030aa6d7e6a4a0ebce3f975dcdd806f8fdc31b23a99e2dfea0d74abe3814f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (48 shared lines): libs/core/langchain_core/runnables/branch.py:298-373 | libs/core/langchain_core/runnables/branch.py:382-457 \u2014 These two members are variants of one another: 48 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":"libs/core/langchain_core/runnables/branch.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc93821e94a0e8eb9c6b7e1a2f44b1c9aa0b65d810672e2dabd6cdbb36f6b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): libs/core/langchain_core/language_models/chat_models.py:1550-1609 | libs/core/langchain_core/language_models/llms.py:339-371 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"4562c995cc64ddbc8ec39a388161a1f5415d8d7492718a35fcc02a9665f798f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): libs/core/langchain_core/language_models/chat_models.py:2435-2611 | libs/partners/fireworks/langchain_fireworks/chat_models.py:1716-2051 | libs/partners/groq/langchain_groq/chat_models.py:982-1342 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:1106-1225 | libs/partners/mistralai/langchain_mistralai/chat_models.py:1023-1345 | libs/partners/ollama/langchain_ollama/chat_models.py:1452-1794 | libs/partners/openai/langchain_openai/chat_models/base.py:2632-2890 | libs/partners/openrouter/langchain_openrouter/chat_models.py:961-1064 | libs/partners/perplexity/langchain_perplexity/chat_models.py:1657-1748 \u2014 These 9 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 9 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 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"979d4c8d364d440cedee89c6d35ef758fb51833ce2c178a5cf241cc064d2c000"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): libs/core/langchain_core/messages/content.py:1034-1083 | libs/core/langchain_core/messages/content.py:1096-1149 | libs/core/langchain_core/messages/content.py:1162-1215 | libs/core/langchain_core/messages/content.py:1228-1281 | libs/core/langchain_core/messages/content.py:1295-1344 | libs/core/langchain_core/messages/content.py:1443-1480 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/content.py"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c647c285b72c800df51070d8c115edfce41b38124f6f37c266c023b8c512d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/core/langchain_core/language_models/chat_models.py:524-540 | libs/core/langchain_core/language_models/chat_models.py:551-564 | libs/core/langchain_core/language_models/llms.py:382-396 | libs/core/langchain_core/language_models/llms.py:407-418 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"37894a52236acf0f65394d08d5601d01aa221df74becd42d998c1199eccc7772"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/core/langchain_core/language_models/chat_models.py:778-898 | libs/core/langchain_core/language_models/chat_models.py:909-1033 | libs/core/langchain_core/language_models/chat_models.py:1942-2092 | libs/core/langchain_core/language_models/chat_models.py:2101-2249 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf55e9754bd7302d5692cbeaaedd2c6d250474a080eb55be2156a39c9a7621b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/core/langchain_core/runnables/base.py:3533-3650 | libs/core/langchain_core/runnables/base.py:3661-3781 | libs/core/langchain_core/runnables/fallbacks.py:273-358 | libs/core/langchain_core/runnables/fallbacks.py:369-462 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3533}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9d0d75955e9cb0f0297f58479ba48b16f51d88044b24ec638626f7c3b28a1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/core/langchain_core/runnables/fallbacks.py:168-212 | libs/core/langchain_core/runnables/fallbacks.py:221-262 | libs/core/langchain_core/runnables/fallbacks.py:471-526 | libs/core/langchain_core/runnables/fallbacks.py:535-590 \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":"libs/core/langchain_core/runnables/fallbacks.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ca5b203bee50f1447fd26d5a95c2e94c767635d89997871214bb810df22a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/langchain/langchain_classic/chains/combine_documents/map_reduce.py:175-196 | libs/langchain/langchain_classic/chains/combine_documents/map_rerank.py:147-168 | libs/langchain/langchain_classic/chains/combine_documents/refine.py:122-143 | libs/langchain/langchain_classic/chains/combine_documents/stuff.py:169-191 \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":"libs/langchain/langchain_classic/chains/combine_documents/map_reduce.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04c7c30a986c91499ca8c81d2ae5307e7a48873283687f71c692d3cdf39ad3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/langchain/langchain_classic/chains/loading.py:97-115 | libs/langchain/langchain_classic/chains/loading.py:366-392 | libs/langchain/langchain_classic/chains/loading.py:595-621 | libs/langchain/langchain_classic/chains/loading.py:625-650 \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":"libs/langchain/langchain_classic/chains/loading.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d56780bb51dda98455ebd45382764f74d538bdc7e3bc44b93d0118ce4f01a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/langchain/langchain_classic/chains/loading.py:433-459 | libs/langchain/langchain_classic/chains/loading.py:463-489 | libs/langchain/langchain_classic/chains/loading.py:496-522 | libs/langchain/langchain_classic/chains/loading.py:526-552 \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":"libs/langchain/langchain_classic/chains/loading.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"626c5a9684c5d422e29e2bfbc2b4a8c917f5a34dc751fc4d38ee56d2802de2b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/langchain_v1/langchain/agents/middleware/model_retry.py:226-273 | libs/langchain_v1/langchain/agents/middleware/model_retry.py:280-327 | libs/langchain_v1/langchain/agents/middleware/tool_retry.py:300-357 | libs/langchain_v1/langchain/agents/middleware/tool_retry.py:364-421 \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":"libs/langchain_v1/langchain/agents/middleware/model_retry.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d9bbc51c3dc61cbe8c52d4a6833fac8419a75f7ecddef0555c05df7e1e771f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/langchain_v1/langchain/agents/middleware/types.py:965-1121 | libs/langchain_v1/langchain/agents/middleware/types.py:1154-1298 | libs/langchain_v1/langchain/agents/middleware/types.py:1331-1510 | libs/langchain_v1/langchain/agents/middleware/types.py:1543-1688 \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":"libs/langchain_v1/langchain/agents/middleware/types.py"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d73339a04f46cab7aaba8244587a8049a86ef585a5e25840e50c7d089b4dfc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:294-317 | libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:324-347 | libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:788-811 | libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:818-841 \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":"libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b96d9c8e36e753230db43308429d2137b4a719b60b7c70f9412f4e9e13675c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (108 corresponding lines): libs/partners/perplexity/langchain_perplexity/chat_models.py:1207-1315 | libs/partners/perplexity/langchain_perplexity/chat_models.py:1324-1431 \u2014 These two members are one piece of code written twice and then edited apart: 108 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":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3feee91d563a3415b3318e5f13864e57cb35fe2d13466b76175f2854d4fa9315"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (129 corresponding lines): libs/partners/qdrant/langchain_qdrant/vectorstores.py:1648-1776 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:1813-1943 \u2014 These two members are one piece of code written twice and then edited apart: 129 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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5dbd90ca102bc94784babf3e2c7b1af20dba7b5af382ac5a458bb6e48a2d43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): libs/langchain/langchain_classic/agents/openai_assistant/base.py:595-669 | libs/langchain/langchain_classic/agents/openai_assistant/base.py:752-822 \u2014 These two members are one piece of code written twice and then edited apart: 71 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":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"409c6a599fa293e73282a432094a337419b06b2c96748912354e71277e23684b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (86 corresponding lines): libs/langchain_v1/langchain/agents/factory.py:287-373 | libs/langchain_v1/langchain/agents/factory.py:379-464 \u2014 These two members are one piece of code written twice and then edited apart: 86 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":"libs/langchain_v1/langchain/agents/factory.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf843aa5b61ab26bcf2dc7e83ea2245d9e66373eb6d914446773c38699054b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): libs/partners/perplexity/langchain_perplexity/chat_models.py:1440-1498 | libs/partners/perplexity/langchain_perplexity/chat_models.py:1507-1567 \u2014 These two members are one piece of code written twice and then edited apart: 59 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":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a9be538356dae83546db8d912240c9ba128b387518fa430c030f375d66eb8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): libs/partners/fireworks/langchain_fireworks/chat_models.py:1392-1454 | libs/partners/fireworks/langchain_fireworks/chat_models.py:1537-1601 \u2014 These two members are one piece of code written twice and then edited apart: 63 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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"315bd67d7f92b64ccc355b4caf402d8614b16fe47eb70d0706de15fe4f1c7316"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (79 corresponding lines): libs/partners/chroma/langchain_chroma/vectorstores.py:515-595 | libs/partners/chroma/langchain_chroma/vectorstores.py:604-682 \u2014 These two members are one piece of code written twice and then edited apart: 79 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":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cc2bdcac5bebf5e24bd9d531dba810bf62a21a2cdfc0ff17adef7fc0790959"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): libs/partners/openai/langchain_openai/chat_models/base.py:1876-1942 | libs/partners/openai/langchain_openai/chat_models/base.py:2172-2243 \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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"91298389a56904fe434ed78d70c9bd5a88e14213493e22694b12f655cf1d26ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): libs/partners/fireworks/langchain_fireworks/chat_models.py:548-612 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:253-303 \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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07180693508f909467b84c1c911bd82c7c2a1885675a56efc00105e94a84aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): libs/partners/openai/langchain_openai/chat_models/base.py:1951-2014 | libs/partners/openai/langchain_openai/chat_models/base.py:2252-2320 \u2014 These two members are one piece of code written twice and then edited apart: 64 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"c353a4d8f6bc802fa6e0b7c4270460df36e91295897e9391e29d36ce0e85cd72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (85 corresponding lines): libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:198-287 | libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:697-781 \u2014 These two members are one piece of code written twice and then edited apart: 85 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":"libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e496dabf060409a0ba83f9998231308ef82e63e6cf381583915a802d028c580"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): libs/core/langchain_core/language_models/_compat_bridge.py:592-689 | libs/core/langchain_core/language_models/_compat_bridge.py:698-768 \u2014 These two members are one piece of code written twice and then edited apart: 71 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":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"c143fcf677533d20c5efdb46b58822bd68ecae99b3b96ca9ad8039938db53544"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): libs/partners/groq/langchain_groq/chat_models.py:1376-1462 | libs/partners/openrouter/langchain_openrouter/chat_models.py:1272-1344 \u2014 These two members are one piece of code written twice and then edited apart: 73 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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c823830153a1405d96618392fafe80cc4346c6f7d7b8868b995a705494d7dcb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): libs/core/langchain_core/language_models/llms.py:522-581 | libs/core/langchain_core/language_models/llms.py:592-655 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d2393bbf4d65f51bf80e0ef15114dace0d00b5ffbc196feb04d4b8cb26744c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): libs/langchain/langchain_classic/agents/agent.py:1309-1378 | libs/langchain/langchain_classic/agents/agent.py:1448-1525 \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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c496db9a565db18f0b13bfea336ed4c1ec41074c39113310be24e5504e563c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): libs/core/langchain_core/runnables/base.py:2570-2636 | libs/core/langchain_core/runnables/base.py:2654-2724 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"061635a9c1de698af41fe93ceab52a4e9714b255763623e6bf8d83c13875affc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): libs/partners/openai/langchain_openai/embeddings/base.py:584-644 | libs/partners/openai/langchain_openai/embeddings/base.py:656-722 \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":"libs/partners/openai/langchain_openai/embeddings/base.py"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b34f3c28dd97d355b258f41f71c5fb2adfb3a5e67063937850ec8dcb9820f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): libs/core/langchain_core/runnables/retry.py:241-295 | libs/core/langchain_core/runnables/retry.py:317-370 \u2014 These two members are one piece of code written twice and then edited apart: 54 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":"libs/core/langchain_core/runnables/retry.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e726a4c66a02c4081b0e13e00d301dae2c84893f5fd8f841b5d11767463336"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): libs/partners/openai/langchain_openai/chat_models/base.py:1710-1770 | libs/partners/openai/langchain_openai/chat_models/base.py:1779-1846 \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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc636c325994b9c384f3fb18bf38cd92dd6bf8395efec55a9d169a5e1037bad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): libs/partners/groq/langchain_groq/chat_models.py:719-766 | libs/partners/groq/langchain_groq/chat_models.py:775-824 \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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62b2af91f073bc7dab8064d50e93d3e6739caa21f739499754478a17333ee00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): libs/core/langchain_core/runnables/base.py:5222-5302 | libs/core/langchain_core/runnables/base.py:5451-5533 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":5222}}}],"partialFingerprints":{"codehealthFindingId/v1":"674cec40b672753f9a94183b00181164e3d7eae49ec2e93468a8f8a5e4a7bc8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): libs/langchain/langchain_classic/indexes/_sql_record_manager.py:260-333 | libs/langchain/langchain_classic/indexes/_sql_record_manager.py:342-415 \u2014 These two members are one piece of code written twice and then edited apart: 74 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":"libs/langchain/langchain_classic/indexes/_sql_record_manager.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f5520707d55b59548b69cba70acb225035a2e960bed7c007481d3f76ea6c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (90 corresponding lines): libs/langchain/langchain_classic/agents/openai_assistant/base.py:297-386 | libs/langchain/langchain_classic/agents/openai_assistant/base.py:430-521 \u2014 These two members are one piece of code written twice and then edited apart: 90 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":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de33ef1841dea590948342da251a5e3a239cd56ff3c9458a0d07e021ef7b6b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): libs/langchain/langchain_classic/agents/agent_iterator.py:173-234 | libs/langchain/langchain_classic/agents/agent_iterator.py:237-315 \u2014 These two members are one piece of code written twice and then edited apart: 62 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":"libs/langchain/langchain_classic/agents/agent_iterator.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4e1ab7cdc512da3e7f3d43264b0476312aa319cb26c189f9a1be7af24c3ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): libs/core/langchain_core/_security/_transport.py:62-115 | libs/core/langchain_core/_security/_transport.py:148-191 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"libs/core/langchain_core/_security/_transport.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c932fb9e856f23da00c7b0df65faf25d3b438884f6942e9cfb475ea54fd102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): libs/core/langchain_core/runnables/base.py:2432-2480 | libs/core/langchain_core/runnables/base.py:2500-2555 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c52c1d043298cfc0a1f78e57ed0f7bfc58d80e352b3e9dc814fa4f227911775"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): libs/core/langchain_core/language_models/llms.py:429-465 | libs/core/langchain_core/language_models/llms.py:476-511 \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":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"34417a6a1f88a4ab82974d091fcab6d5e08804d3160091989b2953b6931f0f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 50\u002B corresponding lines): libs/partners/fireworks/langchain_fireworks/chat_models.py:141-199 | libs/partners/groq/langchain_groq/chat_models.py:1533-1595 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:186-235 | libs/partners/openrouter/langchain_openrouter/chat_models.py:1348-1411 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 50 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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba056d6dbe87d12e86f164684527b1afc4fda1081728149d15afe3b36c6d6cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:837-895 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:906-951 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"777ca3009663e4a95287615ec759828e9513259bf84964a161bcd659a338d2ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): libs/partners/fireworks/langchain_fireworks/chat_models.py:370-469 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:128-182 \u2014 These two members are one piece of code written twice and then edited apart: 55 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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb2449f42939643dcbe6adad6f6321eaa69b6577a004b6ced49d23eba3752ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): libs/langchain/langchain_classic/chains/base.py:137-184 | libs/langchain/langchain_classic/chains/base.py:193-238 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"libs/langchain/langchain_classic/chains/base.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adf8d3b7a90b4bd5187ce02c0c2974cb1a0c8f5a49a78e7c7dff24f28f7301b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): libs/langchain/langchain_classic/chains/conversational_retrieval/base.py:148-188 | libs/langchain/langchain_classic/chains/conversational_retrieval/base.py:205-245 \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":"libs/langchain/langchain_classic/chains/conversational_retrieval/base.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccefe8f04ff7893a78396c679006beb55438800d71d427f9a3cf59740c242882"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): libs/partners/openai/langchain_openai/chat_models/base.py:4532-4576 | libs/partners/openai/langchain_openai/chat_models/base.py:4582-4622 \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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":4532}}}],"partialFingerprints":{"codehealthFindingId/v1":"65145acdd9b7d2669babf5f52b01c8fb732fe66d84794daa631332ef4f9d9286"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): libs/langchain/langchain_classic/agents/mrkl/output_parser.py:32-95 | libs/langchain/langchain_classic/agents/output_parsers/react_single_input.py:54-95 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"libs/langchain/langchain_classic/agents/mrkl/output_parser.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"737f3826bca8d63b3becc8d14f1a4221c88c9ef092c8dfb4a041e7817041e802"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): libs/partners/anthropic/langchain_anthropic/chat_models.py:1298-1328 | libs/partners/openai/langchain_openai/chat_models/base.py:722-749 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"46896af830e28dd95d14be15465fdac49d080541bd77525170173d44c273002a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): libs/partners/openai/langchain_openai/llms/base.py:453-528 | libs/partners/openai/langchain_openai/llms/base.py:537-587 \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":"libs/partners/openai/langchain_openai/llms/base.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"230e9976632003fa3730042d1a0d400b146ba1489d5fa67c8b386d417ab48560"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (139 corresponding lines): libs/langchain_v1/langchain/agents/middleware/types.py:1879-2017 | libs/langchain_v1/langchain/agents/middleware/types.py:2052-2203 \u2014 These two members are one piece of code written twice and then edited apart: 139 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":"libs/langchain_v1/langchain/agents/middleware/types.py"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1eaa786c6c6919436db3513f0e604e79d8ee25e05e819ae67003d77f7e6d48c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): libs/langchain/langchain_classic/agents/agent.py:1575-1622 | libs/langchain/langchain_classic/agents/agent.py:1629-1695 \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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9c11aa535e6263bf3804c3c8296cbdf55f9824f36b5248944f6b35c0de163d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): libs/langchain/langchain_classic/retrievers/document_compressors/embeddings_filter.py:62-97 | libs/langchain/langchain_classic/retrievers/document_compressors/embeddings_filter.py:106-141 \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":"libs/langchain/langchain_classic/retrievers/document_compressors/embeddings_filter.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5529434c5330243a69ebe84c6144e0dce279d1fbe2bea5f448f2fcf67efe13d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): libs/partners/groq/langchain_groq/chat_models.py:1623-1676 | libs/partners/openrouter/langchain_openrouter/chat_models.py:1526-1581 \u2014 These two members are one piece of code written twice and then edited apart: 54 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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe938ef07dcf2052f1399213026a0e86b67d07759370818220ad66fb8bc7e662"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): libs/core/langchain_core/runnables/branch.py:188-241 | libs/core/langchain_core/runnables/branch.py:247-289 \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":"libs/core/langchain_core/runnables/branch.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6546551146512054d914e886443707b73f6f796c4411ab56c0f0899f21bf2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): libs/partners/anthropic/langchain_anthropic/chat_models.py:2215-2254 | libs/partners/anthropic/langchain_anthropic/chat_models.py:2265-2304 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"259ac6530218cd657e9084c3985e662b35bf9708eb30459bf6571956de0404e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/partners/chroma/langchain_chroma/vectorstores.py:115-152 | libs/partners/qdrant/langchain_qdrant/_utils.py:14-39 \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":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3b3517cf37d684219d22f96cf8edf858807227c06c7236d68cc62c0a4bbd11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): libs/partners/mistralai/langchain_mistralai/chat_models.py:1379-1410 | libs/partners/openai/langchain_openai/chat_models/base.py:4426-4460 \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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e73236f0c250d91aa882cf51bb732045380b4a978ae7e0cb655f40e7029c3fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): libs/partners/openai/langchain_openai/embeddings/azure.py:163-235 | libs/partners/openai/langchain_openai/llms/azure.py:128-212 \u2014 These two members are one piece of code written twice and then edited apart: 73 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":"libs/partners/openai/langchain_openai/embeddings/azure.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e2099eaa1ac962a3ab9929e10d3afc3308b4beed40e239d33451533d7ab5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): libs/core/langchain_core/prompts/few_shot_with_templates.py:125-169 | libs/core/langchain_core/prompts/few_shot_with_templates.py:172-213 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"libs/core/langchain_core/prompts/few_shot_with_templates.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"858e0e22b58d636d0dacc5a06b1bbc3a158a6d91fbac0dc02e30a57edb6d00ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): libs/core/langchain_core/runnables/base.py:4162-4215 | libs/core/langchain_core/runnables/base.py:4225-4270 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":4162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6237d8dbbbebad21e79c798f5e35dbf235ed82d21c7b3294a4d1e997f4cc64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): libs/langchain/langchain_classic/chains/question_answering/chain.py:118-183 | libs/langchain/langchain_classic/chains/summarize/chain.py:84-169 \u2014 These two members are one piece of code written twice and then edited apart: 66 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":"libs/langchain/langchain_classic/chains/question_answering/chain.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e77914b640dc84875e25a2ef4810f37743cbc39b9ad618e783540bc605bf9c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): libs/core/langchain_core/prompts/chat.py:590-618 | libs/core/langchain_core/prompts/chat.py:621-649 \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":"libs/core/langchain_core/prompts/chat.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"c523b614e79ab69bdd71776c64f3db5d9ec77fed3e3d2f84e2ef38697425758d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): libs/langchain_v1/langchain/agents/middleware/tool_selection.py:379-440 | libs/langchain_v1/langchain/agents/middleware/tool_selection.py:447-508 \u2014 These two members are one piece of code written twice and then edited apart: 62 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":"libs/langchain_v1/langchain/agents/middleware/tool_selection.py"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d53a6c57e821302880530817c806980f540e35483399ed769d219a207c6703"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (158 corresponding lines): libs/langchain/langchain_classic/smith/evaluation/runner_utils.py:1418-1575 | libs/langchain/langchain_classic/smith/evaluation/runner_utils.py:1592-1764 \u2014 These two members are one piece of code written twice and then edited apart: 158 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":"libs/langchain/langchain_classic/smith/evaluation/runner_utils.py"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea017add8498d965060b970bee3ccc8578c0a25dc7a610661c1bb8cee3963a06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): libs/core/langchain_core/messages/ai.py:244-304 | libs/core/langchain_core/messages/ai.py:447-506 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97b4178a72751bd84cc142349aa431e5177a0e96e19963cf8e5a658ea8c0f43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): libs/langchain/langchain_classic/smith/evaluation/runner_utils.py:773-831 | libs/langchain/langchain_classic/smith/evaluation/runner_utils.py:937-993 \u2014 These two members are one piece of code written twice and then edited apart: 57 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":"libs/langchain/langchain_classic/smith/evaluation/runner_utils.py"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64cebdda68cfe6cc7e98d2ce9115a390c50dd1cab6d6b9ff8a548f565836e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/partners/chroma/langchain_chroma/vectorstores.py:80-106 | libs/partners/qdrant/langchain_qdrant/_utils.py:43-68 \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":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e35c54f886a5c0b0b647301af8018ee1ba53564c08abbb131e921492ba7c24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): libs/core/langchain_core/vectorstores/base.py:55-98 | libs/core/langchain_core/vectorstores/base.py:194-233 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/vectorstores/base.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff62efceed155b97408bb9281a7c88401ef9283197e046678042ee72093b6f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/langchain/langchain_classic/chat_models/base.py:745-770 | libs/langchain_v1/langchain/chat_models/base.py:738-764 \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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ea0e9994265ce8c391adaf48d9e4154c23383e66569267133d09caddb50609"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): libs/partners/fireworks/langchain_fireworks/llms.py:137-181 | libs/partners/fireworks/langchain_fireworks/llms.py:190-239 \u2014 These two members are one piece of code written twice and then edited apart: 45 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":"libs/partners/fireworks/langchain_fireworks/llms.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e9993c319dd390bd750223121370cf5b2e28ebed1c34f77728b79ca6367ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/core/langchain_core/runnables/router.py:144-170 | libs/core/langchain_core/runnables/router.py:181-206 \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":"libs/core/langchain_core/runnables/router.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ed4c63dd19719375337ffba6a364f8ba7a43e95632b99d9cc7b2de6e2524b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py:55-96 | libs/langchain/langchain_classic/evaluation/scoring/eval_chain.py:56-97 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84d5f325bea4508f3aab49c8252f8dfdcecc2627359f8eb5b46315400f3883f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:737-768 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:778-807 \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":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"58827d3ec2a76a1f52dc7f043f849640357df8f311dc552020255db069aef2fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): libs/core/langchain_core/runnables/configurable.py:163-195 | libs/core/langchain_core/runnables/configurable.py:206-234 \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":"libs/core/langchain_core/runnables/configurable.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3f311ae6a740fdbb7319da769e680507e3370f417fc7da9d8494974664f446"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): libs/partners/qdrant/langchain_qdrant/vectorstores.py:996-1070 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:1085-1148 \u2014 These two members are one piece of code written twice and then edited apart: 64 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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afe0b0f2160dc3bb609f58d755f7007a87486200a1134fa94648138445790c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): libs/core/langchain_core/runnables/base.py:4279-4316 | libs/core/langchain_core/runnables/base.py:4345-4386 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":4279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9ba4511e25eb2325957450c8c2503603db75b83721f729cf5d386820372ed6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): libs/langchain/langchain_classic/chains/combine_documents/reduce.py:316-346 | libs/langchain/langchain_classic/chains/combine_documents/reduce.py:355-385 \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":"libs/langchain/langchain_classic/chains/combine_documents/reduce.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"3767fa366cc2a4028bde23178131eeccd1a29a3c34a2f88475db5ef595b457ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): libs/core/langchain_core/callbacks/manager.py:69-138 | libs/core/langchain_core/callbacks/manager.py:154-226 \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":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f1af6b72c5b66177be48e84927c94818709b1eb8fdef0677f8301a972e27e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): libs/core/langchain_core/runnables/base.py:3453-3482 | libs/core/langchain_core/runnables/base.py:3492-3522 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3453}}}],"partialFingerprints":{"codehealthFindingId/v1":"254fecbfa4cefe66f2719d10106e57a8a94c085cf308b8018dbb5558b2bea7fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): libs/partners/ollama/langchain_ollama/llms.py:391-423 | libs/partners/ollama/langchain_ollama/llms.py:433-465 \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":"libs/partners/ollama/langchain_ollama/llms.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5668e95f45cea44df099812e95e4689996da561e21d23e443a7d2000c70393"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): libs/langchain/langchain_classic/agents/agent.py:1387-1417 | libs/langchain/langchain_classic/agents/agent.py:1534-1568 \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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"2863b7d7435f714a8abf32e501f90c14f2f15485fbfa0eb52562518d02719d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): libs/core/langchain_core/runnables/utils.py:737-765 | libs/core/langchain_core/tracers/log_stream.py:388-424 \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":"libs/core/langchain_core/runnables/utils.py"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"178ddd2a299fef1dc2e8e9601f9d38dde2f6271025697640f764b19d3744bb32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): libs/langchain/langchain_classic/agents/chat/output_parser.py:28-67 | libs/langchain/langchain_classic/agents/output_parsers/react_json_single_input.py:55-82 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/chat/output_parser.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3114fc948d71cdf546c380455d4f69d3c08c9660013a3ab4555e1933baf6fbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): libs/langchain/langchain_classic/chains/llm.py:125-145 | libs/langchain/langchain_classic/chains/llm.py:152-172 \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":"libs/langchain/langchain_classic/chains/llm.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"81af2e64280dd9732bf15abc195e9c4f92a68907e533f24ccabb374b45de0689"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): libs/langchain/langchain_classic/chat_models/base.py:552-620 | libs/langchain_v1/langchain/chat_models/base.py:548-620 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b907da43c0e9ec411d780b2303b0f0796b6480ec312ef423e598f629c5aa9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): libs/langchain/langchain_classic/smith/evaluation/runner_utils.py:877-922 | libs/langchain/langchain_classic/smith/evaluation/runner_utils.py:1039-1086 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"libs/langchain/langchain_classic/smith/evaluation/runner_utils.py"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"85085c66a5bc6f6caab8f9ab5aad98481566a2a3b43c21829d04826fe2261087"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): libs/partners/qdrant/langchain_qdrant/vectorstores.py:552-627 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:641-722 \u2014 These two members are one piece of code written twice and then edited apart: 76 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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"262ed65c0a58949502f582d8979aa3d48f9efed9bf764c2e4d44f213327f5c24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): libs/core/langchain_core/vectorstores/in_memory.py:194-221 | libs/core/langchain_core/vectorstores/in_memory.py:227-253 \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":"libs/core/langchain_core/vectorstores/in_memory.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4434b47bb4f2772e0a29030b52c9f4a811b320432f01acfaedb663334fb933d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py:248-281 | libs/langchain/langchain_classic/evaluation/scoring/eval_chain.py:249-294 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"54167b66753d47ed30c56e8145656fe9cd092c1aac85d085bcbae35905e77049"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): libs/core/langchain_core/runnables/base.py:5182-5213 | libs/core/langchain_core/runnables/base.py:5367-5412 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":5182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c174e107608e594f359d02dc7bc25b255751d0d6ecea9e68e50915fce82cee1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): libs/langchain/langchain_classic/retrievers/multi_vector.py:83-113 | libs/langchain/langchain_classic/retrievers/multi_vector.py:122-155 \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":"libs/langchain/langchain_classic/retrievers/multi_vector.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0752af8ec0b4fcda9f0262bfc37c03d31e23bcbd404646fd4d88aa744ac984"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): libs/partners/openai/langchain_openai/middleware/openai_moderation.py:275-307 | libs/partners/openai/langchain_openai/middleware/openai_moderation.py:312-344 \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":"libs/partners/openai/langchain_openai/middleware/openai_moderation.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"892be0a5315ad0df35961835bdf941d7c8f04f931eaa6bce82315e18d1f88b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/langchain/langchain_classic/chains/llm_math/base.py:227-243 | libs/langchain/langchain_classic/chains/llm_math/base.py:250-266 \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":"libs/langchain/langchain_classic/chains/llm_math/base.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4f46448fc02ba774da16be1875cc13511a82ab7ce3e979fe4faf9d60d6a479"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): libs/core/langchain_core/tracers/event_stream.py:182-232 | libs/core/langchain_core/tracers/event_stream.py:235-282 \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":"libs/core/langchain_core/tracers/event_stream.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"333ce8a281ae38d6d91aac063b75eac6f93c3b3c3f700d167f691d29afd15290"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): libs/core/langchain_core/runnables/base.py:4112-4147 | libs/core/langchain_core/runnables/base.py:5120-5146 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":4112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9ba309814ff42ea5a6c26e05c6429e4d7d56d77f2d27fb4b5b989c33571a7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/langchain/langchain_classic/chains/llm.py:179-197 | libs/langchain/langchain_classic/chains/llm.py:204-222 \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":"libs/langchain/langchain_classic/chains/llm.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e236b4794cda9077b7b7ff3ad389dd1c6a37569a91f53929d9f090ead242285"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/partners/openai/langchain_openai/decisions/_input.py:99-111 | libs/partners/typesafe/langchain_typesafe/_state.py:16-28 \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":"libs/partners/openai/langchain_openai/decisions/_input.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b42c93a768a7f6a2988ba22b4a4005fe3e94eb648cf8b4cd4590b2157072e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): libs/core/langchain_core/runnables/passthrough.py:550-588 | libs/core/langchain_core/runnables/passthrough.py:609-642 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"libs/core/langchain_core/runnables/passthrough.py"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0a58db69693398a6a3a51d645d97f6fd040d383a4f7537ab3315eec309bb04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/langchain/langchain_classic/chains/router/base.py:98-116 | libs/langchain/langchain_classic/chains/router/base.py:123-147 \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":"libs/langchain/langchain_classic/chains/router/base.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c36ab35b98a582c7cacde48b10fff5a263d070158e92a17a15a0e2f11657f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): libs/partners/qdrant/langchain_qdrant/qdrant.py:1045-1071 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:2204-2236 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:2245-2277 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 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":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"c233d241f066acef7bcddc8728a9f48d89cc6672654231cdf6ca779d3f028cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 41\u002B corresponding lines): libs/partners/fireworks/langchain_fireworks/chat_models.py:1664-1704 | libs/partners/groq/langchain_groq/chat_models.py:929-969 | libs/partners/openrouter/langchain_openrouter/chat_models.py:907-950 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 41 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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"16739d6b6d46a3465b401f1a4c233152dc1546288acb0257fb6280bc86a11da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): libs/langchain_v1/langchain/agents/middleware/file_search.py:45-75 | libs/partners/anthropic/langchain_anthropic/middleware/file_search.py:24-56 \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":"libs/langchain_v1/langchain/agents/middleware/file_search.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f82bdd3b44e183d6c976d4442070131ecc3d941bda4386754392a58ee7c131"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): libs/partners/openai/langchain_openai/embeddings/base.py:727-758 | libs/partners/openai/langchain_openai/embeddings/base.py:763-793 \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":"libs/partners/openai/langchain_openai/embeddings/base.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7b9fe878291b5f736430316c0ebcb67c28ec678a6b80080d498b42f24bc59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): libs/langchain_v1/langchain/agents/middleware/tool_emulator.py:141-190 | libs/langchain_v1/langchain/agents/middleware/tool_emulator.py:197-248 \u2014 These two members are one piece of code written twice and then edited apart: 50 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":"libs/langchain_v1/langchain/agents/middleware/tool_emulator.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"451ec5985e7ed220f1bc8514812249fc45a902652d4b9d42797f5e0d2ea67588"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/partners/fireworks/langchain_fireworks/chat_models.py:1498-1528 | libs/partners/groq/langchain_groq/chat_models.py:850-875 \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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"402032fa5bae7b780d73fe216e507081d7a916e45c4e0b1500838b59e1437c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/partners/mistralai/langchain_mistralai/chat_models.py:904-925 | libs/partners/mistralai/langchain_mistralai/chat_models.py:934-955 \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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"920c18317f57ed0792be72e543cbd6959683d2623f87fcd61425c882c85e7f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): libs/partners/anthropic/langchain_anthropic/llms.py:333-370 | libs/partners/anthropic/langchain_anthropic/llms.py:379-416 \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":"libs/partners/anthropic/langchain_anthropic/llms.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d842d399d91dd91a563b771184e90f23a3f7d143b359eec35da70976470924"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): libs/langchain/langchain_classic/retrievers/document_compressors/chain_filter.py:55-79 | libs/langchain/langchain_classic/retrievers/document_compressors/chain_filter.py:87-110 \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":"libs/langchain/langchain_classic/retrievers/document_compressors/chain_filter.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddef566e9351e13220650c432fc6b15881c1dbd6c775cb9cc669e3fe3e177c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/core/langchain_core/output_parsers/transform.py:127-148 | libs/core/langchain_core/output_parsers/transform.py:154-175 \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":"libs/core/langchain_core/output_parsers/transform.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0273cb4a5cd2e5dcaced2e891c2ba2b5459f17343458aa44b5bf2ad49d455c14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): libs/langchain/langchain_classic/embeddings/cache.py:166-199 | libs/langchain/langchain_classic/embeddings/cache.py:202-239 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"libs/langchain/langchain_classic/embeddings/cache.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1639bd8b310b0a1b45905fd3f492082531ce5f61fde87dde80e9dcec68677dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 29\u002B corresponding lines): libs/core/langchain_core/retrievers.py:182-234 | libs/core/langchain_core/retrievers.py:243-295 | libs/langchain/langchain_classic/retrievers/ensemble.py:111-139 | libs/langchain/langchain_classic/retrievers/ensemble.py:148-180 \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":"libs/core/langchain_core/retrievers.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c87a656a9681793a1ccf26469aa97b82b2cc0353e4e896479b8dde4bd333b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): libs/langchain/langchain_classic/chains/loading.py:119-145 | libs/langchain/langchain_classic/chains/loading.py:152-182 \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":"libs/langchain/langchain_classic/chains/loading.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"580ea7ee670901f0207bbd770c9a3861c00198a1cbe45f0609870bf0efe7b92d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): libs/langchain/langchain_classic/smith/evaluation/runner_utils.py:843-867 | libs/langchain/langchain_classic/smith/evaluation/runner_utils.py:1005-1029 \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":"libs/langchain/langchain_classic/smith/evaluation/runner_utils.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8a6f3aa61f074ffac56a5710c2a7d96a3d8dba6a56ccd49af82830adc36db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): libs/partners/anthropic/langchain_anthropic/llms.py:246-287 | libs/partners/anthropic/langchain_anthropic/llms.py:300-324 \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":"libs/partners/anthropic/langchain_anthropic/llms.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9942160dcfea36943d55395197e77817eed1604293e18bec728beec181eabc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/langchain/langchain_classic/chains/sequential.py:168-184 | libs/langchain/langchain_classic/chains/sequential.py:191-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":"libs/langchain/langchain_classic/chains/sequential.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da27438b244021eb8804741aa3e9afbb6e43755fd71ed243002ad0a1cd3ecbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/langchain/langchain_classic/chains/combine_documents/map_reduce.py:231-256 | libs/langchain/langchain_classic/chains/combine_documents/map_reduce.py:265-290 \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":"libs/langchain/langchain_classic/chains/combine_documents/map_reduce.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f602a38967d169176adbdd5e7d8e2f3552057f14ad5558a024dfda64b9884d3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): libs/langchain/langchain_classic/embeddings/base.py:31-82 | libs/langchain_v1/langchain/embeddings/base.py:104-155 \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":"libs/langchain/langchain_classic/embeddings/base.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9595303b58b7c21c8a3a07ff1a1b0caa8e2bcd59dba751bb0781bd6f2ae2d56f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/core/langchain_core/language_models/fake_chat_models.py:102-121 | libs/core/langchain_core/language_models/fake_chat_models.py:131-149 \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":"libs/core/langchain_core/language_models/fake_chat_models.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadec9ee07b5217555c816bdae90438ce77c2a69aba6b609a4516e42718f4114"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): libs/core/langchain_core/messages/block_translators/langchain_v0.py:11-43 | libs/core/langchain_core/messages/block_translators/openai.py:186-228 \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":"libs/core/langchain_core/messages/block_translators/langchain_v0.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d248cab2c5270269953660526225d6a32b3fa84bba1afa619414bd018ee3f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): libs/core/langchain_core/runnables/base.py:2334-2370 | libs/core/langchain_core/runnables/base.py:2385-2413 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6361d28abde73acc76ee59807261da27a5c88c1d9135c598fe74d2d368d420c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 32\u002B corresponding lines): libs/core/langchain_core/prompts/base.py:388-429 | libs/langchain/langchain_classic/agents/agent.py:183-214 | libs/langchain/langchain_classic/agents/agent.py:319-354 | libs/langchain/langchain_classic/chains/base.py:760-797 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 32 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":"libs/core/langchain_core/prompts/base.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"516b00e03c60bb50083a441b120feb28255ae9a56cc1fe7873a66f2831bd4bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:438-483 | libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:488-530 \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":"libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf43edc895acd1b66f34d363a74af72d34f159300c2df7380f2b3d642f53ee2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/core/langchain_core/language_models/chat_model_stream.py:248-269 | libs/core/langchain_core/language_models/chat_model_stream.py:1304-1325 \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":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6be8a3927fd2de07a12b0c018e8a71768caf713e8fe0c1e1bb3d46a85b975a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): libs/core/langchain_core/utils/utils.py:375-421 | libs/core/langchain_core/utils/utils.py:449-492 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"libs/core/langchain_core/utils/utils.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e80ef74aa455d056c112f22781ce5b8eccc318d548e1022f0feafd3d5c59422"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/core/langchain_core/language_models/llms.py:825-850 | libs/core/langchain_core/language_models/llms.py:1099-1131 \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":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"4869008c3a497fb4d56cacfef7dcfd3ddbbc9041f2a55987089d80b691b2f64d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): .github/scripts/get_min_versions.py:61-95 | .github/scripts/get_min_versions.py:169-199 \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":".github/scripts/get_min_versions.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"786979cb06892b2898d1235f3db257e50b96916349359df3ffe3598d573d7b62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): libs/langchain_v1/langchain/agents/middleware/summarization.py:914-946 | libs/langchain_v1/langchain/agents/middleware/summarization.py:949-980 \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":"libs/langchain_v1/langchain/agents/middleware/summarization.py"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"312a7638681afbcd03e1232ed0f3383a1c41158a90039fabfcde2378df0ff227"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/partners/fireworks/langchain_fireworks/chat_models.py:1344-1372 | libs/partners/openai/langchain_openai/chat_models/base.py:1598-1620 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"02beac74ce3c4dcdd7e8a0651fc4dec4f02b348f3f0f35d94b0c4e2e9ccbaac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/partners/fireworks/langchain_fireworks/chat_models.py:1464-1486 | libs/partners/fireworks/langchain_fireworks/chat_models.py:1611-1634 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fb93c2e82cd4f916627afe1122be9c5355f8824ac6f817e0425effd3f93ada"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py:425-453 | libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py:462-489 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf41cbefd21914ecb1ef7d48cd158acb32cdeda46e7dc019247757ac44437063"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): libs/langchain/langchain_classic/indexes/_sql_record_manager.py:189-218 | libs/langchain/langchain_classic/indexes/_sql_record_manager.py:221-251 \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":"libs/langchain/langchain_classic/indexes/_sql_record_manager.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"355e0041d7e4feb261ee1ff15c742660b2afe5030358f17d433cb064a1597194"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): libs/langchain_v1/langchain/agents/middleware/tool_error.py:138-173 | libs/langchain_v1/langchain/agents/middleware/tool_error.py:180-209 \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":"libs/langchain_v1/langchain/agents/middleware/tool_error.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cae6b1eb9292d62f8a38ebf3d48059bbe0bce1c7bc30251ded841ee8392b176"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/partners/openai/langchain_openai/llms/base.py:397-415 | libs/partners/openai/langchain_openai/llms/base.py:424-444 \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":"libs/partners/openai/langchain_openai/llms/base.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d26ab0911d1d2b9e1531ab79e27a68063ccbaae7e8a684fa21c4ca09dc71d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/core/langchain_core/runnables/base.py:6095-6116 | libs/core/langchain_core/runnables/base.py:6147-6169 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":6095}}}],"partialFingerprints":{"codehealthFindingId/v1":"0088b96db6cbafc966eb03fb68148ef966d67a8411335fa43d606f60cd072ec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): libs/core/langchain_core/vectorstores/base.py:513-555 | libs/core/langchain_core/vectorstores/base.py:563-605 \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":"libs/core/langchain_core/vectorstores/base.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff096f9bef35f7440e122e7b836be1a982e23a049ead945cd2421ba22ee7e42c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (294 corresponding lines): libs/langchain/langchain_classic/chat_models/base.py:89-386 | libs/langchain_v1/langchain/chat_models/base.py:240-533 \u2014 These two members are one piece of code written twice and then edited apart: 294 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"686c7f9667317ce0fbb374e9aef80c069adef118932c91718efc0fec457976c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): libs/langchain/langchain_classic/chains/retrieval_qa/base.py:134-162 | libs/langchain/langchain_classic/chains/retrieval_qa/base.py:178-206 \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":"libs/langchain/langchain_classic/chains/retrieval_qa/base.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0a072564486bd583874d63cf07af7f6a59e5f6e18cb5c2cae450d561a83890"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): libs/langchain/langchain_classic/retrievers/merger_retriever.py:58-84 | libs/langchain/langchain_classic/retrievers/merger_retriever.py:91-119 \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":"libs/langchain/langchain_classic/retrievers/merger_retriever.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d823d620dad17c48fa614a54129b3db2e2251d1e1d3802d22aba963dcf8d95ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/core/langchain_core/prompts/few_shot.py:180-205 | libs/core/langchain_core/prompts/few_shot.py:208-233 \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":"libs/core/langchain_core/prompts/few_shot.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fec1af45be31458ecd5b57dd1136fdfddc17a1e1fdffa1fa8d551f0554f214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): libs/langchain/langchain_classic/chains/qa_with_sources/base.py:158-179 | libs/langchain/langchain_classic/chains/qa_with_sources/base.py:195-215 \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":"libs/langchain/langchain_classic/chains/qa_with_sources/base.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d689c6f6c450bad97cc099fb981880a59186250cce21d47f0453f61c41fedb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py:442-474 | libs/langchain/langchain_classic/evaluation/scoring/eval_chain.py:442-484 \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":"libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd528f7586a1d303792f34d0a02c392977d7ee5f33e06acd80426a854410e273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/core/langchain_core/messages/block_translators/openai.py:271-288 | libs/partners/openai/langchain_openai/chat_models/_compat.py:170-193 \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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"946b766a9da1d0a0ba3772f18725434af91091c448f66b6d84dde85a4a2a7620"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/partners/ollama/langchain_ollama/llms.py:512-534 | libs/partners/ollama/langchain_ollama/llms.py:543-565 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/ollama/langchain_ollama/llms.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"767ed0af328809d0b79bccabb18da75d165f4c5738c3523abaa6b25cb30a2b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): libs/partners/qdrant/langchain_qdrant/qdrant.py:460-493 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:2294-2332 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf368901153ef3ae0e1d90f829a1b1e0ec3bb45c580bfbe7d5eb982eb0252454"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): libs/langchain/langchain_classic/chat_models/base.py:624-650 | libs/langchain_v1/langchain/chat_models/base.py:624-651 \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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e28ba88725329455fad538f2b6cffe8f2d62d0505d09a925527005e25449e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): libs/partners/mistralai/langchain_mistralai/embeddings.py:252-286 | libs/partners/mistralai/langchain_mistralai/embeddings.py:289-321 \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":"libs/partners/mistralai/langchain_mistralai/embeddings.py"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1713f821dc43332d16140be8b21e6e727e4ade94446864556a0cd101de13ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/core/langchain_core/language_models/chat_model_stream.py:879-918 | libs/core/langchain_core/language_models/chat_model_stream.py:921-939 \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":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fa8634275ae396e332cbba91cbcf3d22143035f265e59fd7d059db5e697f19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/core/langchain_core/language_models/chat_models.py:695-735 | libs/core/langchain_core/language_models/chat_models.py:746-767 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ce6b1f60d3389141fe2105ab3a56c9003fd78bef5bf51782d7ff5c32506e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/langchain/langchain_classic/indexes/_sql_record_manager.py:459-476 | libs/langchain/langchain_classic/indexes/_sql_record_manager.py:486-504 \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":"libs/langchain/langchain_classic/indexes/_sql_record_manager.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb0a224c19a262ceda42544d7488f61bd88b00990c46cf6425f824e898abf43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): libs/langchain/langchain_classic/retrievers/ensemble.py:225-258 | libs/langchain/langchain_classic/retrievers/ensemble.py:267-302 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"libs/langchain/langchain_classic/retrievers/ensemble.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"304c82512a46e18a3ca6f052201fcebc77547184eaa098ec3f5b75b5f2991d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 37\u002B corresponding lines): libs/core/langchain_core/callbacks/manager.py:1479-1515 | libs/core/langchain_core/callbacks/manager.py:1527-1575 | libs/core/langchain_core/callbacks/manager.py:1586-1623 | libs/core/langchain_core/callbacks/manager.py:2067-2104 | libs/core/langchain_core/callbacks/manager.py:2159-2196 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 37 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":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"db025898e8204e76e3be46369e4af5df7cf4dcb8e2f245eb609a166d8f7f74b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/core/langchain_core/vectorstores/base.py:1044-1059 | libs/core/langchain_core/vectorstores/base.py:1069-1086 \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":"libs/core/langchain_core/vectorstores/base.py"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5144bce67dd56c60f324b535bf5ae289378d0f7868a7f16b9c65ce53cf2d984"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): libs/langchain/langchain_classic/output_parsers/fix.py:71-105 | libs/langchain/langchain_classic/output_parsers/fix.py:109-143 | libs/langchain/langchain_classic/output_parsers/retry.py:235-260 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 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":"libs/langchain/langchain_classic/output_parsers/fix.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf76521144f3f526dcce0159bcc5b77adba59640ecbef7ecd51434d6577434d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/langchain/langchain_classic/retrievers/document_compressors/base.py:29-51 | libs/langchain/langchain_classic/retrievers/document_compressors/base.py:59-81 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/retrievers/document_compressors/base.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc182c0bbac15f62513fb2975cb20f6712389dd2438c63e1518929d4440d448d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): libs/core/langchain_core/callbacks/manager.py:1374-1416 | libs/core/langchain_core/callbacks/manager.py:1425-1470 | libs/core/langchain_core/callbacks/manager.py:2020-2056 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 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":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fecb1f23980e7b81da3952d2861fd2afd73023615c7356188334fefb487633"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): libs/langchain/langchain_classic/chains/combine_documents/reduce.py:72-96 | libs/langchain/langchain_classic/chains/combine_documents/reduce.py:104-128 \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":"libs/langchain/langchain_classic/chains/combine_documents/reduce.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99375ecf59898f1816c6aee023cc56df61f839036e6bff9d73b23fcc5393cd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py:365-386 | libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py:395-416 \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":"libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b5a4e4a0a0b457b82859f0ab402398bc17a8b13ad53eba0daead5058507aac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): libs/core/langchain_core/language_models/llms.py:164-192 | libs/core/langchain_core/language_models/llms.py:200-227 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f347f25c708fe3bb90973e21e15ecb0769bf26a4439d5ed35b66f4a363ab8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): libs/langchain/langchain_classic/agents/chat/base.py:92-120 | libs/langchain/langchain_classic/agents/conversational/base.py:85-113 \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":"libs/langchain/langchain_classic/agents/chat/base.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d06d276db96520586f9fc655d078fcc8e6e97fbcd453fb6d08effd7fbdbc900"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/langchain/langchain_classic/embeddings/base.py:90-116 | libs/langchain_v1/langchain/embeddings/base.py:163-188 \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":"libs/langchain/langchain_classic/embeddings/base.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca81da73d41f3687e8b91bbea967933b2c5aadbcf65569efddfa705068189bfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): libs/partners/qdrant/langchain_qdrant/qdrant.py:656-697 | libs/partners/qdrant/langchain_qdrant/qdrant.py:817-854 \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":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51b4e72125623b8d252db8a6efef260509d93da1728381874a4da6fa6697798"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): libs/partners/qdrant/langchain_qdrant/vectorstores.py:2140-2166 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:2169-2195 \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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":2140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6bfbb32acdecc653527bd16328883fdd8c8ccbe71ef4e42545237ac40044f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/langchain/langchain_classic/agents/agent_iterator.py:322-344 | libs/langchain/langchain_classic/agents/agent_iterator.py:351-373 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/agent_iterator.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ca9ee0fedf4021d81a75ff700439d744a5e4c789283917291614a44be8b9cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/core/langchain_core/indexing/api.py:251-277 | libs/core/langchain_core/indexing/api.py:617-632 \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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60b0472a44e7bc784b55f696f1eaf368deb88693a9dad80dc7446b13674adc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/partners/openai/langchain_openai/middleware/openai_moderation.py:181-203 | libs/partners/openai/langchain_openai/middleware/openai_moderation.py:208-230 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/middleware/openai_moderation.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"be352c17fb994490d90f7945893df5cfcd849b65adfbc20bafc9209092e0009a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/core/langchain_core/_security/_transport.py:206-223 | libs/core/langchain_core/_security/_transport.py:230-254 \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":"libs/core/langchain_core/_security/_transport.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"32511028e6bce334c332172f14f8db7a4eb9ffee6d4f28e8d9107693c56dee78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/core/langchain_core/tracers/base.py:46-59 | libs/core/langchain_core/tracers/base.py:572-589 \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":"libs/core/langchain_core/tracers/base.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4da26518d0dba271dbea5cba229ef48b78792c364a2af3e5730ade56b982b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): libs/core/langchain_core/utils/aiter.py:111-158 | libs/core/langchain_core/utils/iter.py:43-88 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"libs/core/langchain_core/utils/aiter.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"299de910f4c2d9969cf5fcb685a9585acc39b1ac342e5c779a59d605940f4f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): libs/langchain/langchain_classic/chains/combine_documents/refine.py:151-171 | libs/langchain/langchain_classic/chains/combine_documents/refine.py:179-199 \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":"libs/langchain/langchain_classic/chains/combine_documents/refine.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f89f2b1e8179f1c5e892be1a8216bfbb2b7d46db16fb3e8eb30ee840449444"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 23\u002B corresponding lines): libs/core/langchain_core/utils/utils.py:220-258 | libs/core/langchain_core/utils/utils.py:267-310 | libs/partners/groq/langchain_groq/chat_models.py:510-535 | libs/partners/openrouter/langchain_openrouter/chat_models.py:381-406 | libs/partners/perplexity/langchain_perplexity/chat_models.py:877-899 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 23 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":"libs/core/langchain_core/utils/utils.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1292f490dd3d77b5b5120283a7d40854b28c97633656287cd9176fe68a96dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/partners/typesafe/langchain_typesafe/classifier.py:305-320 | libs/partners/typesafe/langchain_typesafe/classifier.py:326-341 \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":"libs/partners/typesafe/langchain_typesafe/classifier.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"942b0a1acdb1cc0fbc0671f28419fcb7abb5d03a96579812f6119ff4e736ec81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/core/langchain_core/messages/function.py:45-62 | libs/core/langchain_core/messages/tool.py:184-203 \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":"libs/core/langchain_core/messages/function.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb97a634e525f0031cb851ab79b193951e9d24864834ad7261ce592b3102f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/core/langchain_core/runnables/base.py:3790-3804 | libs/core/langchain_core/runnables/base.py:3813-3829 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3790}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26a63c6fe2c963e6cd93e102510711f9173865a762005c82a42cf91aabaedb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/langchain/langchain_classic/agents/xml/base.py:71-87 | libs/langchain/langchain_classic/agents/xml/base.py:96-112 \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":"libs/langchain/langchain_classic/agents/xml/base.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ff05113a8a714edd7dfedbba451a5d141812b49c6e8093dc6a2974b8405c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/langchain/langchain_classic/chains/llm.py:229-247 | libs/langchain/langchain_classic/chains/llm.py:254-272 \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":"libs/langchain/langchain_classic/chains/llm.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba84300697c06c8df3229d9be7d33cd2340c41f3e5f304c60e8dcb6d3dd4db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.py:986-1012 | libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.py:1019-1045 \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":"libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.py"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6b7bdff087f743efc8321b15b18baabf0ba1525b90cfb5b3c58641df3122ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/partners/anthropic/langchain_anthropic/chat_models.py:2617-2629 | libs/partners/anthropic/langchain_anthropic/chat_models.py:2638-2650 \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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":2617}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2285117d9c045bd97a8e0a97b2af2f723e1135e0dda33ba2f6295d809882de8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 24\u002B corresponding lines): libs/langchain/langchain_classic/agents/openai_functions_agent/base.py:102-134 | libs/langchain/langchain_classic/agents/openai_functions_agent/base.py:142-167 | libs/langchain/langchain_classic/agents/openai_functions_multi_agent/base.py:209-232 | libs/langchain/langchain_classic/agents/openai_functions_multi_agent/base.py:240-263 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/openai_functions_agent/base.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb032569bdcb2908e9bd04801b9a9f2e1c58292d01e285ba991a0ea0c6bfae22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libs/partners/openai/langchain_openai/decisions/_input.py:132-140 | libs/partners/openai/langchain_openai/middleware/model_router.py:260-267 \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":"libs/partners/openai/langchain_openai/decisions/_input.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc73bbfcc394419aa8b38fc67a78b5641e227c44f6fdf495d1734955fbd676cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (142 corresponding lines): libs/partners/qdrant/langchain_qdrant/vectorstores.py:1229-1370 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:1466-1611 \u2014 These two members are one piece of code written twice and then edited apart: 142 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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d1792d7dfa95a633e3d227a88eb21ce7704d622703326c381f3e6a3ae4b634"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/core/langchain_core/prompts/chat.py:1176-1201 | libs/core/langchain_core/prompts/chat.py:1204-1229 \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":"libs/core/langchain_core/prompts/chat.py"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7652e3688d8685631e490bc04176858e7bf4b5a5860a80357103d211a83b306a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): libs/core/langchain_core/tracers/core.py:259-275 | libs/core/langchain_core/tracers/core.py:410-426 | libs/core/langchain_core/tracers/langchain.py:275-307 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 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":"libs/core/langchain_core/tracers/core.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f7d378ee5479af6f801b2c7d2276e8c7276c765cbcedd70d8c68b18d415730"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): libs/partners/chroma/langchain_chroma/vectorstores.py:825-857 | libs/partners/chroma/langchain_chroma/vectorstores.py:867-902 \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":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"1582c535a68714721fc80e15858a36f0ff0bd28814c78044db2a5b2858150c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:704-727 | libs/partners/mistralai/langchain_mistralai/chat_models.py:863-885 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a3fc7755c8bf3bd2b3a603642e757eb2a382216a077fdb20d832e7bce40370"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 24\u002B corresponding lines): libs/langchain/langchain_classic/agents/chat/base.py:136-174 | libs/langchain/langchain_classic/agents/conversational/base.py:135-178 | libs/langchain/langchain_classic/agents/conversational_chat/base.py:146-181 | libs/langchain/langchain_classic/agents/mrkl/base.py:126-159 | libs/langchain/langchain_classic/agents/structured_chat/base.py:136-159 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/chat/base.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"62bc3f36701628bb006f029b10f8d3a9cd7565ec630b6b5e311afad235fa1ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/langchain/langchain_classic/chains/base.py:522-543 | libs/langchain/langchain_classic/chains/base.py:546-567 \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":"libs/langchain/langchain_classic/chains/base.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba9c6dc15d5894ece40fe0b97d2486d7bac8d9b861f30c8837f0b4a240e3389"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): libs/langchain_v1/langchain/agents/middleware/summarization.py:482-517 | libs/langchain_v1/langchain/agents/middleware/summarization.py:523-558 \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":"libs/langchain_v1/langchain/agents/middleware/summarization.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7b88967a52b1a044ac372e39e46e4a390c018887622b1e565838376a588208"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/partners/groq/langchain_groq/chat_models.py:672-686 | libs/partners/groq/langchain_groq/chat_models.py:695-710 \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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc3276ba0228d3332a15318d4ab74d8e41ec51ca4d92b6299d57ddd70488401"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/partners/openai/langchain_openai/decisions/_classifier_input.py:337-349 | libs/partners/openai/langchain_openai/decisions/_input.py:59-74 \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":"libs/partners/openai/langchain_openai/decisions/_classifier_input.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaf33bcbc29ecb128232315f635cad9364427a0614f58261c4895de06744513"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/core/langchain_core/language_models/chat_models.py:1496-1514 | libs/core/langchain_core/language_models/chat_models.py:1523-1534 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3a1ebb4b6d99a87cc874ae47df987f1f225808642a6b001b07716ad75130c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/core/langchain_core/runnables/history.py:549-563 | libs/core/langchain_core/runnables/history.py:566-580 \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":"libs/core/langchain_core/runnables/history.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d935247122a143c1291fa435cfd5222c09dd2d1a01a43910b81153a8570194"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): libs/core/langchain_core/tools/render.py:14-38 | libs/core/langchain_core/tools/render.py:42-67 \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":"libs/core/langchain_core/tools/render.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebda5dd22f7f8f5215d91da5bae3ff29bd6510df3b5b14b336014d209215da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): libs/core/langchain_core/vectorstores/base.py:236-264 | libs/core/langchain_core/vectorstores/base.py:269-292 \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":"libs/core/langchain_core/vectorstores/base.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8703efa10f2a5a2c09541c68232ce170aa4a85d352f37b72f02054fddf44feb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): libs/langchain/langchain_classic/chains/query_constructor/base.py:284-323 | libs/langchain/langchain_classic/chains/query_constructor/base.py:339-381 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/chains/query_constructor/base.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e21ddde440113324a8073e9fc84c19b6f283b5162f18534a4dec7ae104e9f67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/core/langchain_core/utils/aiter.py:209-227 | libs/core/langchain_core/utils/iter.py:136-154 \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":"libs/core/langchain_core/utils/aiter.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16c17aefd4e1bad92b391e6f68844141118a433c7607421bc4c77753e805690"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/langchain/langchain_classic/chat_models/base.py:675-688 | libs/langchain_v1/langchain/chat_models/base.py:670-683 \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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad287fa31bc8b1caf6eb1dcfe084696081a61950a96e1458711fe654fbf7e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): libs/langchain/langchain_classic/evaluation/criteria/eval_chain.py:323-379 | libs/langchain/langchain_classic/evaluation/criteria/eval_chain.py:545-593 \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":"libs/langchain/langchain_classic/evaluation/criteria/eval_chain.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dc655ffe3b72b949dcdd4c01c5ae9e1b1ce7ada49cc4311da031c235d3c97c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/core/langchain_core/language_models/llms.py:1538-1547 | libs/core/langchain_core/language_models/llms.py:1556-1565 \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":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db4e2d10c3983dac690e5bf98821826388ee9fc69d3db1f79a99c4144309401"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/core/langchain_core/runnables/base.py:6029-6041 | libs/core/langchain_core/runnables/base.py:6052-6064 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":6029}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad2a6b398b50847774a5d1454d2ea5d9486edcf75864deb4a7444b3bca9e0b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/langchain/langchain_classic/chat_models/base.py:728-738 | libs/langchain_v1/langchain/chat_models/base.py:723-731 \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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d02ed2d5823612bf78f48d9d02a3ffbe0a7bf704be175e6c91bf6dfd44ee85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): libs/partners/groq/langchain_groq/chat_models.py:628-640 | libs/partners/mistralai/langchain_mistralai/chat_models.py:704-716 | libs/partners/ollama/langchain_ollama/chat_models.py:1192-1202 | libs/partners/openai/langchain_openai/chat_models/base.py:2359-2373 | libs/partners/openrouter/langchain_openrouter/chat_models.py:542-554 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d91c624902c757e25a0ae482232243aa136da0bc26ecd320a634517b595b757"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 91\u002B corresponding lines): libs/langchain/langchain_classic/agents/openai_tools/base.py:23-113 | libs/langchain/langchain_classic/agents/tool_calling_agent/base.py:25-117 | libs/langchain/langchain_classic/agents/xml/base.py:123-236 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 91 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":"libs/langchain/langchain_classic/agents/openai_tools/base.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0daefb9b026d03bb5467879875cab8bc0dd274cf699382f23e85266b36f6650c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/partners/openrouter/langchain_openrouter/chat_models.py:563-572 | libs/partners/openrouter/langchain_openrouter/chat_models.py:581-590 \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":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fb82a2ca702d1437c74486b231eabc88f6ee7b34ab2936a18641f9b13100aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/langchain/langchain_classic/retrievers/time_weighted_retriever.py:84-96 | libs/langchain/langchain_classic/retrievers/time_weighted_retriever.py:99-113 \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":"libs/langchain/langchain_classic/retrievers/time_weighted_retriever.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ac7edad3ea72cbd7efd2f377132af078aba0b18dc169b5f72f8042381a4ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): libs/core/langchain_core/callbacks/base.py:1040-1049 | libs/core/langchain_core/callbacks/manager.py:1748-1757 | libs/core/langchain_core/callbacks/manager.py:2275-2285 \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":"libs/core/langchain_core/callbacks/base.py"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"d089209461aa469c6786bf0d7913cf617e8ef2dcd7f6f253ce507fc57610ce41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): libs/partners/exa/langchain_exa/tools.py:123-161 | libs/partners/exa/langchain_exa/tools.py:204-242 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"libs/partners/exa/langchain_exa/tools.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"97999a2b22ef904504eac0c973798648d1f68af8a7dd8231b074bb906bed801e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): libs/partners/openai/langchain_openai/chat_models/_client_utils.py:55-83 | libs/partners/openai/langchain_openai/chat_models/_client_utils.py:87-114 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/_client_utils.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ff5ebb5e3b5b201367c92f52f8470dfae6dbcb8f19529ecaf389c7bfe7de64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/core/langchain_core/runnables/base.py:3381-3397 | libs/core/langchain_core/runnables/base.py:3430-3446 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3381}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfaf15d30f4be3db7c4b2a22e87da179febb513c8d7bf882e4642d6356ee750"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): libs/core/langchain_core/vectorstores/base.py:295-325 | libs/core/langchain_core/vectorstores/base.py:330-359 \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":"libs/core/langchain_core/vectorstores/base.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37c7405733e0375e0e1c72a59444ce98cc2bad5bf082f043cdfb2e0371e16f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/langchain/langchain_classic/chains/combine_documents/base.py:136-147 | libs/langchain/langchain_classic/chains/combine_documents/base.py:154-165 \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":"libs/langchain/langchain_classic/chains/combine_documents/base.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1d495c5ae62c878e920845aa4c51b51e1cab8cf60def9d13a5e94770a66d2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/core/langchain_core/language_models/chat_model_stream.py:89-103 | libs/standard-tests/langchain_tests/utils/stream_lifecycle.py:171-182 \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":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d5d84927d31babef14e6dfdfe6aaec3205a3dc3c4ea90f8e7fcf3e5b842d24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): libs/core/langchain_core/runnables/base.py:6226-6255 | libs/core/langchain_core/runnables/base.py:6308-6335 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":6226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7051f1124a9e0bff9f82fe8682cbc001864de680e615ddd5d50c21d0694fe468"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/langchain/langchain_classic/smith/evaluation/string_run_evaluator.py:372-382 | libs/langchain/langchain_classic/smith/evaluation/string_run_evaluator.py:391-403 \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":"libs/langchain/langchain_classic/smith/evaluation/string_run_evaluator.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cad3f55fea68182808c9df44b082d1397b483f77a5a44a7f26bfa031417689"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/partners/mistralai/langchain_mistralai/chat_models.py:159-191 | libs/partners/openai/langchain_openai/chat_models/base.py:310-331 \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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d9d33d1e84650fe99d7831e4c55c3734058c50b250d69e8f369a7a88cf26cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/partners/mistralai/langchain_mistralai/chat_models.py:284-295 | libs/partners/mistralai/langchain_mistralai/chat_models.py:299-310 \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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56c36441f8f9644b3d6bdacca8e814197569d0a7ff1b680765ed203088e7005"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/partners/perplexity/langchain_perplexity/chat_models.py:909-927 | libs/partners/perplexity/langchain_perplexity/embeddings.py:107-128 \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":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da8c49fff48c538a6f40f0b9cfdb5bd2b6948507790e7cd5b76f6cbe11e198c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/core/langchain_core/runnables/graph.py:712-726 | libs/core/langchain_core/runnables/graph.py:730-744 \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":"libs/core/langchain_core/runnables/graph.py"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb2212eb4e71f5f51605590eb0b02793b1f910fceaa8fe1aa57e02913ef9c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/core/langchain_core/vectorstores/base.py:794-815 | libs/core/langchain_core/vectorstores/base.py:824-845 \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":"libs/core/langchain_core/vectorstores/base.py"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ae95ac826afe235c684f5bba01bfd52f2c242e256fcde3cacf646b9fd8571e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/langchain/langchain_classic/memory/summary_buffer.py:52-67 | libs/langchain/langchain_classic/memory/summary_buffer.py:71-86 \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":"libs/langchain/langchain_classic/memory/summary_buffer.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d342a33932afa5e0e38165f405829ce62cb8733182e3e1efd87fa40f9cc9e41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): libs/langchain_v1/langchain/agents/middleware/model_fallback.py:395-430 | libs/langchain_v1/langchain/agents/middleware/model_fallback.py:437-472 \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":"libs/langchain_v1/langchain/agents/middleware/model_fallback.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ae1940614eea43c5a9e3d1ac2e4ef43cfef4e4b2ee01d1dd3bb7a21dc4108c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/core/langchain_core/runnables/retry.py:193-202 | libs/core/langchain_core/runnables/retry.py:217-226 \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":"libs/core/langchain_core/runnables/retry.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b720ac6305a9efa3775f80982e7b6874922704ff24130c1845a9cfb1af52fbb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): libs/core/langchain_core/messages/content.py:987-1021 | libs/core/langchain_core/messages/content.py:1355-1389 | libs/core/langchain_core/messages/content.py:1398-1430 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 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":"libs/core/langchain_core/messages/content.py"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4522ab3bde50e890fa485644bbe7c6aa3ed242fa0571445337d02e7097e1b9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): libs/partners/deepseek/langchain_deepseek/chat_models.py:542-575 | libs/partners/deepseek/langchain_deepseek/chat_models.py:590-680 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"libs/partners/deepseek/langchain_deepseek/chat_models.py"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f22da00bd0e2e31ad66897deabbc78fb103cb4669bf8abb57bad181d7f12429"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/partners/ollama/langchain_ollama/chat_models.py:1145-1161 | libs/partners/ollama/langchain_ollama/chat_models.py:1171-1187 \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":"libs/partners/ollama/langchain_ollama/chat_models.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90b051ec8fc71979b4a5d44c3450650887282b1c3169fa0930ecc603a5e2090"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/langchain/langchain_classic/agents/format_scratchpad/openai_functions.py:40-65 | libs/langchain/langchain_classic/agents/format_scratchpad/tools.py:22-48 \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":"libs/langchain/langchain_classic/agents/format_scratchpad/openai_functions.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1a345b672c3364d1ad19fa1cfa15477651b6844f896a42c2b5b64481d51eaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): libs/langchain/langchain_classic/agents/react/base.py:59-67 | libs/langchain/langchain_classic/agents/react/base.py:154-162 | libs/langchain/langchain_classic/agents/self_ask_with_search/base.py:55-63 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/react/base.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdec14061242f3b962b6f6c4006ac490e577f1cb07814142cfab63931f14daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): libs/langchain/langchain_classic/chains/openai_functions/base.py:158-239 | libs/langchain/langchain_classic/chains/structured_output/base.py:505-535 \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":"libs/langchain/langchain_classic/chains/openai_functions/base.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0204e382e6b8a97588d0b8d57bf8e0b87349f3af7c183df0a6458bb47930a25f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/core/langchain_core/runnables/base.py:4556-4564 | libs/core/langchain_core/runnables/base.py:4981-4990 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":4556}}}],"partialFingerprints":{"codehealthFindingId/v1":"134f61941f77dd318bd9ceb7c0a23991704e38015ed965b5b7a82aad17125240"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/langchain/langchain_classic/agents/__init__.py:100-118 | libs/langchain/langchain_classic/agents/agent_toolkits/__init__.py:119-131 \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":"libs/langchain/langchain_classic/agents/__init__.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fd0d28bd69889f458bc86f5c72ee217817404903c7b36a11734c273d441c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/langchain/langchain_classic/chains/sequential.py:96-102 | libs/langchain/langchain_classic/chains/sequential.py:109-119 \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":"libs/langchain/langchain_classic/chains/sequential.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef73459152cf8fac8f6878d54928cd6dbf94a127b7ae92cb25e904e2d448783"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): libs/langchain/langchain_classic/evaluation/embedding_distance/base.py:242-261 | libs/langchain/langchain_classic/evaluation/embedding_distance/base.py:265-283 | libs/langchain/langchain_classic/evaluation/embedding_distance/base.py:287-305 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/evaluation/embedding_distance/base.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ab29c2c6d46894076b9dff4481bc66744e643ee4f4bddc1c067f2d82bf1548"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/langchain_v1/langchain/agents/middleware/model_call_limit.py:43-60 | libs/langchain_v1/langchain/agents/middleware/tool_call_limit.py:78-102 \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":"libs/langchain_v1/langchain/agents/middleware/model_call_limit.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"826bcd99071b2d2fc3aff7e9d022de869e1afdc8595b9c134e5506ba3321528a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): libs/langchain_v1/langchain/agents/middleware/_redaction.py:72-95 | libs/langchain_v1/langchain/agents/middleware/_redaction.py:99-125 \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":"libs/langchain_v1/langchain/agents/middleware/_redaction.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06884b8d20f05a8b98e0cd23e05cc45f14bcdf6a7fb8234dc23bb0d916b6a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/core/langchain_core/tracers/base.py:732-744 | libs/core/langchain_core/tracers/base.py:794-805 \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":"libs/core/langchain_core/tracers/base.py"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfa9a52a0c7c62ab56504ad3adecc7cd345243899e6c182559e7522db18f0da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/core/langchain_core/tracers/log_stream.py:138-155 | libs/core/langchain_core/tracers/log_stream.py:186-203 \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":"libs/core/langchain_core/tracers/log_stream.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"71252f714a7efa048f40b25bb6821442e2a1e8bc75c64c0a737c6d5daf062887"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): libs/core/langchain_core/utils/utils.py:119-143 | libs/langchain_v1/langchain/chat_models/base.py:126-149 \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":"libs/core/langchain_core/utils/utils.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aadd702fe2c1489730b09f51bd54020c7ecaf0fbe178421dfd8dd9adb4e6297"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/langchain/langchain_classic/callbacks/streaming_aiter_final_only.py:87-102 | libs/langchain/langchain_classic/callbacks/streaming_stdout_final_only.py:82-100 \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":"libs/langchain/langchain_classic/callbacks/streaming_aiter_final_only.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03319e0b1bfdb95c09fa13f7c462d207995e35812de09b022ce47fc85be2292"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): libs/core/langchain_core/callbacks/manager.py:2594-2707 | libs/core/langchain_core/callbacks/manager.py:2713-2781 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79554b5f402224abed41585fee253ebcb5d4ed3f07bab14347552acf0494928"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/core/langchain_core/indexing/api.py:105-119 | libs/core/langchain_core/utils/aiter.py:328-357 \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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"831c25bfdf4a0aeccc8294c0f1aeccfac0ff90f8b1bc7a41ac12134ee48e4a91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/langchain/langchain_classic/evaluation/agents/trajectory_eval_chain.py:285-302 | libs/langchain/langchain_classic/evaluation/agents/trajectory_eval_chain.py:309-326 \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":"libs/langchain/langchain_classic/evaluation/agents/trajectory_eval_chain.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d651809b6e9d3be75ec024cc02f0fef8ac06ae4fdb2cd939bfaa2ebeb649b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 27\u002B corresponding lines): libs/langchain/langchain_classic/indexes/vectorstore.py:41-67 | libs/langchain/langchain_classic/indexes/vectorstore.py:76-102 | libs/langchain/langchain_classic/indexes/vectorstore.py:111-137 | libs/langchain/langchain_classic/indexes/vectorstore.py:146-172 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 27 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":"libs/langchain/langchain_classic/indexes/vectorstore.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ff85302864732d9a40ced031f19e80c2380e744753bb3610b173b62899d1d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): libs/langchain_v1/langchain/agents/middleware/context_editing.py:255-274 | libs/langchain_v1/langchain/agents/middleware/context_editing.py:281-300 \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":"libs/langchain_v1/langchain/agents/middleware/context_editing.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"727ca4efe4b5d61109a715b54f065db0935fb373344a25ba60da397caa4ade3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): libs/partners/chroma/langchain_chroma/vectorstores.py:952-984 | libs/partners/chroma/langchain_chroma/vectorstores.py:993-1024 \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":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a2c94fa8460e62217d7f2cc36c31cba19cfee7175e535c52dbb5c2941e3f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/core/langchain_core/callbacks/manager.py:590-605 | libs/core/langchain_core/callbacks/manager.py:674-689 \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":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"927f4a66b1ae26f157cec2c6a7db1332fe6df900b144d20575cb70449ab7fb4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): libs/langchain/langchain_classic/agents/openai_assistant/base.py:546-567 | libs/langchain/langchain_classic/agents/openai_assistant/base.py:570-590 | libs/langchain/langchain_classic/agents/openai_assistant/base.py:703-724 | libs/langchain/langchain_classic/agents/openai_assistant/base.py:727-747 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 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":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e66c32f4123d8e259ffe42a384219992b20150541f2e84bb8b7ca39782c3a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/langchain/langchain_classic/retrievers/multi_query.py:121-137 | libs/langchain/langchain_classic/retrievers/multi_query.py:190-206 \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":"libs/langchain/langchain_classic/retrievers/multi_query.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2137242ba328d39d15a9ddb936bc103e0de36c526372054c9cea45c5edf3b9d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libs/langchain/langchain_classic/retrievers/self_query/base.py:316-323 | libs/langchain/langchain_classic/retrievers/self_query/base.py:332-339 \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":"libs/langchain/langchain_classic/retrievers/self_query/base.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fee14b348bfd999bf65d06ee4db5aff23bfef76c288e617547dc1122b0cb29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/partners/anthropic/langchain_anthropic/chat_models.py:1776-1787 | libs/partners/anthropic/langchain_anthropic/chat_models.py:1791-1802 \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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"93779f51b9fe21c34c10de6a5925683c1b059c6414d549a3b1ea3c28abde83c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/partners/fireworks/langchain_fireworks/rerank.py:136-161 | libs/partners/fireworks/langchain_fireworks/rerank.py:173-200 \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":"libs/partners/fireworks/langchain_fireworks/rerank.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe71b1b17f8d9ca70bd026b2851d0e5bf1042512131610a88cc5ca043d4aa75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/partners/openai/langchain_openai/chat_models/_client_utils.py:434-456 | libs/partners/openai/langchain_openai/chat_models/_client_utils.py:464-478 \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":"libs/partners/openai/langchain_openai/chat_models/_client_utils.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78799330457e7fe27a37c949b8acd8d2f182da6efcd7ce1b0aaca60fccd0441"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/partners/qdrant/langchain_qdrant/vectorstores.py:2098-2116 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:2119-2137 \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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":2098}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8e175c254ab5c110a708faa25f13dccc22ca4ce6738e1f8bde86cdacea57a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libs/langchain/langchain_classic/chains/llm_math/base.py:273-280 | libs/langchain/langchain_classic/chains/llm_math/base.py:287-294 \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":"libs/langchain/langchain_classic/chains/llm_math/base.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b35f04487687915a45f87cd25c30bb110a3a5db46c405ab1515c291578e7bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): libs/langchain/langchain_classic/chains/qa_with_sources/loading.py:182-208 | libs/langchain/langchain_classic/chains/question_answering/chain.py:248-279 | libs/langchain/langchain_classic/chains/summarize/chain.py:202-226 \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":"libs/langchain/langchain_classic/chains/qa_with_sources/loading.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2d581ceb6f22055f25224bcdb0656195d1f491e0eb2e0f8a23366858fa3fbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): libs/langchain/langchain_classic/memory/summary_buffer.py:116-127 | libs/langchain/langchain_classic/memory/summary_buffer.py:130-141 | libs/langchain/langchain_classic/memory/token_buffer.py:65-74 \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":"libs/langchain/langchain_classic/memory/summary_buffer.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c92ad752ff67394ff19e818776da63025b88800b6e90e312216df01fc3ae8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): libs/partners/openai/langchain_openai/decisions/base.py:294-303 | libs/partners/openai/langchain_openai/decisions/base.py:306-315 | libs/partners/openai/langchain_openai/decisions/classifier.py:268-277 | libs/partners/openai/langchain_openai/decisions/classifier.py:283-292 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/decisions/base.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1314e547e9358aafd3361b9d109caefa5a6e66ef658d5671c8c11ac1088f30aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): libs/langchain/langchain_classic/chains/conversational_retrieval/base.py:450-495 | libs/langchain/langchain_classic/chains/qa_with_sources/loading.py:153-164 | libs/langchain/langchain_classic/chains/summarize/chain.py:183-193 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 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":"libs/langchain/langchain_classic/chains/conversational_retrieval/base.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"feab88ddee553893f3df9d2ce7c85b96bf6d2c102d2f8ef360a204eb804000af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/langchain/langchain_classic/retrievers/document_compressors/cohere_rerank.py:108-124 | libs/partners/fireworks/langchain_fireworks/rerank.py:207-217 \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":"libs/langchain/langchain_classic/retrievers/document_compressors/cohere_rerank.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1c665309a2a46276fd983843b48880b97cc340a786218f249fc29daa81d005"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/langchain/langchain_classic/agents/conversational_chat/base.py:124-132 | libs/langchain/langchain_classic/agents/format_scratchpad/log_to_messages.py:9-26 \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":"libs/langchain/langchain_classic/agents/conversational_chat/base.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c4bd28b7e507b5d3c3709d8a380a3b076a50c7a70e9f0063f7e2658fa0710e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): libs/core/langchain_core/callbacks/manager.py:1632-1667 | libs/core/langchain_core/callbacks/manager.py:2113-2148 \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":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"3070c2cae0a32391fb1b0e5fb14698311e5c9bdb09577d77294c1c2f9995c913"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): libs/core/langchain_core/load/_validation.py:166-191 | libs/partners/typesafe/langchain_typesafe/_assets.py:27-46 \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":"libs/core/langchain_core/load/_validation.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fbcff5ecac834bd49c2d6292c63a78e05e2bb9fbf9d4cef7bda55225dce0d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): libs/core/langchain_core/output_parsers/json.py:109-127 | libs/core/langchain_core/output_parsers/pydantic.py:97-114 | libs/langchain/langchain_classic/output_parsers/yaml.py:49-60 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/output_parsers/json.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec708474bd1f7239b61ca70a273e4809da9d48bbcaad2f2011dfd7b0164b8702"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/partners/anthropic/langchain_anthropic/llms.py:111-122 | libs/partners/fireworks/langchain_fireworks/chat_models.py:1308-1324 \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":"libs/partners/anthropic/langchain_anthropic/llms.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1df10487e102bf764b060152c44f70d977794d677809624222aa9fdd9045bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/partners/mistralai/langchain_mistralai/chat_models.py:483-498 | libs/partners/mistralai/langchain_mistralai/chat_models.py:502-531 \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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a50dd5166c34536bb39a458b6c228a6a4855dfb9870b12421ef31d5964298a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): libs/core/langchain_core/runnables/base.py:526-561 | libs/core/langchain_core/runnables/history.py:424-451 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a8781614ff692312ca6efe9129df22077f8a8bb62b9b9364732eda26a520df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/partners/qdrant/langchain_qdrant/qdrant.py:532-549 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:930-982 \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":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"65419d2775ae5e4f4f7b58394fc4f3453b04dbce3ede345ada095ea25428cd1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/langchain/langchain_classic/agents/openai_assistant/base.py:267-288 | libs/langchain/langchain_classic/agents/openai_assistant/base.py:399-421 \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":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"780435cd75d5e68b0760c1218777783beddee895ebeda7043158be61e404060f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/langchain/langchain_classic/retrievers/document_compressors/chain_extract.py:118-126 | libs/langchain/langchain_classic/retrievers/document_compressors/chain_filter.py:119-135 \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":"libs/langchain/langchain_classic/retrievers/document_compressors/chain_extract.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23950b71a2b96f502ce77d035a8989547e93287c9f5a4fe04ac1038d0261ec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): libs/core/langchain_core/callbacks/base.py:1018-1037 | libs/core/langchain_core/callbacks/manager.py:492-512 \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":"libs/core/langchain_core/callbacks/base.py"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e81adb315c20fb70c1d7c10e1ec1ab71c25238bb6a10c40fb199aba8426b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py:378-408 | libs/langchain/langchain_classic/evaluation/scoring/eval_chain.py:385-411 \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":"libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"545ffed6cfc663fdf2d98eb0c6a426b7af0c82b6b6b34c442ae50191152a3217"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/core/langchain_core/indexing/api.py:92-101 | libs/core/langchain_core/utils/iter.py:207-229 \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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"229ade71fccbc7dbf7a7adccae5e842a4e209cc63d3700f45272abab9c00803e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): libs/langchain/langchain_classic/chains/openai_functions/extraction.py:63-87 | libs/langchain/langchain_classic/chains/openai_functions/tagging.py:51-103 \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":"libs/langchain/langchain_classic/chains/openai_functions/extraction.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0016b9400002adf18bf84c8b21c28b1bf79d29417e48f208455f49abac946e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py:332-362 | libs/langchain/langchain_classic/evaluation/scoring/eval_chain.py:344-370 \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":"libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa2ad4d804630f597bf2ea241fe09d4d50c55114e50eaa621badcfaea81b9ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): libs/partners/openai/langchain_openai/chat_models/azure.py:882-885 | libs/partners/openai/langchain_openai/chat_models/base.py:3866-3869 | libs/partners/xai/langchain_xai/chat_models.py:624-627 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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":"libs/partners/openai/langchain_openai/chat_models/azure.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d845d87f92349d977cec03fdaafe2e7f892913a19a0741a0e5f0ad9eb080af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/langchain_v1/langchain/agents/middleware/auto_mode.py:147-158 | libs/partners/openai/langchain_openai/middleware/auto_mode.py:205-219 \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":"libs/langchain_v1/langchain/agents/middleware/auto_mode.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e93de1b93984c0c23fb63bc68e141f688d8f813156e3d44baa84e778b7c77b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/langchain_v1/langchain/agents/middleware/model_call_limit.py:77-91 | libs/langchain_v1/langchain/agents/middleware/tool_call_limit.py:120-138 \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":"libs/langchain_v1/langchain/agents/middleware/model_call_limit.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c430228b4b3bb57bdafbacae77a93aef939b31c9b294d84fb451fac2e567ebce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/core/langchain_core/language_models/fake.py:51-57 | libs/core/langchain_core/language_models/fake_chat_models.py:81-92 \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":"libs/core/langchain_core/language_models/fake.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c67eea9278f5f780d9c9d90e0dfe34535190f6d9ae0f760838883bcdb7a716"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): libs/core/langchain_core/prompts/few_shot.py:101-117 | libs/core/langchain_core/prompts/few_shot_with_templates.py:117-122 \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":"libs/core/langchain_core/prompts/few_shot.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5da6b2936d38b1ac409cb2b7e9e6866df2fe0114ebb4927f6e2eae8f8693164"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): libs/core/langchain_core/prompts/few_shot.py:82-98 | libs/core/langchain_core/prompts/few_shot_with_templates.py:109-114 \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":"libs/core/langchain_core/prompts/few_shot.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6aef5fcee7f7d67eaee865528ee3cdd6a7bcd4dbe14b055260b09a196b7549"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libs/langchain/langchain_classic/agents/openai_functions_agent/base.py:65-83 | libs/langchain/langchain_classic/agents/openai_functions_multi_agent/base.py:128-135 \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":"libs/langchain/langchain_classic/agents/openai_functions_agent/base.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a31592063ffe4828432251dea37f1d330182e711ae70018ac1d68a19e88c97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): libs/langchain/langchain_classic/agents/agent.py:746-751 | libs/langchain/langchain_classic/agents/format_scratchpad/log.py:9-23 \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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec3027780dd9f2ec18642785fa5ff453c1a6b949aaabd334b9b0edcaaeb02c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): libs/core/langchain_core/indexing/api.py:45-49 | libs/langchain/langchain_classic/embeddings/cache.py:29-40 \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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee26bbe7b916cdfdb4f8d273c7da3af6763d684902b947823768d6cf6feaa02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): libs/core/langchain_core/language_models/chat_models.py:1930-1933 | libs/core/langchain_core/language_models/llms.py:811-814 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1930}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0a05864e5f30923b6bc25531bdca287a4cc3986c72c011473d31dafeb684b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): libs/langchain/langchain_classic/chains/conversational_retrieval/base.py:430-435 | libs/langchain/langchain_classic/chains/qa_with_sources/retrieval.py:65-70 \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":"libs/langchain/langchain_classic/chains/conversational_retrieval/base.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e591ee9c0aead5920a73632276cc2ac00b0cfc8c69a69935d753e3bf67d90d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): libs/core/langchain_core/language_models/chat_models.py:1919-1920 | libs/core/langchain_core/language_models/llms.py:800-801 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"c288068fa514d5c92d358ed89c48161ddd90750f90117a4106ad6bfc7217e3e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): libs/langchain/langchain_classic/chains/conversational_retrieval/base.py:415-420 | libs/langchain/langchain_classic/chains/qa_with_sources/retrieval.py:52-57 \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":"libs/langchain/langchain_classic/chains/conversational_retrieval/base.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6076b767a7c5536b7072ab2c2a3bfc5ab4fd5dd0beeab86f54f50336e52c174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (266\u2013278 lines \u00D7 2): libs/partners/fireworks/langchain_fireworks/chat_models.py:1716-1993 | libs/partners/ollama/langchain_ollama/chat_models.py:1452-1717 \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 \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py:1716\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: \u0060ChatFireworks\u0060 names \u0060langchain_fireworks\u0060 in one and \u0060langchain_fireworks.chat_models\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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"b010f8e42c68561ac9c53f4ec25f0cc3bda5f8d403c86798c05ce7f6c6990885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (62\u2013256 lines \u00D7 2): libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:1106-1167 | libs/partners/mistralai/langchain_mistralai/chat_models.py:1023-1278 \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 \u0060libs/partners/mistralai/langchain_mistralai/chat_models.py:1023\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, \u0060libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:1168\u0060 calls \u0060convert_to_openai_tool\u0060 and \u0060libs/partners/mistralai/langchain_mistralai/chat_models.py:1281\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":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"762e121457cde15490b96cba08b46e8c7476a867773ccbbaa38fa949aacfe698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (145\u2013180 lines \u00D7 4): libs/langchain_v1/langchain/agents/middleware/types.py:965-1121 | libs/langchain_v1/langchain/agents/middleware/types.py:1154-1298 | libs/langchain_v1/langchain/agents/middleware/types.py:1331-1510 | libs/langchain_v1/langchain/agents/middleware/types.py:1543-1688 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/types.py"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"045cf7c4590fcc4662c5f65467cf91640c558809aaee66064b6bd035d4d9dec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (114\u2013132 lines \u00D7 2): libs/langchain/langchain_classic/agents/react/agent.py:25-138 | libs/langchain/langchain_classic/agents/structured_chat/base.py:174-305 \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 \u0060libs/langchain/langchain_classic/agents/react/agent.py:25\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":"libs/langchain/langchain_classic/agents/react/agent.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a532dd071293381113fc28f426bfee5f02be695d1c38634c6beee71c882a6e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (127\u2013128 lines \u00D7 2): libs/core/langchain_core/indexing/api.py:310-436 | libs/core/langchain_core/indexing/api.py:649-776 \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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1572e09f2b2d0bab274ee236b8083440b800cac1003b40200a2b8265006694ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (72\u201389 lines \u00D7 2): libs/langchain/langchain_classic/agents/agent_toolkits/vectorstore/base.py:40-111 | libs/langchain/langchain_classic/agents/agent_toolkits/vectorstore/base.py:132-220 \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":"libs/langchain/langchain_classic/agents/agent_toolkits/vectorstore/base.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2def658c94198fd121d590d4123ee08e97cb54c2010fe236e6981579b198f31f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (83\u201385 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/vectorstores.py:1649-1731 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:1814-1898 \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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53edeca25cf1a1a49b4bff3057f64b9e9247e35b13f56e717091feb96986425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (62\u201374 lines \u00D7 2): libs/core/langchain_core/language_models/_compat_bridge.py:616-689 | libs/core/langchain_core/language_models/_compat_bridge.py:707-768 \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":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"09628fb5c980704275d660c60601b3257b7291e5490d8cea99044c26b5c3dba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (68\u201370 lines \u00D7 2): libs/partners/perplexity/langchain_perplexity/chat_models.py:1244-1313 | libs/partners/perplexity/langchain_perplexity/chat_models.py:1362-1429 \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":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7908b852c7ed37750ba30078f7a6c147be13364cfef898695fe24ce30c90c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56\u201358 lines \u00D7 2): libs/core/langchain_core/callbacks/manager.py:1762-1817 | libs/core/langchain_core/callbacks/manager.py:2290-2347 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060CallbackManagerForChainGroup\u0060 in one and \u0060AsyncCallbackManagerForChainGroup\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":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":1762}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b5b3a7acb2e080f49297fade1f89ae8eba9c53ccbb7f42bc04a7825814b96b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (58 lines \u00D7 2): libs/partners/ollama/langchain_ollama/chat_models.py:1236-1293 | libs/partners/ollama/langchain_ollama/chat_models.py:1318-1375 \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":"libs/partners/ollama/langchain_ollama/chat_models.py"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c6e74b069a38fc3eb5cb5380ca1c1ac4e6485d1581cbec08a3dcfc29d43793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52\u201354 lines \u00D7 2): libs/core/langchain_core/messages/ai.py:735-786 | libs/core/langchain_core/messages/ai.py:796-849 \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 \u0060libs/core/langchain_core/messages/ai.py:735\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":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d02dbf425b6b66b768200cac0c1a73a8f0dd5a8f38b56feee41a95ea6339831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53\u201354 lines \u00D7 2): libs/langchain/langchain_classic/agents/openai_assistant/base.py:616-669 | libs/langchain/langchain_classic/agents/openai_assistant/base.py:770-822 \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 \u0060libs/langchain/langchain_classic/agents/openai_assistant/base.py:616\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":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7694ba645a3a777678b5d09d7a66894354737d588a23ddea3204e22e774177"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:217-261 | libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:721-765 \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 \u0060libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:217\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":"libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"59da6090d159805dfe3667651467fd538c54d614d612e2e1a20144136c771a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201343 lines \u00D7 2): libs/core/langchain_core/messages/block_translators/openai.py:919-960 | libs/core/langchain_core/messages/block_translators/openai.py:970-1012 \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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a815a35d7562be77885356b3ccfe69f9c508af88374e1cd8d9510fd6a1dcf4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/vectorstores.py:1734-1776 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:1901-1943 \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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"878c69e25d183fcad329493ff1849d3912c511f0c1f8668647f9c481096f0a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:3578-3619 | libs/core/langchain_core/runnables/base.py:3709-3750 \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 \u0060libs/core/langchain_core/runnables/base.py:3578\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3578}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2aa7415974925f01680298bfe8d5d179c4c5dc3aa6372c4d14c85380f3e98ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201342 lines \u00D7 2): libs/partners/openrouter/langchain_openrouter/chat_models.py:633-674 | libs/partners/openrouter/langchain_openrouter/chat_models.py:726-766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/partners/openrouter/langchain_openrouter/chat_models.py:633\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8def9ccaf8c3785262ea7ed8f3e5a11839656d91bc54a5beee1ebf0275db917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201342 lines \u00D7 2): libs/partners/perplexity/langchain_perplexity/chat_models.py:1460-1498 | libs/partners/perplexity/langchain_perplexity/chat_models.py:1526-1567 \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 \u0060libs/partners/perplexity/langchain_perplexity/chat_models.py:1526\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":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc44ed872eddad5952c392f17610493f9da2a6b19d20990da11518b00f8d009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): libs/core/langchain_core/language_models/llms.py:967-1007 | libs/core/langchain_core/language_models/llms.py:1237-1277 \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 \u0060libs/core/langchain_core/language_models/llms.py:967\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":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"2355dd8cf035db2e66d555a015ffee261271be2f7bd92a8aada93b363d11e05a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 2): libs/langchain_v1/langchain/agents/factory.py:287-324 | libs/langchain_v1/langchain/agents/factory.py:379-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060handlers\u0060 to \u0060Sequence[_ModelCallHandler[ContextT]]\u0060 in one and \u0060Sequence[_AsyncModelCallHandler[ContextT]]\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":"libs/langchain_v1/langchain/agents/factory.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2c086c43029a6d53a4b5c68c8045a02056781330f913c9da305f71d6b30611"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 2): libs/partners/fireworks/langchain_fireworks/chat_models.py:1408-1445 | libs/partners/fireworks/langchain_fireworks/chat_models.py:1554-1590 \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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e40a00a5b1a2515f000ddefbf4543f3e885fb191ecef12a3b7e210a351247a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:552-588 | libs/langchain_v1/langchain/chat_models/base.py:548-584 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ac5d86b7adf660337c7329903e69df1443a7e1ba06994f72b8ca6bcd0400fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201336 lines \u00D7 2): libs/core/langchain_core/_security/_transport.py:78-113 | libs/core/langchain_core/_security/_transport.py:160-189 \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 \u0060libs/core/langchain_core/_security/_transport.py:78\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":"libs/core/langchain_core/_security/_transport.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"103d7aa02a7993f72d062ec8c6aa32189f6ac495c9520470e801319d7ad8ddee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): libs/core/langchain_core/runnables/retry.py:260-295 | libs/core/langchain_core/runnables/retry.py:335-370 \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 \u0060libs/core/langchain_core/runnables/retry.py:260\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/retry.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"26aedbef16917b7f06fc42332c38c0dd002ef1383a75508ed4417561300765af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): libs/partners/chroma/langchain_chroma/vectorstores.py:561-595 | libs/partners/chroma/langchain_chroma/vectorstores.py:647-682 \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 \u0060libs/partners/chroma/langchain_chroma/vectorstores.py:561\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":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4ad14c317bd213a89808fa3ee5c1c00cf8bc9e806da53a33649c47f9d035d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): libs/partners/fireworks/langchain_fireworks/chat_models.py:164-199 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:201-235 \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. 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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d509c66b7b138c477f7c872fea7ed2f703f509d35e73abc000ca8f862c9c6ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201335 lines \u00D7 2): libs/langchain/langchain_classic/agents/agent.py:461-494 | libs/langchain/langchain_classic/agents/agent.py:573-607 \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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e0dd5ad00c86ae97bd0e7712ba051c8819f65893ac1f01bc443684c277e034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201335 lines \u00D7 2): libs/langchain/langchain_classic/agents/conversational/base.py:135-169 | libs/langchain/langchain_classic/agents/structured_chat/base.py:136-152 \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 \u0060libs/langchain/langchain_classic/agents/conversational/base.py:135\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: \u0060LLMChain\u0060 names \u0060langchain_classic.chains\u0060 in one and \u0060langchain_classic.chains.llm\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":"libs/langchain/langchain_classic/agents/conversational/base.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"08130426c6c08ed98cbdd2f842320dee87c288ff83e8f4268b49988bd0d78191"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): libs/langchain/langchain_classic/indexes/_sql_record_manager.py:296-330 | libs/langchain/langchain_classic/indexes/_sql_record_manager.py:378-412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/indexes/_sql_record_manager.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3de575cd39ca5d3eb6d20c1cc3deab504c856404ee5778b628a38a7babf68e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201335 lines \u00D7 2): libs/langchain/langchain_classic/output_parsers/retry.py:133-166 | libs/langchain/langchain_classic/output_parsers/retry.py:263-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. 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":"libs/langchain/langchain_classic/output_parsers/retry.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea9250a4527ef4393035a855d77dc0c1f58334810de2354d0bcce96f58f3d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201335 lines \u00D7 2): libs/partners/chroma/langchain_chroma/vectorstores.py:115-149 | libs/partners/qdrant/langchain_qdrant/_utils.py:14-36 \u2014 before extracting anything, compare \u0060libs/partners/chroma/langchain_chroma/vectorstores.py\u0060 and \u0060libs/partners/qdrant/langchain_qdrant/_utils.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 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":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b7438663ba93d5d8e92ea4ed889f236b4508718d762c423796cb1ca3dd9f4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201335 lines \u00D7 2): libs/partners/groq/langchain_groq/chat_models.py:728-762 | libs/partners/groq/langchain_groq/chat_models.py:785-818 \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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"a564dc5223b81f834c6840997dcaf6272c2355e2583a80220a9852f365d24eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): libs/core/langchain_core/indexing/api.py:472-504 | libs/core/langchain_core/indexing/api.py:822-854 \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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8eb7a333c9974b0677c2733ea389b2aaa2c1fa015f8134dd926a0b44bf0186"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): libs/core/langchain_core/messages/block_translators/anthropic.py:304-336 | libs/core/langchain_core/messages/block_translators/bedrock_converse.py:228-260 \u2014 before extracting anything, compare \u0060libs/core/langchain_core/messages/block_translators/anthropic.py\u0060 and \u0060libs/core/langchain_core/messages/block_translators/bedrock_converse.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 104 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/core/langchain_core/messages/block_translators/anthropic.py:302\u0060 calls \u0060setdefault\u0060 and \u0060libs/core/langchain_core/messages/block_translators/bedrock_converse.py:227\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":"libs/core/langchain_core/messages/block_translators/anthropic.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dee3463d7c3cb11c4f44f5be66ba4f01308af926013157402f1b4329e7929b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): libs/core/langchain_core/output_parsers/openai_tools.py:167-199 | libs/core/langchain_core/output_parsers/openai_tools.py:234-266 \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":"libs/core/langchain_core/output_parsers/openai_tools.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d878bbb12e04f980321ac2d60242a32c1ebace209763d0408316f5017b6db8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201333 lines \u00D7 2): libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:848-880 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:915-945 \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 \u0060libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:848\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"993f8795d54c3a7b54d19a8d7317e4d6996bde6b3b44b021589986d45b7e3cce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201332 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:374-405 | libs/core/langchain_core/runnables/base.py:409-436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd9df4bda743677bfd6635ff6d6fb2b4a8f99c1570cf90ecc8fbdb0d39aa574"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): libs/core/langchain_core/tools/base.py:1100-1131 | libs/core/langchain_core/tools/base.py:1230-1261 \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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf79f2c0cbba29c1f27fa28f796b85939eb7611c3a220ccf5e85884fe802c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): libs/langchain/langchain_classic/agents/agent.py:1318-1349 | libs/langchain/langchain_classic/agents/agent.py:1457-1488 \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 \u0060libs/langchain/langchain_classic/agents/agent.py:1318\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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae68a2e9cf00b5215a564644a7f604d4a7bf9eaae869ff672db56dfeadc89ef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): libs/langchain/langchain_classic/agents/mrkl/output_parser.py:64-95 | libs/langchain/langchain_classic/agents/output_parsers/react_single_input.py:64-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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/langchain/langchain_classic/agents/mrkl/output_parser.py:63\u0060 calls \u0060startswith\u0060 and \u0060libs/langchain/langchain_classic/agents/output_parsers/react_single_input.py:63\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":"libs/langchain/langchain_classic/agents/mrkl/output_parser.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d84053f8f1172490fca5a68c9af1d6dd6232adfa759ec37e46002566d51af4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201332 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/file_search.py:269-288 | libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:844-875 \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":"libs/langchain_v1/langchain/agents/middleware/file_search.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7135510717d563677123a5a195fccabddd499ea9a9d2da8f15b5bc90e2bd3088"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201332 lines \u00D7 2): libs/partners/openai/langchain_openai/llms/base.py:453-484 | libs/partners/openai/langchain_openai/llms/base.py:537-553 \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":"libs/partners/openai/langchain_openai/llms/base.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"3131def41647b7567b1842f0b6445ad661ff5c1bd5adf4c358ce7aa74d779d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/vectorstores.py:1039-1070 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:1117-1148 \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 \u0060libs/partners/qdrant/langchain_qdrant/vectorstores.py:1039\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d33c87cc3dbc9c58201904cb1fcce5f3b43320e66b68d1ad1f180504ff5a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): libs/core/langchain_core/language_models/llms.py:935-965 | libs/core/langchain_core/language_models/llms.py:1205-1235 \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 \u0060libs/core/langchain_core/language_models/llms.py:935\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":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd02bd46e5cbbc9c0725195e384ca9cb33c5720f702209e6640a6e78819580e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:3661-3691 | libs/core/langchain_core/runnables/fallbacks.py:378-408 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3661}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c68af6cc609ca9f9aa130e4859f7de4dbb6722b02e789ef4457319c08231be8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201330 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:1046-1075 | libs/core/langchain_core/language_models/chat_models.py:1187-1213 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5e559af5301d1407772ec5b2233e2f11c09d8e4fc594f3fe12729ee656cba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:2325-2354 | libs/core/langchain_core/language_models/llms.py:752-790 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":2325}}}],"partialFingerprints":{"codehealthFindingId/v1":"1229bc350a115605d91f03175c6fa717fd1ced645baa33e9627f7893c2895b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py:55-84 | libs/langchain/langchain_classic/evaluation/scoring/eval_chain.py:56-85 \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 \u0060libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py:55\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":"libs/langchain/langchain_classic/evaluation/comparison/eval_chain.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aa43aada52857f5ab64da2bc010630f8898529bc3567f06404a0e3c00517d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/vectorstores.py:1339-1368 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:1580-1609 \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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf63a4d93ac3c38e0f5acdb7e80506782aa8f24c457b4141c8736fad52e90f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:787-815 | libs/core/langchain_core/language_models/chat_models.py:1059-1087 \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, \u0060libs/core/langchain_core/language_models/chat_models.py:1052\u0060 calls \u0060_normalize_messages\u0060 and \u0060libs/core/langchain_core/language_models/chat_models.py:786\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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9128169dbc8f2d0e8d62fb9eee2a157e6930835bf133ab625df9f7c58a3838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:920-948 | libs/core/langchain_core/language_models/chat_models.py:1197-1225 \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, \u0060libs/core/langchain_core/language_models/chat_models.py:1193\u0060 calls \u0060_normalize_messages\u0060 and \u0060libs/core/langchain_core/language_models/chat_models.py:918\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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0d58c1017b9836dc9ecfbf4521043018e01ed57a155ff6491409e4b02420a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:1581-1609 | libs/core/langchain_core/language_models/llms.py:343-371 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0d2e6b6a3c927e642c07cc2908f79dcf778eb056b4054a15196784b92b6b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): libs/core/langchain_core/messages/ai.py:244-272 | libs/core/langchain_core/messages/ai.py:447-474 \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":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"731845b78e5c06b5941aacaf5bde8a31f3a5e7ccfc3e05a354aa3de65b5c0004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): libs/langchain/langchain_classic/agents/agent.py:425-453 | libs/langchain/langchain_classic/agents/agent.py:537-565 \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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"67029aa84b07c894ab8dc44b6cc25f09bebf9f30955910397b60c0edfae3585d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201329 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/model_retry.py:241-267 | libs/langchain_v1/langchain/agents/middleware/tool_retry.py:323-351 \u2014 before extracting anything, compare \u0060libs/langchain_v1/langchain/agents/middleware/model_retry.py\u0060 and \u0060libs/langchain_v1/langchain/agents/middleware/tool_retry.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 81 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060handler\u0060 to \u0060Callable[[ModelRequest[ContextT]], ModelResponse[ResponseT]]\u0060 in one and \u0060Callable[[ToolCallRequest], ToolMessage | Command[Any]]\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":"libs/langchain_v1/langchain/agents/middleware/model_retry.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3cfe9b714b534697a7a8194dab6c1c6d9271fdde5e4eeba4cd3fbe081cff43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201329 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/model_retry.py:295-321 | libs/langchain_v1/langchain/agents/middleware/tool_retry.py:387-415 \u2014 before extracting anything, compare \u0060libs/langchain_v1/langchain/agents/middleware/model_retry.py\u0060 and \u0060libs/langchain_v1/langchain/agents/middleware/tool_retry.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 81 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060handler\u0060 to \u0060Callable[[ModelRequest[ContextT]], Awaitable[ModelResponse[ResponseT]]]\u0060 in one and \u0060Callable[[ToolCallRequest], Awaitable[ToolMessage | Command[Any]]]\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":"libs/langchain_v1/langchain/agents/middleware/model_retry.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"629cdd73eff7f76a8ff6a3cfe107b904dbd4bed0a6ee9794fcaa2804c74dc651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201328 lines \u00D7 2): libs/core/langchain_core/messages/block_translators/bedrock_converse.py:36-60 | libs/core/langchain_core/messages/block_translators/google_genai.py:125-152 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/langchain_core/messages/block_translators/google_genai.py:153\u0060 calls \u0060get\u0060 and \u0060libs/core/langchain_core/messages/block_translators/bedrock_converse.py:62\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":"libs/core/langchain_core/messages/block_translators/bedrock_converse.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c189c8ef863509689c189d0617d2df2a029635fe783f0952f0119666d5b5fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): libs/core/langchain_core/output_parsers/list.py:75-102 | libs/core/langchain_core/output_parsers/list.py:110-136 \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":"libs/core/langchain_core/output_parsers/list.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1845aa48884a61a9c4421e1e677b751c63d2c36984a755deed4fa6b3772ae742"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:691-718 | libs/langchain_v1/langchain/chat_models/base.py:686-713 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a67b2b5f3b1bf0444ba29a261c248ee080d8c56b3682e67313ffaf47e5689d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): libs/partners/openai/langchain_openai/chat_models/base.py:4549-4576 | libs/partners/openai/langchain_openai/chat_models/base.py:4597-4622 \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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":4549}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c140c7db299e438cb83a60a29d703391010f0416b358a93b21dd822f1eff65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): libs/core/langchain_core/callbacks/manager.py:1390-1416 | libs/core/langchain_core/callbacks/manager.py:1444-1470 \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":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0c7b7bb1fe5a9f51458770cc2431dcf4c1ba7c4a0b51b543a9dcb969c079e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): libs/core/langchain_core/runnables/utils.py:474-500 | libs/core/langchain_core/runnables/utils.py:503-529 \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":"libs/core/langchain_core/runnables/utils.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6f74765031544e347ed747dbc3d162a2707b5510729b53ef7a16d62f92a3da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 16): libs/core/scripts/check_version.py:33-58 | libs/partners/anthropic/scripts/check_version.py:33-58 | libs/partners/chroma/scripts/check_version.py:33-58 | libs/partners/deepseek/scripts/check_version.py:33-58 | libs/partners/exa/scripts/check_version.py:33-58 | libs/partners/fireworks/scripts/check_version.py:33-58 | libs/partners/groq/scripts/check_version.py:33-58 | libs/partners/huggingface/scripts/check_version.py:33-58 | libs/partners/mistralai/scripts/check_version.py:33-58 | libs/partners/nomic/scripts/check_version.py:33-58 | libs/partners/ollama/scripts/check_version.py:33-58 | libs/partners/openai/scripts/check_version.py:33-58 | libs/partners/openrouter/scripts/check_version.py:33-58 | libs/partners/perplexity/scripts/check_version.py:33-58 | libs/partners/qdrant/scripts/check_version.py:33-58 | libs/partners/xai/scripts/check_version.py:33-58 \u2014 before extracting anything, compare \u0060libs/core/scripts/check_version.py\u0060 and \u0060libs/partners/anthropic/scripts/check_version.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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":"libs/core/scripts/check_version.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14d106fd3cfbf59b8e0119884358813a861180042d36955b22ebff427096009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): libs/core/langchain_core/runnables/fallbacks.py:318-342 | libs/core/langchain_core/runnables/fallbacks.py:416-441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/langchain_core/runnables/fallbacks.py:318\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":"libs/core/langchain_core/runnables/fallbacks.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f6996d82f786d4be27d664a28dbf047bb29e3ed8756f95c3e98e99e6b40bda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): libs/langchain/langchain_classic/callbacks/streaming_aiter_final_only.py:40-65 | libs/langchain/langchain_classic/callbacks/streaming_stdout_final_only.py:41-66 \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":"libs/langchain/langchain_classic/callbacks/streaming_aiter_final_only.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a6fb674a5f8aa23cb7a864509ac928638741f3938fca1a7cb32f04624eb754"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:361-386 | libs/langchain_v1/langchain/chat_models/base.py:508-533 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa57725df96d819281640e120c0c8e66faab11aae15bd13044c7ddb2f7fe975a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): libs/core/langchain_core/messages/block_translators/anthropic.py:275-299 | libs/core/langchain_core/messages/block_translators/bedrock_converse.py:203-227 \u2014 before extracting anything, compare \u0060libs/core/langchain_core/messages/block_translators/anthropic.py\u0060 and \u0060libs/core/langchain_core/messages/block_translators/bedrock_converse.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 104 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/langchain_core/messages/block_translators/anthropic.py:302\u0060 calls \u0060setdefault\u0060 and \u0060libs/core/langchain_core/messages/block_translators/bedrock_converse.py:228\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":"libs/core/langchain_core/messages/block_translators/anthropic.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cd975e0d0024140969680860d1ae2bc46bc06e6210dffb47fb86a2c8f46a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:2591-2614 | libs/core/langchain_core/runnables/base.py:2675-2699 \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 \u0060libs/core/langchain_core/runnables/base.py:2591\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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd18e5c2b3b8e166fff69c018bcdd6cfce17a4388024c28f8636ef9978e820f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): libs/core/langchain_core/vectorstores/base.py:531-555 | libs/core/langchain_core/vectorstores/base.py:581-605 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/langchain_core/vectorstores/base.py:531\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":"libs/core/langchain_core/vectorstores/base.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6fc0fac64c4314e9f127bb07d4fd1a310a21a6638955fcfd89fc5e9803c645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:596-620 | libs/langchain_v1/langchain/chat_models/base.py:598-620 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/langchain/langchain_classic/chat_models/base.py:596\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a7bc4dde7fca9e74c544f853414793f98230bc510b252146bf66a73f929758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/summarization.py:482-506 | libs/langchain_v1/langchain/agents/middleware/summarization.py:523-547 \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":"libs/langchain_v1/langchain/agents/middleware/summarization.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"db544b4a40c2b68ae7e78ce145b1d95f2038fab8818a1887d2dffaffdee96e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/types.py:1966-1990 | libs/langchain_v1/langchain/agents/middleware/types.py:2156-2178 \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 \u0060libs/langchain_v1/langchain/agents/middleware/types.py:1966\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060handler\u0060 to \u0060Callable[[ModelRequest[ContextT]], Awaitable[ModelResponse[ResponseT]]]\u0060 in one and \u0060Callable[[ToolCallRequest], Awaitable[ToolMessage | Command[Any]]]\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":"libs/langchain_v1/langchain/agents/middleware/types.py"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f2e5444cb93d7bcb8e0cf6e3460fa1d00994b486889c9aa150a5688d167540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): libs/core/langchain_core/callbacks/manager.py:1917-1940 | libs/core/langchain_core/callbacks/manager.py:1990-2011 \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 \u0060libs/core/langchain_core/callbacks/manager.py:1917\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":"libs/core/langchain_core/callbacks/manager.py"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c568ab8bbf3de43391862743553c38274efc651af6082743578af12202e446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/core/langchain_core/messages/block_translators/anthropic.py:77-100 | libs/core/langchain_core/messages/block_translators/anthropic.py:129-152 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060source\u0060 to \u0060dict) and \u0022type\u0022 in\u0060 in one and \u0060block_type == \u0022image\u0022 and isinstance(source, dict) and \u0022type\u0022 in\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":"libs/core/langchain_core/messages/block_translators/anthropic.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4727acc2cde793ed542ebe024fdc32edeff945f084024572c44cb5c3a7699d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/core/langchain_core/tools/base.py:1049-1072 | libs/core/langchain_core/tools/base.py:1177-1200 \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 \u0060libs/core/langchain_core/tools/base.py:1049\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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f76cdd4e1abbcedba73dfc1bba0ef4276ff0b3971573edd66bf5d219347e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:916-939 | libs/langchain_v1/langchain/chat_models/base.py:905-928 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4de4d17e0a073d52324279e60291d316160471e96ffc52f5daf0b27a1cd99dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): libs/langchain/langchain_classic/smith/evaluation/runner_utils.py:1539-1562 | libs/langchain/langchain_classic/smith/evaluation/runner_utils.py:1716-1737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: \u0060Client\u0060 names \u0060langsmith\u0060 in one and \u0060langsmith.client\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":"libs/langchain/langchain_classic/smith/evaluation/runner_utils.py"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8da1f3775a0cbe9c6875ee1bbd6c2af16d57210b607055f4ca9b5d4acc1489b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/types.py:1994-2017 | libs/langchain_v1/langchain/agents/middleware/types.py:2182-2203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060handler\u0060 to \u0060Callable[[ModelRequest[ContextT]], ModelResponse[ResponseT]]\u0060 in one and \u0060Callable[[ToolCallRequest], ToolMessage | Command[Any]]\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":"libs/langchain_v1/langchain/agents/middleware/types.py"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"338a659d41c7960df844e04a44a2e68f89e6e2577b3600ad4dae897e31dafcb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): libs/partners/groq/langchain_groq/chat_models.py:1255-1278 | libs/partners/openrouter/langchain_openrouter/chat_models.py:1000-1021 \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 \u0060libs/partners/groq/langchain_groq/chat_models.py:1255\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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e13e6d33f7cacc3ab41c7c0873ef4ae251a418ea8efbd5aaa105477fb154f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/partners/openai/langchain_openai/chat_models/base.py:1736-1759 | libs/partners/openai/langchain_openai/chat_models/base.py:1812-1835 \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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ec0c7fbe7c21702119fdef37ebacd38673bc671f888a5ca83292ba72851e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/vectorstores.py:604-627 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:699-722 \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 \u0060libs/partners/qdrant/langchain_qdrant/vectorstores.py:604\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd863ad74a0c78155abb3a9981b903fda578abe1af8ac69557f1dc1987e4d41f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 4): libs/langchain_v1/langchain/agents/middleware/model_retry.py:244-264 | libs/langchain_v1/langchain/agents/middleware/model_retry.py:298-318 | libs/langchain_v1/langchain/agents/middleware/tool_retry.py:326-348 | libs/langchain_v1/langchain/agents/middleware/tool_retry.py:390-412 \u2014 before extracting anything, compare \u0060libs/langchain_v1/langchain/agents/middleware/model_retry.py\u0060 and \u0060libs/langchain_v1/langchain/agents/middleware/tool_retry.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 81 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":"libs/langchain_v1/langchain/agents/middleware/model_retry.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"714788d45f61faa8a64be3476f46a55da8185a02651a7fbd68d5ec23ed460a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): libs/core/langchain_core/tools/simple.py:133-155 | libs/core/langchain_core/tools/structured.py:163-185 \u2014 before extracting anything, compare \u0060libs/core/langchain_core/tools/simple.py\u0060 and \u0060libs/core/langchain_core/tools/structured.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 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":"libs/core/langchain_core/tools/simple.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d3a29eab92c1e05359f1258b6e416a72ad0984f52d5ac861275b43a1339d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): libs/langchain/langchain_classic/_api/module_import.py:95-116 | libs/langchain/langchain_classic/_api/module_import.py:129-151 \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 \u0060libs/langchain/langchain_classic/_api/module_import.py:95\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":"libs/langchain/langchain_classic/_api/module_import.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a533b447e4e614b17b29c685d4e7d568bdf4124c5f82086dced2c599948352b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/file_search.py:406-428 | libs/partners/anthropic/langchain_anthropic/middleware/file_search.py:333-355 \u2014 before extracting anything, compare \u0060libs/langchain_v1/langchain/agents/middleware/file_search.py\u0060 and \u0060libs/partners/anthropic/langchain_anthropic/middleware/file_search.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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":"libs/langchain_v1/langchain/agents/middleware/file_search.py"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7de0da2f7a3015ed09077a57c5cadb78f3a5b819113173a094735b623c1a762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/tool_selection.py:417-439 | libs/langchain_v1/langchain/agents/middleware/tool_selection.py:485-507 \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":"libs/langchain_v1/langchain/agents/middleware/tool_selection.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cee2bbe8ac89416327990cb81d82503f665297be5dfc5b16e7b152049edba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/types.py:1776-1797 | libs/langchain_v1/langchain/agents/middleware/types.py:1818-1840 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/types.py"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a39399999d390fa7e9d02bc6910059d1c4d92e430c9fcbe656ee319ef62ef4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 2): libs/partners/groq/langchain_groq/chat_models.py:1533-1552 | libs/partners/openrouter/langchain_openrouter/chat_models.py:1348-1370 \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. 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, \u0060libs/partners/groq/langchain_groq/chat_models.py:1553\u0060 calls \u0060get\u0060, \u0060dict\u0060 and \u0060libs/partners/openrouter/langchain_openrouter/chat_models.py:1371\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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8ffaddf14d3319da95148952dc3a6503aff2c6afdcd7049c9c27c0660bffae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): libs/partners/openai/langchain_openai/embeddings/base.py:601-622 | libs/partners/openai/langchain_openai/embeddings/base.py:674-696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/partners/openai/langchain_openai/embeddings/base.py:674\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/embeddings/base.py"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"c682248791e10ac83debe4bfd2715c200578edd8eb59ed8dc09bcadb70570c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201322 lines \u00D7 6): libs/core/langchain_core/messages/content.py:1068-1083 | libs/core/langchain_core/messages/content.py:1134-1149 | libs/core/langchain_core/messages/content.py:1200-1215 | libs/core/langchain_core/messages/content.py:1266-1281 | libs/core/langchain_core/messages/content.py:1323-1344 | libs/core/langchain_core/messages/content.py:1465-1480 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/langchain_core/messages/content.py:1323\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":"libs/core/langchain_core/messages/content.py"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"28014bb9353876bc3fa98f5ba9c3b859f9b8e880deb99b17cbce25211786a244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): libs/langchain/langchain_classic/chains/loading.py:433-454 | libs/langchain/langchain_classic/chains/loading.py:463-484 | libs/langchain/langchain_classic/chains/loading.py:496-517 | libs/langchain/langchain_classic/chains/loading.py:526-547 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/chains/loading.py"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38c0c0d6b60ff0c2ff1aa84ede76ec6c243b1e15ad4982e0705510e997f0168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:294-315 | libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:324-345 | libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:788-809 | libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:818-839 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"77092704dffdaa56457344d15216c5d08f5cd6eb7cbb434270498784bbc593e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): libs/langchain/langchain_classic/agents/agent.py:1738-1759 | libs/langchain/langchain_classic/agents/agent.py:1769-1790 \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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3327e8e575a297c3f325bf61c634f6856e8457b2e8b65bc756c1b73d22086ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/shell_tool.py:277-298 | libs/langchain_v1/langchain/agents/middleware/shell_tool.py:362-383 \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":"libs/langchain_v1/langchain/agents/middleware/shell_tool.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bb80995708d778e27527f322d3701e5e20039d3eb5c23f4b892b50c4423e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/vectorstores.py:2215-2236 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:2256-2277 \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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15db7fc2b73eb980a27d14a79ad5264f57e6904440fc66abcbdf6e47ab93af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:3533-3553 | libs/core/langchain_core/runnables/fallbacks.py:282-302 \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 \u0060libs/core/langchain_core/runnables/base.py:3533\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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3533}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc83410e70d0aafeb6c88e6efa4070b03ca6feeb884ac438d062b14fc2e0d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): libs/core/langchain_core/runnables/fallbacks.py:221-241 | libs/core/langchain_core/runnables/fallbacks.py:535-554 \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":"libs/core/langchain_core/runnables/fallbacks.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"30128f604758295e6e0b76f430de10060f97ad49645526ae49312e9c9aafaae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/core/langchain_core/tracers/event_stream.py:199-219 | libs/core/langchain_core/tracers/event_stream.py:249-269 \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":"libs/core/langchain_core/tracers/event_stream.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b9d2f0ce11348ce005028c6f8da5d5657f7352c4ab1e84bef1cd82480e00b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/langchain/langchain_classic/agents/chat/output_parser.py:40-60 | libs/langchain/langchain_classic/agents/output_parsers/react_json_single_input.py:55-75 \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. 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":"libs/langchain/langchain_classic/agents/chat/output_parser.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f9a2f10538dea992836ad8377a8b05928f56109ef0713d994b7e781a1c6a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:785-803 | libs/core/langchain_core/language_models/chat_models.py:917-936 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9d93a000079d743f7160a045732ab9de6e7407c2cc5484f8d83e42a8c8f94a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:2042-2060 | libs/core/langchain_core/language_models/chat_models.py:2198-2217 \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 \u0060libs/core/langchain_core/language_models/chat_models.py:2198\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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9d90ac26a8218d100495a3fe0802cff2cc77b08351b04942a7ad60622b82e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:2071-2090 | libs/core/langchain_core/language_models/chat_models.py:2228-2247 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9ed752638cb96db55f6fcc4de8ef15eb333003c7661a43f4e443a1751f59b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/core/langchain_core/messages/block_translators/anthropic.py:240-259 | libs/core/langchain_core/messages/block_translators/bedrock_converse.py:170-189 \u2014 before extracting anything, compare \u0060libs/core/langchain_core/messages/block_translators/anthropic.py\u0060 and \u0060libs/core/langchain_core/messages/block_translators/bedrock_converse.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 104 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":"libs/core/langchain_core/messages/block_translators/anthropic.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b632b3637550d3b3363e77a0f062805eb2c9209decf2a6ccc95ff0e9fc038f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:2464-2480 | libs/core/langchain_core/runnables/base.py:3631-3650 \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 \u0060libs/core/langchain_core/runnables/base.py:3631\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ea8ea6ec052d9ba553d7a88d9030ee52feb53e92d4ce74463b5d0626562df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:2536-2555 | libs/core/langchain_core/runnables/base.py:3762-3781 \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 \u0060libs/core/langchain_core/runnables/base.py:3762\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"283665f137457b6dc0bf1621c49261647b29e2d796eae1764a26196f81a85f00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/core/langchain_core/runnables/config.py:507-526 | libs/core/langchain_core/runnables/config.py:541-560 \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":"libs/core/langchain_core/runnables/config.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6d4eda0ad6c4f837c2099202a622321dadfe11ceb545ca2bd90d24f817a434"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/core/langchain_core/runnables/fallbacks.py:168-187 | libs/core/langchain_core/runnables/fallbacks.py:471-490 \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":"libs/core/langchain_core/runnables/fallbacks.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b55c13f79b35afdc8bc094a4799b501f4914b0296ef838a31773e375628d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/core/langchain_core/tracers/event_stream.py:1035-1054 | libs/core/langchain_core/tracers/log_stream.py:695-714 \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":"libs/core/langchain_core/tracers/event_stream.py"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"a069b63f5915b999eac1e959bd052fd667215a1d99a8c83207cdf89df86a0be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:887-906 | libs/langchain_v1/langchain/chat_models/base.py:876-895 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93964e63720602db2bb47ab0e7ee6c29ccd068f34d520805b5b366f7d46e321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/partners/fireworks/langchain_fireworks/chat_models.py:575-594 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:259-278 \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. 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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6428c3538b3afc4613bb436cba74881a789d39d2d60f810c8db20bf80b48372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py:428-447 | libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py:464-483 \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 \u0060libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py:428\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":"libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"923270891b343d6d29e66d5416f97fb4aad3cfec1f57106eb4f26d7b34425bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/partners/openai/langchain_openai/chat_models/base.py:1976-1995 | libs/partners/openai/langchain_openai/chat_models/base.py:2279-2298 \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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf64ce9f12ca32c3f0ea99a33c0ba6da569546911053dcd4ef407c90728fc96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): libs/partners/fireworks/langchain_fireworks/chat_models.py:1686-1704 | libs/partners/groq/langchain_groq/chat_models.py:951-969 | libs/partners/openrouter/langchain_openrouter/chat_models.py:933-950 \u2014 before extracting anything, compare \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py\u0060 and \u0060libs/partners/groq/langchain_groq/chat_models.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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 \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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a47b84081f7bb8fa4e8576c287dc9a90a021e8897ac9195fbe9c57bc46444a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/core/langchain_core/_api/beta_decorator.py:116-134 | libs/core/langchain_core/_api/deprecation.py:250-268 \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":"libs/core/langchain_core/_api/beta_decorator.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4195695dd471a54f0aec743c987381f3d545caf39c661cd953509276b2c8b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/core/langchain_core/_api/beta_decorator.py:185-203 | libs/core/langchain_core/_api/deprecation.py:389-407 \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":"libs/core/langchain_core/_api/beta_decorator.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf18c5e062becbe043be87cc26a431acf789256978cb4346b13186cd18a75070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/core/langchain_core/indexing/api.py:554-572 | libs/core/langchain_core/indexing/api.py:903-923 \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 \u0060libs/core/langchain_core/indexing/api.py:554\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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2d50fdb022c2dc5b79bb153baed402092f9249a3e7a82d5ad1880c600aff4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/core/langchain_core/language_models/llms.py:438-458 | libs/core/langchain_core/language_models/llms.py:484-504 \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 \u0060libs/core/langchain_core/language_models/llms.py:438\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"516072fa2b5c7f308bf70894056d879584b3885d18300d34bc8bc6d7fe53f907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/core/langchain_core/runnables/branch.py:333-351 | libs/core/langchain_core/runnables/branch.py:417-435 \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 \u0060libs/core/langchain_core/runnables/branch.py:333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/branch.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a004cdb8b06782bf4a78d81f820a6b170e2131c6f7c728887cd38e79555bc41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/core/langchain_core/tools/simple.py:106-124 | libs/core/langchain_core/tools/structured.py:136-154 \u2014 before extracting anything, compare \u0060libs/core/langchain_core/tools/simple.py\u0060 and \u0060libs/core/langchain_core/tools/structured.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 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":"libs/core/langchain_core/tools/simple.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b1b3d2fcb20aa81f2e45fa92ae91f19e1406ede9b8ead67353c4931635013d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): libs/langchain/langchain_classic/agents/chat/base.py:157-174 | libs/langchain/langchain_classic/agents/mrkl/base.py:141-159 \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 \u0060libs/langchain/langchain_classic/agents/chat/base.py:157\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: \u0060LLMChain\u0060 names \u0060langchain_classic.chains\u0060 in one and \u0060langchain_classic.chains.llm\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":"libs/langchain/langchain_classic/agents/chat/base.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd4e9653b6e2d12e056c46ab136d39a517fa60f29361f109ed458e77994944b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/langchain/langchain_classic/chains/base.py:522-540 | libs/langchain/langchain_classic/chains/base.py:546-564 \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":"libs/langchain/langchain_classic/chains/base.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc25feecdd40fdbc5f71112d4c96bbbea06907a7a06ec67d4e021242c8fc253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/langchain/langchain_classic/chains/qa_with_sources/loading.py:101-119 | libs/langchain/langchain_classic/chains/summarize/chain.py:129-147 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chains/qa_with_sources/loading.py\u0060 and \u0060libs/langchain/langchain_classic/chains/summarize/chain.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/langchain/langchain_classic/chains/qa_with_sources/loading.py:101\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":"libs/langchain/langchain_classic/chains/qa_with_sources/loading.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a6575b6eacf3173fbc8cf3ef44e4d972a2006582434e4db7a8ab25f65f4dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:831-849 | libs/langchain_v1/langchain/chat_models/base.py:820-838 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e841de8c4f4e07f6571d06fefd0b1264f153e45b42df0389c3c1a34dd8b9746"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:859-877 | libs/langchain_v1/langchain/chat_models/base.py:848-866 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd3d75b0533477aa32bd8097687a63fd66cc683b0802fde8e4b2d6b4861f5ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): libs/langchain/langchain_classic/retrievers/document_compressors/chain_filter.py:61-79 | libs/langchain/langchain_classic/retrievers/document_compressors/chain_filter.py:93-110 \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 \u0060libs/langchain/langchain_classic/retrievers/document_compressors/chain_filter.py:61\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":"libs/langchain/langchain_classic/retrievers/document_compressors/chain_filter.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6893dbd909b657cfd694e542c36551f2dd9e6ae9c1ecfd5a1bbea5a8a0062e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/partners/groq/langchain_groq/chat_models.py:1443-1461 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:163-181 \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 \u0060libs/partners/groq/langchain_groq/chat_models.py:1443\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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec024dd4ee4b60487baa91e49e08df4aa229bdf3eac7adc76e49e755eb1ad719"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/partners/openai/langchain_openai/decisions/base.py:171-189 | libs/partners/openai/langchain_openai/decisions/classifier.py:187-205 \u2014 before extracting anything, compare \u0060libs/partners/openai/langchain_openai/decisions/base.py\u0060 and \u0060libs/partners/openai/langchain_openai/decisions/classifier.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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":"libs/partners/openai/langchain_openai/decisions/base.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fb6ce6dbac3b60733d3c04a12664934373874283887c97e9e3588bacf1a468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 3): libs/core/langchain_core/messages/block_translators/langchain_v0.py:92-107 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:160-177 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:230-247 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/langchain_core/messages/block_translators/langchain_v0.py:160\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/block_translators/langchain_v0.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1e860061095e0a76ff022a42ac648570cc7f6cb40142b6d709133267ab3a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): libs/langchain/langchain_classic/agents/openai_functions_agent/base.py:142-161 | libs/langchain/langchain_classic/agents/openai_functions_multi_agent/base.py:209-226 | libs/langchain/langchain_classic/agents/openai_functions_multi_agent/base.py:240-257 \u2014 \u0060libs/langchain/langchain_classic/agents/openai_functions_agent/base.py\u0060 and \u0060libs/langchain/langchain_classic/agents/openai_functions_multi_agent/base.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 75 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/openai_functions_agent/base.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"993c5aaa23037d19267581b6280629aff8a06db1104850ec2eea249a6528ad80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): libs/langchain/langchain_classic/chains/qa_with_sources/loading.py:104-121 | libs/langchain/langchain_classic/chains/question_answering/chain.py:144-161 | libs/langchain/langchain_classic/chains/summarize/chain.py:132-149 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chains/qa_with_sources/loading.py\u0060 and \u0060libs/langchain/langchain_classic/chains/summarize/chain.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/langchain/langchain_classic/chains/qa_with_sources/loading.py:104\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":"libs/langchain/langchain_classic/chains/qa_with_sources/loading.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8727ce266faebc60f7bdf265e51f437ed3b1da947e6aab90d3f3af2676abcee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): libs/partners/fireworks/langchain_fireworks/chat_models.py:450-469 | libs/partners/groq/langchain_groq/chat_models.py:1445-1462 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:165-182 \u2014 before extracting anything, compare \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py\u0060 and \u0060libs/partners/groq/langchain_groq/chat_models.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py:450\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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a231fb70674d98f60db3224977a85edab3636ff2dac4ff31d8196f15a3335d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): libs/partners/fireworks/langchain_fireworks/chat_models.py:1976-1993 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:1161-1178 | libs/partners/ollama/langchain_ollama/chat_models.py:1700-1717 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0b6639e05543f78796f33ec4b401c2ae82b70a22fc01ed7a44d8c9a1c3613f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): libs/partners/ollama/langchain_ollama/chat_models.py:951-968 | libs/partners/ollama/langchain_ollama/embeddings.py:297-314 | libs/partners/ollama/langchain_ollama/llms.py:331-348 \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 3 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":"libs/partners/ollama/langchain_ollama/chat_models.py"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34ec7805093b6da7145377d05f6ef87956a81a371e7c5b14404c15236761387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:854-871 | libs/core/langchain_core/language_models/chat_models.py:992-1007 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"71614afae05e0329bb0133e64937270f35ac9f5601ed37387189b8adef48fb8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/core/langchain_core/messages/block_translators/google_genai.py:340-357 | libs/core/langchain_core/messages/block_translators/google_genai.py:554-571 \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":"libs/core/langchain_core/messages/block_translators/google_genai.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3094ba015ba8b71a45cb8377a79c691a9aa05d610f62ab7dd4185691832d956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): libs/core/langchain_core/messages/block_translators/langchain_v0.py:136-150 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:204-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/langchain_core/messages/block_translators/langchain_v0.py:204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/block_translators/langchain_v0.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9d651c500036583fb46b5484b9071658dd52b1d7e49930c74b1f9c98e599d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:4573-4590 | libs/core/langchain_core/runnables/base.py:4614-4631 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":4573}}}],"partialFingerprints":{"codehealthFindingId/v1":"45edac0902b0d34071a0e49b5a9c6b07eed65cd0bd777d3941370ed04194d4f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/core/langchain_core/runnables/branch.py:353-370 | libs/core/langchain_core/runnables/branch.py:437-454 \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 \u0060libs/core/langchain_core/runnables/branch.py:353\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":"libs/core/langchain_core/runnables/branch.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"37db8d97165db861ad7ac39654f62bef031d4375df7caff85227d6f3a85ad847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/langchain/langchain_classic/agents/agent.py:1354-1371 | libs/langchain/langchain_classic/agents/agent.py:1491-1508 \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 \u0060libs/langchain/langchain_classic/agents/agent.py:1354\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea22b4aae2cb8b0d1db8d5856c97682fae94106c40f081adf4c9752af815154"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/file_search.py:79-96 | libs/partners/anthropic/langchain_anthropic/middleware/file_search.py:60-77 \u2014 before extracting anything, compare \u0060libs/langchain_v1/langchain/agents/middleware/file_search.py\u0060 and \u0060libs/partners/anthropic/langchain_anthropic/middleware/file_search.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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":"libs/langchain_v1/langchain/agents/middleware/file_search.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dccd10f72e6366e790ffcdd6c2830c250ab3d223941fea95a640563ce22d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): libs/partners/chroma/langchain_chroma/vectorstores.py:543-559 | libs/partners/chroma/langchain_chroma/vectorstores.py:628-645 \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 \u0060libs/partners/chroma/langchain_chroma/vectorstores.py:543\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":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"65165d636c7548bb31496b0b88fe1f0f92596c5a0c23627d3d342a09031d0a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/partners/fireworks/langchain_fireworks/chat_models.py:1346-1363 | libs/partners/openai/langchain_openai/chat_models/base.py:1599-1616 \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. 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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ce4a6dfa9e1375e55438b1115719b6132c59e49198d027f52d1f5bb6273000"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/partners/fireworks/langchain_fireworks/chat_models.py:1992-2009 | libs/partners/openrouter/langchain_openrouter/chat_models.py:1005-1022 \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 \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py:1992\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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dcabad6848cfba0d208ed45229213ceb37ecb86d9dfee80a13d7458b3100df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/partners/groq/langchain_groq/chat_models.py:1567-1584 | libs/partners/openrouter/langchain_openrouter/chat_models.py:1374-1391 \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. 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, \u0060libs/partners/groq/langchain_groq/chat_models.py:1585\u0060 calls \u0060FunctionMessage\u0060, \u0060get\u0060 and \u0060libs/partners/openrouter/langchain_openrouter/chat_models.py:1392\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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"562e1381b32a2d7a4304da518a1aa9e66c7dac6573a2ab77680db9a9e2c7b797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/qdrant.py:466-483 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:1404-1420 \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 \u0060libs/partners/qdrant/langchain_qdrant/qdrant.py:466\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad96e8377529589e5116f3ca37c54ac5abdea4f27a974671fef9a487952f1aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): libs/langchain/langchain_classic/chains/combine_documents/map_reduce.py:180-196 | libs/langchain/langchain_classic/chains/combine_documents/map_rerank.py:152-168 | libs/langchain/langchain_classic/chains/combine_documents/refine.py:127-143 | libs/langchain/langchain_classic/chains/combine_documents/stuff.py:175-191 \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 \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":"libs/langchain/langchain_classic/chains/combine_documents/map_reduce.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9baa7a83716c404da31db5c061d4a408d1d65d46bef0d93f421ce767af3822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): libs/core/langchain_core/messages/block_translators/langchain_v0.py:116-132 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:186-202 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:256-272 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/langchain_core/messages/block_translators/langchain_v0.py:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/block_translators/langchain_v0.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30a8992fdffc74489b8f9b8059268a707ebbba52f8d9064110f5da0bdc0c86e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): libs/core/langchain_core/utils/utils.py:291-307 | libs/partners/groq/langchain_groq/chat_models.py:517-532 | libs/partners/openrouter/langchain_openrouter/chat_models.py:388-403 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/utils/utils.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d95e7fbcf6bbad568059a86b1712dce1afdc7c83eaa1ca04f2cd34512c27f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): libs/partners/fireworks/langchain_fireworks/chat_models.py:1975-1991 | libs/partners/groq/langchain_groq/chat_models.py:1242-1258 | libs/partners/ollama/langchain_ollama/chat_models.py:1699-1715 \u2014 before extracting anything, compare \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py\u0060 and \u0060libs/partners/groq/langchain_groq/chat_models.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py:1975\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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f27cd20ffacf4e7e00318613bb3abc83897eb79fd4e020dc2a9f4a1f58a004d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:1942-1958 | libs/core/langchain_core/language_models/chat_models.py:2101-2117 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cee8841516ff09f28a27e0c69225f3ce918c2723124380cf14d12c191c6d114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:2025-2041 | libs/core/langchain_core/language_models/chat_models.py:2180-2196 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fbe6e9a66c9843b9c187ac1613260040b80ec030a81854a3bc00bcacf424dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/core/langchain_core/language_models/llms.py:1056-1072 | libs/core/langchain_core/language_models/llms.py:1335-1351 \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 \u0060libs/core/langchain_core/language_models/llms.py:1056\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":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4b8b737f8dfe8d1dc9c0e7eeac1c1a7407a232a40659c19561f546550d8091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): libs/core/langchain_core/messages/block_translators/openai.py:456-472 | libs/core/langchain_core/messages/block_translators/openai.py:482-496 \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 \u0060libs/core/langchain_core/messages/block_translators/openai.py:456\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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"400894d652901e4075ad2dd53229c6e760e920566fc631543eee653c487e388e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/langchain/langchain_classic/agents/openai_assistant/base.py:527-543 | libs/langchain/langchain_classic/agents/openai_assistant/base.py:684-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. 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":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e024984b07e1a5e0acf24837b8404fd0e36c09e36df243319a2705271067ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:754-770 | libs/langchain_v1/langchain/chat_models/base.py:748-764 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"316388885f9961036097b7e9160d659c580ff30011f7bc9f670ade77d6eab008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/partners/fireworks/langchain_fireworks/chat_models.py:2029-2045 | libs/partners/openrouter/langchain_openrouter/chat_models.py:1042-1058 \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 \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py:2029\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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0702501716d42c0d885165122899d4de601b5b02f42b8acaa8d2e52c03b4740"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:1203-1219 | libs/partners/ollama/langchain_ollama/chat_models.py:1772-1788 \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 \u0060libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:1203\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":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6192b2b83e00ec717b933f2b9f3e4f13c8b3472ad25500ecf6cc09ce828394d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/partners/openai/langchain_openai/chat_models/base.py:1457-1473 | libs/partners/openai/langchain_openai/embeddings/base.py:386-403 \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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"572cd77738a897711429f0bb37fb9e637ebdabd30a7897ef0a03079e493b7afe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): libs/partners/openai/langchain_openai/chat_models/base.py:1997-2011 | libs/partners/openai/langchain_openai/chat_models/base.py:2300-2316 \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 \u0060libs/partners/openai/langchain_openai/chat_models/base.py:2300\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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8079f762f6eac5f3224acd2bd6504df3143189c5eb9aeca26fff6019875685"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 17): libs/core/scripts/check_version.py:28-43 | libs/langchain_v1/scripts/check_version.py:28-43 | libs/partners/anthropic/scripts/check_version.py:28-43 | libs/partners/chroma/scripts/check_version.py:28-43 | libs/partners/deepseek/scripts/check_version.py:28-43 | libs/partners/exa/scripts/check_version.py:28-43 | libs/partners/fireworks/scripts/check_version.py:28-43 | libs/partners/groq/scripts/check_version.py:28-43 | libs/partners/huggingface/scripts/check_version.py:28-43 | libs/partners/mistralai/scripts/check_version.py:28-43 | libs/partners/nomic/scripts/check_version.py:28-43 | libs/partners/ollama/scripts/check_version.py:28-43 | libs/partners/openai/scripts/check_version.py:28-43 | libs/partners/openrouter/scripts/check_version.py:28-43 | libs/partners/perplexity/scripts/check_version.py:28-43 | libs/partners/qdrant/scripts/check_version.py:28-43 | libs/partners/xai/scripts/check_version.py:28-43 \u2014 before extracting anything, compare \u0060libs/core/scripts/check_version.py\u0060 and \u0060libs/partners/anthropic/scripts/check_version.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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":"libs/core/scripts/check_version.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0736afa238b7ba0f822f4081e6de3e967ee2ac1f64ad036988087b5a467ea98c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 17): libs/core/scripts/check_version.py:46-61 | libs/langchain_v1/scripts/check_version.py:46-61 | libs/partners/anthropic/scripts/check_version.py:46-61 | libs/partners/chroma/scripts/check_version.py:46-61 | libs/partners/deepseek/scripts/check_version.py:46-61 | libs/partners/exa/scripts/check_version.py:46-61 | libs/partners/fireworks/scripts/check_version.py:46-61 | libs/partners/groq/scripts/check_version.py:46-61 | libs/partners/huggingface/scripts/check_version.py:46-61 | libs/partners/mistralai/scripts/check_version.py:46-61 | libs/partners/nomic/scripts/check_version.py:46-61 | libs/partners/ollama/scripts/check_version.py:46-61 | libs/partners/openai/scripts/check_version.py:46-61 | libs/partners/openrouter/scripts/check_version.py:46-61 | libs/partners/perplexity/scripts/check_version.py:46-61 | libs/partners/qdrant/scripts/check_version.py:46-61 | libs/partners/xai/scripts/check_version.py:46-61 \u2014 before extracting anything, compare \u0060libs/core/scripts/check_version.py\u0060 and \u0060libs/partners/anthropic/scripts/check_version.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 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":"libs/core/scripts/check_version.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b8c9a83975199635077bf101937adc4eb31f74e0ef1c0ed25e21dcbf95ad6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): libs/core/langchain_core/utils/utils.py:234-248 | libs/core/langchain_core/utils/utils.py:287-302 | libs/partners/groq/langchain_groq/chat_models.py:513-527 | libs/partners/openrouter/langchain_openrouter/chat_models.py:384-398 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/core/langchain_core/utils/utils.py:233\u0060 calls \u0060get\u0060 and \u0060libs/core/langchain_core/utils/utils.py:284\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":"libs/core/langchain_core/utils/utils.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac176a1c5c3f873884c4901b6b6e6fb87b45b64bc0aca6fe4d4a374a102ebbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:1997-2012 | libs/core/langchain_core/language_models/chat_models.py:2152-2167 \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 \u0060libs/core/langchain_core/language_models/chat_models.py:1997\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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"a950c94d97b3007cf08240be20cff4881d2f17d95dcdb9fb7ea847b049146444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:3457-3472 | libs/core/langchain_core/runnables/base.py:3496-3511 \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 \u0060libs/core/langchain_core/runnables/base.py:3457\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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3457}}}],"partialFingerprints":{"codehealthFindingId/v1":"26adb52dce2565e7be11839ff923af318352eac1d66270e2d6409d4299a79e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): libs/core/langchain_core/vectorstores/base.py:77-91 | libs/core/langchain_core/vectorstores/base.py:216-231 \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":"libs/core/langchain_core/vectorstores/base.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0490566b600421eb95f9e0c164ecf1887a3d6790deba8828fd0c80e6caa568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/langchain/langchain_classic/chains/qa_with_sources/retrieval.py:29-44 | libs/langchain/langchain_classic/chains/qa_with_sources/vector_db.py:35-50 \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":"libs/langchain/langchain_classic/chains/qa_with_sources/retrieval.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37e7c676e91638c769ef90b5c8f3eb76b0db235170026ee91fc5c93d58ef5f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): libs/langchain_v1/langchain/agents/factory.py:1523-1538 | libs/langchain_v1/langchain/agents/factory.py:1583-1597 \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":"libs/langchain_v1/langchain/agents/factory.py"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"c921b2ce0953673deb51b9121595301752f5b2e413af0fbfeb2771381bf9880a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): libs/partners/chroma/langchain_chroma/vectorstores.py:40-55 | libs/partners/chroma/langchain_chroma/vectorstores.py:60-73 \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":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"10467a84f6a6200f556560ad0fe28db8b024865354e43e80ca14918d71483eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): libs/partners/groq/langchain_groq/chat_models.py:1427-1442 | libs/partners/openrouter/langchain_openrouter/chat_models.py:1307-1320 \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 \u0060libs/partners/groq/langchain_groq/chat_models.py:1427\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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"792bda57c584a39afebdc6939fd8bba4589bef8e6511f4eda9a1ffa70c789d26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/partners/ollama/langchain_ollama/llms.py:514-529 | libs/partners/ollama/langchain_ollama/llms.py:545-560 \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":"libs/partners/ollama/langchain_ollama/llms.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b2ad2825a455c22c4464228521142d2a712e30017b484e22e7b9ebde90acb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/partners/openai/langchain_openai/chat_models/base.py:1877-1892 | libs/partners/openai/langchain_openai/chat_models/base.py:2172-2187 \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, \u0060libs/partners/openai/langchain_openai/chat_models/base.py:1876\u0060 calls \u0060_ensure_sync_client_available\u0060 and \u0060libs/partners/openai/langchain_openai/chat_models/base.py:2171\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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf3d25eca8ea7d40936b86e7a5929fec72bfd2c81b7c5f9cca2411dc49565b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/partners/openai/langchain_openai/middleware/openai_moderation.py:292-307 | libs/partners/openai/langchain_openai/middleware/openai_moderation.py:329-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":"libs/partners/openai/langchain_openai/middleware/openai_moderation.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4830b793b124d2c548aa5c5b3178c3e98b87531a92715696f0c7a9bd5a4f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): libs/core/langchain_core/indexing/api.py:513-527 | libs/core/langchain_core/indexing/api.py:863-876 \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":"libs/core/langchain_core/indexing/api.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"014d0f515bd832c4dfbdc8aba1c6fd0867c714cff8bf4e9c1ca47ad21ea754d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/core/langchain_core/messages/ai.py:279-293 | libs/core/langchain_core/messages/block_translators/bedrock.py:17-31 \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 \u0060libs/core/langchain_core/messages/ai.py:279\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"981f3840f01941653f9b9790e2747658b2162e0da20b496cb13538dc9149d137"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): libs/core/langchain_core/messages/block_translators/openai.py:809-823 | libs/core/langchain_core/messages/block_translators/openai.py:850-863 \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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c71036802ed8e8975d39b9f4da604e85c48021f00f573ef588dfa42fa4afc03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/core/langchain_core/output_parsers/base.py:100-114 | libs/core/langchain_core/output_parsers/base.py:210-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/output_parsers/base.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d45529bbf107fbbb0d742dac656a6d0886b3aaa99f8b2600e576f568bb5f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/core/langchain_core/output_parsers/base.py:123-137 | libs/core/langchain_core/output_parsers/base.py:233-247 \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":"libs/core/langchain_core/output_parsers/base.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68e630b45302529bebf98a3f89baf27dd3b9a974f48c8cacd556e6c6c6740ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:4131-4145 | libs/core/langchain_core/runnables/base.py:5128-5142 \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, \u0060libs/core/langchain_core/runnables/base.py:5144\u0060 calls \u0060super\u0060, \u0060get_graph\u0060 and \u0060libs/core/langchain_core/runnables/base.py:4147\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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":4131}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb3efb3cb27282373e79a5ff9d04b782c4323a3ffaa769fda34f5c784f5d6e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:5191-5204 | libs/core/langchain_core/runnables/base.py:5386-5400 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":5191}}}],"partialFingerprints":{"codehealthFindingId/v1":"60408388bd1356be9bd9dd405fd731af652be07bf5386ca285053a8fa27adf7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/core/langchain_core/runnables/fallbacks.py:273-287 | libs/core/langchain_core/runnables/fallbacks.py:369-383 \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 \u0060libs/core/langchain_core/runnables/fallbacks.py:273\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":"libs/core/langchain_core/runnables/fallbacks.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8c777f4855164cc426ff76f2a09ed864543c5bf0045c58c6c50e637d88081e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/langchain/langchain_classic/agents/xml/base.py:71-85 | libs/langchain/langchain_classic/agents/xml/base.py:96-110 \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":"libs/langchain/langchain_classic/agents/xml/base.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c643b9e8854721cf77b55fe505e8e1e09db177fe095d77a64070a83bdb1d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py:195-209 | libs/partners/openai/langchain_openai/embeddings/base.py:359-373 \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 \u0060libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py:195\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":"libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99334c71893e775b6d82bd8da4dcf33bce3d8e0f9aff62fd6e36bc700e9a93d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/partners/ollama/langchain_ollama/chat_models.py:1212-1226 | libs/partners/ollama/langchain_ollama/chat_models.py:1400-1414 \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 \u0060libs/partners/ollama/langchain_ollama/chat_models.py:1212\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":"libs/partners/ollama/langchain_ollama/chat_models.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfb80ffc9df80279766d7afa3be48a248089a5d35d431017a9356c05fea50d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/partners/openai/langchain_openai/middleware/openai_moderation.py:236-250 | libs/partners/openai/langchain_openai/middleware/openai_moderation.py:350-364 \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":"libs/partners/openai/langchain_openai/middleware/openai_moderation.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"173b68533a13ebae7c96386058df453561ebf1e02625847be7642662290fa705"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/partners/openai/langchain_openai/middleware/openai_moderation.py:256-270 | libs/partners/openai/langchain_openai/middleware/openai_moderation.py:370-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":"libs/partners/openai/langchain_openai/middleware/openai_moderation.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"71877ebdf81193063e2e3103a21a630d51525b558b872b740510457dbede51fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/partners/openai/langchain_openai/middleware/openai_moderation.py:275-289 | libs/partners/openai/langchain_openai/middleware/openai_moderation.py:312-326 \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":"libs/partners/openai/langchain_openai/middleware/openai_moderation.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4df1e2e6962cda46470174237953df528e98ec154964e9ff94cb64ed0e6756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/vectorstores.py:587-601 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:682-696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b50dcfdac01ed6e1c05a3599254b60d2d11f1740c294fa7164818fdff3838a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 5): libs/partners/fireworks/langchain_fireworks/chat_models.py:2038-2049 | libs/partners/groq/langchain_groq/chat_models.py:1327-1340 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:1212-1223 | libs/partners/ollama/langchain_ollama/chat_models.py:1781-1792 | libs/partners/openrouter/langchain_openrouter/chat_models.py:1051-1062 \u2014 before extracting anything, compare \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py\u0060 and \u0060libs/partners/groq/langchain_groq/chat_models.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py:2038\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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afe0be569018866663dff3f335790676ba8d60a1f4e2c97f60abfd45c010a82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): libs/core/langchain_core/language_models/chat_models.py:840-853 | libs/core/langchain_core/language_models/chat_models.py:977-990 | libs/core/langchain_core/language_models/chat_models.py:2025-2038 | libs/core/langchain_core/language_models/chat_models.py:2180-2193 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbe92fbeba07a28861c3ca7ebda8090028b3c821a514a64e6ae8c5d469c542d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 4): libs/core/langchain_core/runnables/fallbacks.py:179-191 | libs/core/langchain_core/runnables/fallbacks.py:232-245 | libs/core/langchain_core/runnables/fallbacks.py:482-494 | libs/core/langchain_core/runnables/fallbacks.py:546-558 \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 \u0060libs/core/langchain_core/runnables/fallbacks.py:179\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":"libs/core/langchain_core/runnables/fallbacks.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6236f0382472d6395016cc21f754462ab9d9d696910d281bc0c5a25e36a9aeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): libs/core/langchain_core/prompts/few_shot_with_templates.py:142-153 | libs/core/langchain_core/prompts/few_shot_with_templates.py:184-197 \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":"libs/core/langchain_core/prompts/few_shot_with_templates.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfc5a958851f784ba7ff95a6a8a9fc7de4e6897972da73833f9bb823ff02ad9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:1030-1043 | libs/core/langchain_core/runnables/configurable.py:182-195 \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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"c784f26d1c36e7be9ce36f2a5536eb637a002ea7ad94efaa06f9a1214504c7cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:3621-3634 | libs/core/langchain_core/runnables/base.py:3752-3764 \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 \u0060libs/core/langchain_core/runnables/base.py:3621\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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"4409592a69e8b1ee2878a7e3d2335159f27cb98b0b51733fd8b331e8041d4f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/core/langchain_core/tools/base.py:1075-1089 | libs/core/langchain_core/tools/base.py:1203-1216 \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 \u0060libs/core/langchain_core/tools/base.py:1075\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/langchain_core/tools/base.py:1217\u0060 calls \u0060_to_args_and_kwargs\u0060 and \u0060libs/core/langchain_core/tools/base.py:1090\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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76d5a4a7a1738df6b8732524b7203c2810a44cfc91afbb0356faf3fcd1cad79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): libs/core/langchain_core/tracers/core.py:233-246 | libs/core/langchain_core/tracers/langchain.py:294-304 \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 \u0060libs/core/langchain_core/tracers/core.py:233\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":"libs/core/langchain_core/tracers/core.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e728673aabe7f0e389b1daf2287500b461d6bc62a35060c0cbfe0ddb60dfef10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/langchain/langchain_classic/chains/loading.py:119-132 | libs/langchain/langchain_classic/chains/loading.py:152-165 \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":"libs/langchain/langchain_classic/chains/loading.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65d5fe3ded5300a1f4b1261eaa6a6aa4af4faee2a44db9e55e6d054d2f46c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/langchain/langchain_classic/memory/summary_buffer.py:54-67 | libs/langchain/langchain_classic/memory/summary_buffer.py:73-86 \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":"libs/langchain/langchain_classic/memory/summary_buffer.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e33d2d9e4b4831f52e4347e776a0d1ba38f2bbe9e96d338b2056e5bb49759d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/file_search.py:45-58 | libs/partners/anthropic/langchain_anthropic/middleware/file_search.py:24-37 \u2014 before extracting anything, compare \u0060libs/langchain_v1/langchain/agents/middleware/file_search.py\u0060 and \u0060libs/partners/anthropic/langchain_anthropic/middleware/file_search.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 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":"libs/langchain_v1/langchain/agents/middleware/file_search.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6af97daeb6a0da5a227ecbfe10abcbb885a1e2e195ad8444f674081e2c34e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/langchain_v1/langchain/agents/middleware/tool_emulator.py:161-174 | libs/langchain_v1/langchain/agents/middleware/tool_emulator.py:219-232 \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":"libs/langchain_v1/langchain/agents/middleware/tool_emulator.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f86a76932daf20e94a71a441cc1e7df34eecb92f020b1b1891c94f0da393be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/partners/anthropic/langchain_anthropic/llms.py:267-280 | libs/partners/anthropic/langchain_anthropic/llms.py:304-317 \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 \u0060libs/partners/anthropic/langchain_anthropic/llms.py:267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060prompt\u0060 to \u0060str\u0060 in one and \u0060PromptValue\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":"libs/partners/anthropic/langchain_anthropic/llms.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0579e379b4092f14fc5c8543de999c133a538bb7559f5e367629cefbab6911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/partners/fireworks/langchain_fireworks/chat_models.py:1583-1596 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:938-951 \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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dbae0821356085055ec7706f4e93d735a990007af6a3f5f91cdfc83f363b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/partners/mistralai/langchain_mistralai/chat_models.py:1380-1393 | libs/partners/openai/langchain_openai/chat_models/base.py:4429-4442 \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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"46179280d7e461d6675b3da36f03de475c96d4cae88856c2571498833634e456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/partners/ollama/langchain_ollama/llms.py:394-407 | libs/partners/ollama/langchain_ollama/llms.py:436-449 \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":"libs/partners/ollama/langchain_ollama/llms.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cc6aafdbfb1a0710c9385d5c9be242fef9c2cdeaf30806b7bf2672c55e20b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): libs/partners/openrouter/langchain_openrouter/chat_models.py:608-619 | libs/partners/openrouter/langchain_openrouter/chat_models.py:698-711 \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 \u0060libs/partners/openrouter/langchain_openrouter/chat_models.py:698\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":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"6728efe38242059926ee06cdba7e522255dddabe77ec0e2e3b642727892a19e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/vectorstores.py:2153-2166 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:2182-2195 \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":"libs/partners/qdrant/langchain_qdrant/vectorstores.py"},"region":{"startLine":2153}}}],"partialFingerprints":{"codehealthFindingId/v1":"572096f46deadab980231dd269ea30d9e80d417e6987ce4e5ed97f4e0c772fdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 6): libs/core/langchain_core/messages/block_translators/langchain_v0.py:92-103 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:117-129 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:161-173 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:187-199 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:231-243 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:257-269 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/langchain_core/messages/block_translators/langchain_v0.py:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/block_translators/langchain_v0.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9026f6e9b8373f0e222a718432bfb4bff18225fdeb844330067664170a637e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): libs/core/langchain_core/messages/block_translators/anthropic.py:347-359 | libs/core/langchain_core/messages/block_translators/bedrock_converse.py:221-232 | libs/core/langchain_core/messages/block_translators/bedrock_converse.py:268-280 \u2014 before extracting anything, compare \u0060libs/core/langchain_core/messages/block_translators/anthropic.py\u0060 and \u0060libs/core/langchain_core/messages/block_translators/bedrock_converse.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 104 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/langchain_core/messages/block_translators/bedrock_converse.py:284\u0060 calls \u0060pop\u0060 and \u0060libs/core/langchain_core/messages/block_translators/anthropic.py:360\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":"libs/core/langchain_core/messages/block_translators/anthropic.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf2febd88012ec0faa3ba2d4bc00f02720ed9c052b80589335a43c9bddef625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): libs/core/langchain_core/vectorstores/utils.py:151-163 | libs/partners/chroma/langchain_chroma/vectorstores.py:140-152 | libs/partners/qdrant/langchain_qdrant/_utils.py:27-39 \u2014 before extracting anything, compare \u0060libs/partners/chroma/langchain_chroma/vectorstores.py\u0060 and \u0060libs/partners/qdrant/langchain_qdrant/_utils.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 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":"libs/core/langchain_core/vectorstores/utils.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c9447ccf58ebab22173abfe3d69e6d23d37c61039f13782e9a35f99d61b605"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/core/langchain_core/tracers/core.py:330-342 | libs/core/langchain_core/tracers/core.py:379-391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060response\u0060 to \u0060LLMResult\u0060 in one and \u0060LLMResult | None = None\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/langchain_core/tracers/core.py:392\u0060 calls \u0060_attach_gateway_metadata\u0060 and \u0060libs/core/langchain_core/tracers/core.py:343\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":"libs/core/langchain_core/tracers/core.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"3634f49f443585a9bce3229e734907ace904ea1d1a4d54fd673e31cb49e0a8ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): libs/core/langchain_core/tracers/event_stream.py:934-946 | libs/core/langchain_core/tracers/event_stream.py:962-973 \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":"libs/core/langchain_core/tracers/event_stream.py"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"527f4c925fe8619b2a56a683416e17b003c9b6e96b0fa220c9a5d1a68094943e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/langchain/langchain_classic/agents/openai_assistant/base.py:330-342 | libs/langchain/langchain_classic/agents/openai_assistant/base.py:462-474 \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":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed77c113fb86622fd23e618772712f697fcf4f619259d9adcf4766f47cbf4461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/langchain/langchain_classic/chains/llm.py:179-191 | libs/langchain/langchain_classic/chains/llm.py:204-216 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060run_manager\u0060 to \u0060CallbackManagerForChainRun | None = None\u0060 in one and \u0060AsyncCallbackManagerForChainRun | None = None\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":"libs/langchain/langchain_classic/chains/llm.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b560d67367b58fa7b061c6273a794131ab083deed63869f6642e2fc0f2e4684f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): libs/langchain/langchain_classic/chains/loading.py:76-87 | libs/langchain/langchain_classic/chains/loading.py:322-334 \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":"libs/langchain/langchain_classic/chains/loading.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8f741ebb87ac378a01a0b9639c4d93a6243e9d0bfc83b6d1e31e1fa4a87a79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): libs/langchain/langchain_classic/indexes/_sql_record_manager.py:463-474 | libs/langchain/langchain_classic/indexes/_sql_record_manager.py:490-502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/langchain/langchain_classic/indexes/_sql_record_manager.py:463\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":"libs/langchain/langchain_classic/indexes/_sql_record_manager.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e47ea149b9bf8a6f6669d9292b94bea7cbd1075b1de4873695b8e4ba8b00711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/langchain/langchain_classic/retrievers/time_weighted_retriever.py:165-177 | libs/langchain/langchain_classic/retrievers/time_weighted_retriever.py:185-197 \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":"libs/langchain/langchain_classic/retrievers/time_weighted_retriever.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f9f8316fd48054d5199069c9c17c86d4c111a57e528cbb15947b59f3613899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/partners/anthropic/langchain_anthropic/_compat.py:41-53 | libs/partners/anthropic/langchain_anthropic/_compat.py:85-97 \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":"libs/partners/anthropic/langchain_anthropic/_compat.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f137b5c6d1ec4231d74a283c52207cf51315d4b0a8d7f837aee87447d8b9bf9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 7): libs/core/langchain_core/messages/block_translators/langchain_v0.py:92-102 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:117-128 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:161-172 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:187-198 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:231-242 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:257-268 | libs/core/langchain_core/messages/block_translators/langchain_v0.py:289-300 \u2014 all 7 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 \u0060libs/core/langchain_core/messages/block_translators/langchain_v0.py:117\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":"libs/core/langchain_core/messages/block_translators/langchain_v0.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"691e92ae6f2aedc70e8cc787aa292284c0ca11e2273e817204da05bbf28eaf70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 3): libs/partners/openai/langchain_openai/chat_models/_compat.py:330-341 | libs/partners/openai/langchain_openai/chat_models/_compat.py:351-359 | libs/partners/openai/langchain_openai/chat_models/_compat.py:376-384 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/_compat.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f08c2c576caaa9e54610b24e3335ca40768ebd655fef56c93f78f3b719162e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): libs/core/langchain_core/language_models/_compat_bridge.py:309-319 | libs/core/langchain_core/language_models/_compat_bridge.py:321-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":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"837b93719f73368ea7049c6124406d9a9bc9dc5b64ca2ad6b30912d5301dda47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): libs/core/langchain_core/output_parsers/transform.py:129-140 | libs/core/langchain_core/output_parsers/transform.py:157-167 \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":"libs/core/langchain_core/output_parsers/transform.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d49a10663df0d48ebfa8cfa5e8867f3be42ae37ab00e6f6f55e8877c258599"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/langchain/langchain_classic/evaluation/scoring/eval_chain.py:282-294 | libs/langchain/langchain_classic/evaluation/scoring/eval_chain.py:473-484 \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 \u0060libs/langchain/langchain_classic/evaluation/scoring/eval_chain.py:282\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/evaluation/scoring/eval_chain.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"83030bdd71dfb90ddf2d465067fbb7c80c00e74547e0b49cb0d04f51dc97b1f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/partners/openai/langchain_openai/chat_models/base.py:1910-1921 | libs/partners/openai/langchain_openai/chat_models/base.py:2211-2222 \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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f043b5791610558a6783c65a6070444e9ebd7b8c74fb2297c4bfce2c8eb5a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): libs/partners/openai/langchain_openai/embeddings/base.py:624-633 | libs/partners/openai/langchain_openai/embeddings/base.py:698-709 \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 \u0060libs/partners/openai/langchain_openai/embeddings/base.py:698\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":"libs/partners/openai/langchain_openai/embeddings/base.py"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fb85e88d763df6d58d224ddd3bbf7aa1d575304dab341f8096e8ca76e3c892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/partners/perplexity/langchain_perplexity/chat_models.py:1207-1218 | libs/partners/perplexity/langchain_perplexity/chat_models.py:1324-1335 \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":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"08370c54c7db76953a4ed1aa8559ff29cdbe6c70e216441c95a81f726880c0e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 9): libs/core/langchain_core/language_models/chat_models.py:2601-2610 | libs/partners/fireworks/langchain_fireworks/chat_models.py:2042-2050 | libs/partners/groq/langchain_groq/chat_models.py:1333-1341 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:1216-1224 | libs/partners/mistralai/langchain_mistralai/chat_models.py:1335-1344 | libs/partners/ollama/langchain_ollama/chat_models.py:1785-1793 | libs/partners/openai/langchain_openai/chat_models/base.py:2879-2889 | libs/partners/openrouter/langchain_openrouter/chat_models.py:1055-1063 | libs/partners/perplexity/langchain_perplexity/chat_models.py:1736-1746 \u2014 before extracting anything, compare \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py\u0060 and \u0060libs/partners/groq/langchain_groq/chat_models.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/langchain_core/language_models/chat_models.py:2601\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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":2601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9280c1810deed7b6a7b153fee415cf35235bc82b9bf8f19cb0b15cec2bc4bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): libs/core/langchain_core/language_models/chat_models.py:857-868 | libs/core/langchain_core/language_models/chat_models.py:994-1004 | libs/core/langchain_core/language_models/chat_models.py:2044-2054 | libs/core/langchain_core/language_models/chat_models.py:2201-2211 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/langchain_core/language_models/chat_models.py:2212\u0060 calls \u0060ChatGenerationChunk\u0060 and \u0060libs/core/langchain_core/language_models/chat_models.py:869\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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"b691af4d7c74bd0bde926ce42c80bca63ff22e4e382385b563472e89933e0eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): libs/core/langchain_core/messages/block_translators/openai.py:805-814 | libs/core/langchain_core/messages/block_translators/openai.py:846-855 | libs/core/langchain_core/messages/block_translators/openai.py:889-899 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/core/langchain_core/messages/block_translators/openai.py:900\u0060 calls \u0060cast\u0060 and \u0060libs/core/langchain_core/messages/block_translators/openai.py:816\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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2159702ca718895238b9c7d9765d80b6b5df91e16c3d6010e2dc0eefab7ce06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): libs/langchain/langchain_classic/agents/json_chat/base.py:173-183 | libs/langchain/langchain_classic/agents/react/agent.py:131-141 | libs/langchain/langchain_classic/agents/structured_chat/base.py:298-308 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/json_chat/base.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b8a4307cd1d3dd619f65c2a3deffb63974fc0d51ed1b240d396f2e6fd725bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): libs/langchain/langchain_classic/chains/loading.py:75-84 | libs/langchain/langchain_classic/chains/loading.py:267-276 | libs/langchain/langchain_classic/chains/loading.py:321-331 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/langchain/langchain_classic/chains/loading.py:267\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":"libs/langchain/langchain_classic/chains/loading.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7070d8d39e5d85f55d1fc1ea1ae0062c26a497dbb8921ba19796fed2398f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): libs/langchain/langchain_classic/output_parsers/fix.py:109-119 | libs/langchain/langchain_classic/output_parsers/retry.py:142-152 | libs/langchain/langchain_classic/output_parsers/retry.py:272-282 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/langchain/langchain_classic/output_parsers/fix.py:109\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":"libs/langchain/langchain_classic/output_parsers/fix.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"954d5d7004aca45312f163a1790a80a61d2ff75caccce2d829a90512c65efc24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): libs/partners/groq/langchain_groq/chat_models.py:510-520 | libs/partners/openai/langchain_openai/embeddings/base.py:350-360 | libs/partners/openrouter/langchain_openrouter/chat_models.py:381-391 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/partners/groq/langchain_groq/chat_models.py:510\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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"00afe67519568be396da8ccdd2b02da38f96fea1bbd0ed6bcbad60272baecc82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/core/langchain_core/language_models/chat_model_stream.py:776-785 | libs/core/langchain_core/language_models/chat_model_stream.py:822-832 \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 \u0060libs/core/langchain_core/language_models/chat_model_stream.py:776\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df0bdfeb79ac409fa9dbc06c7355873d015acfabc272ebe45859426fd1221c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:503-513 | libs/core/langchain_core/language_models/llms.py:322-332 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f832543e4e1173e9d51ec806eec6bef804b68dbb923bbfb64491e58c6e737cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:529-537 | libs/core/langchain_core/language_models/llms.py:384-394 \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 \u0060libs/core/langchain_core/language_models/chat_models.py:529\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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d6e0dee9174c8220b641405f8975bfbd27a411a22e198d447df314a1f813b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:551-561 | libs/core/langchain_core/language_models/llms.py:407-417 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa2022a0a3c621556a7746cfb3f7e98023ec695a98e38a53f6a0015fe70937f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/langchain_core/language_models/fake_chat_models.py:110-121 | libs/core/langchain_core/language_models/fake_chat_models.py:139-149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/fake_chat_models.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cf4fa9dc374b15ea4f61b3df3dbcaaca431de776d6b38d30372a82dfa27bf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/langchain_core/messages/block_translators/google_genai.py:157-167 | libs/core/langchain_core/messages/block_translators/google_genai.py:207-217 \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":"libs/core/langchain_core/messages/block_translators/google_genai.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"724a1591ddb0cf5326aa72e4bc5a4e47b537be2e93b905478a73747b0391d672"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): libs/core/langchain_core/messages/utils.py:1702-1710 | libs/core/langchain_core/messages/utils.py:1712-1722 \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 \u0060libs/core/langchain_core/messages/utils.py:1702\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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8e4042b0b6dfbd703da04a6148d61d21f977e79dc7215148673eddc51f20c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/langchain_core/runnables/branch.py:311-321 | libs/core/langchain_core/runnables/branch.py:395-405 \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 \u0060libs/core/langchain_core/runnables/branch.py:311\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":"libs/core/langchain_core/runnables/branch.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d719ccc2973fd7f8dabf835ade281b002b565f13a81e4135dcf5c7cbe0213a38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/core/langchain_core/runnables/retry.py:247-257 | libs/core/langchain_core/runnables/retry.py:323-333 \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":"libs/core/langchain_core/runnables/retry.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf7cd0934380fab13f689a239508ebda036847a34558321a723e409502bda6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/core/langchain_core/tracers/base.py:48-58 | libs/core/langchain_core/tracers/base.py:579-588 \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":"libs/core/langchain_core/tracers/base.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d947aa431511abb5f5d90a6361b5d371891242fe33942f117649754e38b932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): libs/core/langchain_core/tracers/core.py:529-537 | libs/core/langchain_core/tracers/core.py:585-595 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"libs/core/langchain_core/tracers/core.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a53c48aaf7c9e32d5038b0ea872a840f98caa1c2e8a88fa455b4406b9a854b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/langchain/langchain_classic/retrievers/document_compressors/embeddings_filter.py:86-97 | libs/langchain/langchain_classic/retrievers/document_compressors/embeddings_filter.py:130-141 \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":"libs/langchain/langchain_classic/retrievers/document_compressors/embeddings_filter.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6c7923afbe17c9724c0fb46f1e6b7daf2411769ea1e05cc208f7c8b37b5b05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/partners/mistralai/langchain_mistralai/chat_models.py:911-921 | libs/partners/mistralai/langchain_mistralai/chat_models.py:942-951 \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 \u0060libs/partners/mistralai/langchain_mistralai/chat_models.py:911\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7db0400e47d9f7b5034bca527117cd0165d6eea0ea6288697e4f7acd9ede33b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): libs/core/langchain_core/utils/utils.py:233-241 | libs/partners/groq/langchain_groq/chat_models.py:512-520 | libs/partners/openai/langchain_openai/embeddings/base.py:352-361 | libs/partners/openrouter/langchain_openrouter/chat_models.py:383-391 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/langchain_core/utils/utils.py:233\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":"libs/core/langchain_core/utils/utils.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e9e336e373a177a7e12a681c63e40cf234edf893b46549839161226d3f5c29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): libs/langchain/langchain_classic/chains/loading.py:98-107 | libs/langchain/langchain_classic/chains/loading.py:366-375 | libs/langchain/langchain_classic/chains/loading.py:603-612 | libs/langchain/langchain_classic/chains/loading.py:635-644 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/langchain/langchain_classic/chains/loading.py:376\u0060 calls \u0060load_chain_from_config\u0060, \u0060load_chain\u0060, \u0060pop\u0060 and \u0060libs/langchain/langchain_classic/chains/loading.py:108\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":"libs/langchain/langchain_classic/chains/loading.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"057a27c9c30798ed46b087adf239779e234a9fa7aa05985d91b429a87c6b26a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): libs/partners/fireworks/langchain_fireworks/chat_models.py:603-612 | libs/partners/groq/langchain_groq/chat_models.py:1520-1529 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:294-303 \u2014 before extracting anything, compare \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py\u0060 and \u0060libs/partners/groq/langchain_groq/chat_models.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py:603\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"1405209ddb27c0d64cd02c366c2558c69bc4f4d394cfcdb0adb07d2e88c92cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/core/langchain_core/language_models/chat_model_stream.py:829-838 | libs/core/langchain_core/language_models/chat_model_stream.py:867-876 \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":"libs/core/langchain_core/language_models/chat_model_stream.py"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0ca10beae08643d9294940cd9e474b788ae047cbca58c38cfecf4cce7a1c14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:5254-5263 | libs/core/langchain_core/runnables/base.py:5482-5491 \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 \u0060libs/core/langchain_core/runnables/base.py:5254\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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":5254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bf8f07bd18afd0911f17473c138208d3e7f98009cdaf96eecf4962baf61a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/core/langchain_core/utils/aiter.py:218-227 | libs/core/langchain_core/utils/iter.py:145-154 \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":"libs/core/langchain_core/utils/aiter.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccc08304adff194eb588f362d3024cdb0f6986b5250b22f35b700da1053dc2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/core/langchain_core/vectorstores/in_memory.py:197-206 | libs/core/langchain_core/vectorstores/in_memory.py:230-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ids\u0060 to \u0060Sequence[str] | None = None\u0060 in one and \u0060list[str] | None = None\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":"libs/core/langchain_core/vectorstores/in_memory.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf75ad24b796995f0fd1ce7d6b0e118289e2cf87ade14df85571f7f6f237964e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/langchain/langchain_classic/chains/llm.py:136-145 | libs/langchain/langchain_classic/chains/llm.py:163-172 \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 \u0060libs/langchain/langchain_classic/chains/llm.py:136\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":"libs/langchain/langchain_classic/chains/llm.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e602f48f74e2260d65e03efaf5b08c6754beebc1d2e592b2981c0a96c6276f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): libs/langchain/langchain_classic/chains/llm_math/base.py:234-243 | libs/langchain/langchain_classic/chains/llm_math/base.py:258-266 \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":"libs/langchain/langchain_classic/chains/llm_math/base.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4011463f0d2f0117c6b091b1f8d4285d1887ff353dd2d0c6ba0e4ca2bf8bf5f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/partners/anthropic/langchain_anthropic/chat_models.py:1683-1692 | libs/partners/mistralai/langchain_mistralai/chat_models.py:704-713 \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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84895a862e1b3cf2959c16a8b469941f0b9d8af8c47f6449f686f72259de031"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:443-452 | libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:493-502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:441\u0060 calls \u0060get\u0060 and \u0060libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py:491\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":"libs/partners/anthropic/langchain_anthropic/middleware/anthropic_tools.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e448cfde919d14d3517455089d1eaeb4459b5a51af38e60ae1894f6932ab488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/partners/fireworks/langchain_fireworks/_compat.py:17-26 | libs/partners/openai/langchain_openai/chat_models/_compat.py:182-193 \u2014 before extracting anything, compare \u0060libs/partners/fireworks/langchain_fireworks/_compat.py\u0060 and \u0060libs/partners/openai/langchain_openai/chat_models/_compat.py\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/partners/openai/langchain_openai/chat_models/_compat.py:181\u0060 calls \u0060get\u0060 and \u0060libs/partners/fireworks/langchain_fireworks/_compat.py:17\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":"libs/partners/fireworks/langchain_fireworks/_compat.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f759ca7c7770db822ed88d05cb0cd2167f83560cda4dc296aa6feddc26aa80ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/partners/openai/langchain_openai/embeddings/base.py:746-755 | libs/partners/openai/langchain_openai/embeddings/base.py:781-790 \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 \u0060libs/partners/openai/langchain_openai/embeddings/base.py:746\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/embeddings/base.py"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e21d74b6f80af879a02651cfb6697f74bf84b288d6c2f96a9c924897e779137"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/partners/perplexity/langchain_perplexity/chat_models.py:1446-1455 | libs/partners/perplexity/langchain_perplexity/chat_models.py:1513-1522 \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":"libs/partners/perplexity/langchain_perplexity/chat_models.py"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2342bfde4ca1bfa4e233c8694b22909fca8b6af5b9204428a8fdee13be3124b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): libs/core/langchain_core/language_models/chat_models.py:530-537 | libs/core/langchain_core/language_models/chat_models.py:553-561 | libs/core/langchain_core/language_models/llms.py:385-393 | libs/core/langchain_core/language_models/llms.py:409-417 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/langchain_core/language_models/chat_models.py:553\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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"33562eae123312a641d854e44048547a8aae6ac9732075fb4ffaa748f7a88ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): libs/langchain/langchain_classic/agents/agent.py:206-214 | libs/langchain/langchain_classic/agents/agent.py:346-354 | libs/langchain/langchain_classic/chains/base.py:789-797 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/langchain/langchain_classic/agents/agent.py:344\u0060 calls \u0060mkdir\u0060 and \u0060libs/langchain/langchain_classic/agents/agent.py:204\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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce662f568dac0c83b1522e38d608ada1996586741d71f49e71bc605a51a2e469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/core/langchain_core/messages/block_translators/anthropic.py:399-407 | libs/core/langchain_core/messages/block_translators/anthropic.py:450-458 \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":"libs/core/langchain_core/messages/block_translators/anthropic.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fc1b1fddbbb56f890a18c83b07a5a99c7a2c263bb7d329bdad8e96e951df54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/core/langchain_core/runnables/base.py:2345-2353 | libs/core/langchain_core/runnables/base.py:2395-2403 \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 \u0060libs/core/langchain_core/runnables/base.py:2345\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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":2345}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d58180de63d693284df884df84f5be6991b83c3bef1d995e3aedfa1cf29a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/langchain/langchain_classic/agents/openai_assistant/base.py:605-613 | libs/langchain/langchain_classic/agents/openai_assistant/base.py:762-770 \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 \u0060libs/langchain/langchain_classic/agents/openai_assistant/base.py:605\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"378b58556c7e38a1316a7593dbe79946e1dc779e6237c66fea7544acc9662495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/langchain/langchain_classic/chains/combine_documents/map_reduce.py:238-246 | libs/langchain/langchain_classic/chains/combine_documents/map_reduce.py:272-280 \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 \u0060libs/langchain/langchain_classic/chains/combine_documents/map_reduce.py:238\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":"libs/langchain/langchain_classic/chains/combine_documents/map_reduce.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"341b0aaf2d1cf2883716386105cfb5b1788d6746402ced43b9652c308f114ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/langchain/langchain_classic/chains/combine_documents/reduce.py:338-346 | libs/langchain/langchain_classic/chains/combine_documents/reduce.py:377-385 \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 \u0060libs/langchain/langchain_classic/chains/combine_documents/reduce.py:338\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":"libs/langchain/langchain_classic/chains/combine_documents/reduce.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cf8b47ecbae2cdf94352039b6eb645b18d807183fc5de6cc827e3a9470ebbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/langchain/langchain_classic/chains/qa_with_sources/loading.py:153-161 | libs/langchain/langchain_classic/chains/summarize/chain.py:183-191 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chains/qa_with_sources/loading.py\u0060 and \u0060libs/langchain/langchain_classic/chains/summarize/chain.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/langchain/langchain_classic/chains/qa_with_sources/loading.py:153\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":"libs/langchain/langchain_classic/chains/qa_with_sources/loading.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05899cf56b90429d4d227ae4037a343194eeb40a909eed016c3c07dffff80bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/langchain/langchain_classic/evaluation/criteria/eval_chain.py:371-379 | libs/langchain/langchain_classic/evaluation/criteria/eval_chain.py:585-593 \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":"libs/langchain/langchain_classic/evaluation/criteria/eval_chain.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ff3856000257eb86964c9049009ee8ab47f98c8cded52e72ef3a780c3e3447"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/partners/fireworks/langchain_fireworks/_compat.py:9-17 | libs/partners/openai/langchain_openai/chat_models/_compat.py:170-178 \u2014 before extracting anything, compare \u0060libs/partners/fireworks/langchain_fireworks/_compat.py\u0060 and \u0060libs/partners/openai/langchain_openai/chat_models/_compat.py\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"libs/partners/fireworks/langchain_fireworks/_compat.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e108bb065d599274a598d8036ec78cd89971104f64ef1ffc3cb23dc69e14024"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/partners/openai/langchain_openai/chat_models/base.py:4532-4540 | libs/partners/openai/langchain_openai/chat_models/base.py:4582-4590 \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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":4532}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b276d318ac307b3c765176eb5d2709d05c05adfd3d09d3b0b9e264a97fa191b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): libs/partners/fireworks/langchain_fireworks/chat_models.py:1329-1336 | libs/partners/groq/langchain_groq/chat_models.py:628-635 | libs/partners/openai/langchain_openai/chat_models/base.py:2359-2366 | libs/partners/openrouter/langchain_openrouter/chat_models.py:542-549 \u2014 before extracting anything, compare \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py\u0060 and \u0060libs/partners/groq/langchain_groq/chat_models.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cc9b770e06f96b827f74950fd9788b9886ce6057cad8a4ff290d9855215eca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): libs/core/langchain_core/callbacks/base.py:1041-1048 | libs/core/langchain_core/callbacks/manager.py:1748-1755 | libs/core/langchain_core/callbacks/manager.py:2276-2283 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/langchain_core/callbacks/base.py:1041\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":"libs/core/langchain_core/callbacks/base.py"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8465fdce7ba3f2a73986fd2932a8b49a6bc7cd4e1dfccdfaee0c9a4c054cba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/langchain/langchain_classic/agents/openai_assistant/base.py:595-602 | libs/langchain/langchain_classic/agents/openai_assistant/base.py:752-759 \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":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"35725764a046e6ca626bcfc1e43b0103723ba22cc1fc10b6d03eceefd033659a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/langchain/langchain_classic/chains/base.py:137-144 | libs/langchain/langchain_classic/chains/base.py:193-200 \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":"libs/langchain/langchain_classic/chains/base.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b033d5b1528bdd7145d80b003deee93648127452b13b4a77553f13c451e18d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/langchain/langchain_classic/chains/conversational_retrieval/base.py:169-176 | libs/langchain/langchain_classic/chains/conversational_retrieval/base.py:226-233 \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":"libs/langchain/langchain_classic/chains/conversational_retrieval/base.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"087911ec4450faea781fb61a2f58f64d8ecf8ddc5098932a20d03d49584007bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/langchain/langchain_classic/memory/summary_buffer.py:116-123 | libs/langchain/langchain_classic/memory/summary_buffer.py:130-137 \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":"libs/langchain/langchain_classic/memory/summary_buffer.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9627b28577946fb206949696a859327c9b5c2c3331b003d5a4c7fa2f38acc38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/langchain/langchain_classic/retrievers/ensemble.py:115-122 | libs/langchain/langchain_classic/retrievers/ensemble.py:152-159 \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 \u0060libs/langchain/langchain_classic/retrievers/ensemble.py:115\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":"libs/langchain/langchain_classic/retrievers/ensemble.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3340e035725d466548d2fdbe2af034f802b6ebb6bca2429a75c8c64c1045cfc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/langchain/langchain_classic/retrievers/merger_retriever.py:77-84 | libs/langchain/langchain_classic/retrievers/merger_retriever.py:112-119 \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":"libs/langchain/langchain_classic/retrievers/merger_retriever.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2610482f714817253661102b53b183d86ca4eaaa8804220a6e7fbb4122da8fee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/langchain_v1/langchain/agents/factory.py:351-358 | libs/langchain_v1/langchain/agents/factory.py:442-449 \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":"libs/langchain_v1/langchain/agents/factory.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ac8d3909b179688e8f9a8bb9ab3b28da76cab7e8b1de6a85b002b74df30a30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/partners/anthropic/langchain_anthropic/chat_models.py:1688-1695 | libs/partners/fireworks/langchain_fireworks/chat_models.py:1334-1341 \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 \u0060libs/partners/anthropic/langchain_anthropic/chat_models.py:1688\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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"da55e31dd67f6be6bd49a2dcd29947bfea64274a638d21df0727cf42166d4d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:198-205 | libs/partners/openai/langchain_openai/chat_models/base.py:234-243 \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":"libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b5104a2863a70a37fc786a103fe469e7ea043c5430e8f26c8f21f9a39627c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/partners/openrouter/langchain_openrouter/chat_models.py:599-606 | libs/partners/openrouter/langchain_openrouter/chat_models.py:689-696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openrouter/langchain_openrouter/chat_models.py"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f1da3b18b1aecfc63417f154537c629225eae715a9a3dc7e51e64a99081350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/core/langchain_core/language_models/_compat_bridge.py:313-319 | libs/core/langchain_core/language_models/_compat_bridge.py:326-332 | libs/core/langchain_core/language_models/_compat_bridge.py:341-347 \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 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":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6765c4bc2bb3dc7a606ce8910bb126f92ace390c25a6b45626d02636a58ecc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/partners/groq/langchain_groq/chat_models.py:1543-1549 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:195-201 | libs/partners/openrouter/langchain_openrouter/chat_models.py:1361-1367 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/partners/groq/langchain_groq/chat_models.py:1542\u0060 calls \u0060get\u0060 and \u0060libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:192\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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f38d0b8890550a437df01cfb8ec61519f9cbc24417cf00049b1eb5ed5816d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/core/langchain_core/_security/_transport.py:62-70 | libs/core/langchain_core/_security/_transport.py:148-154 \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":"libs/core/langchain_core/_security/_transport.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6244b07be058385678ccd0f82dcec7140a509c9b1dba4d6e7e7648fa31326e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/core/langchain_core/language_models/chat_models.py:1744-1750 | libs/core/langchain_core/language_models/chat_models.py:1890-1896 \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"e717b3096cf2f1019e052ce213fbca796deb7bc2d68b13e598f923e1bf3b9270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/core/langchain_core/language_models/llms.py:1427-1435 | libs/core/langchain_core/prompts/base.py:421-429 \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":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afa0d32c19516f830479d2dfe59ff58f802d866c2abfb74ea240f7baae5b488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/core/langchain_core/prompts/chat.py:600-606 | libs/core/langchain_core/prompts/chat.py:631-637 \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":"libs/core/langchain_core/prompts/chat.py"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f38429834d821293e88884eea3bc43e88eaf274a5ed5155585808c3cffb5cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/langchain/langchain_classic/chains/combine_documents/reduce.py:89-96 | libs/langchain/langchain_classic/chains/combine_documents/reduce.py:121-128 \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":"libs/langchain/langchain_classic/chains/combine_documents/reduce.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc5b4962affde36a17e0ed44fc20af4ec1e1c2bc66c4c4156a83acbb001a2f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/core/langchain_core/vectorstores/utils.py:144-149 | libs/partners/chroma/langchain_chroma/vectorstores.py:133-138 | libs/partners/qdrant/langchain_qdrant/_utils.py:20-25 \u2014 before extracting anything, compare \u0060libs/partners/chroma/langchain_chroma/vectorstores.py\u0060 and \u0060libs/partners/qdrant/langchain_qdrant/_utils.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 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":"libs/core/langchain_core/vectorstores/utils.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9795408defb57de966a1631ca10e56d8091bca340c951ffd381b82f2dac3268d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/partners/qdrant/langchain_qdrant/qdrant.py:1045-1051 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:2204-2210 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:2245-2251 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bd5cfbab7d2bd3307cbd03821adbd80995abc4ddc71ae9caf007a1e05d03c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:731-738 | libs/langchain_v1/langchain/chat_models/base.py:726-731 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/langchain/langchain_classic/chat_models/base.py:731\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"3100a3946b7948fd9e3ac89976960a3da4e32ecf82151f853997f41b108f7062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/model-profiles/langchain_model_profiles/cli.py:78-83 | libs/model-profiles/langchain_model_profiles/cli.py:340-345 \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":"libs/model-profiles/langchain_model_profiles/cli.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"be24ebc921a3b5072447a37930fa475685268c63324084adc5ec02bc326b7807"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/partners/anthropic/langchain_anthropic/_compat.py:28-33 | libs/partners/anthropic/langchain_anthropic/_compat.py:73-78 \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, \u0060libs/partners/anthropic/langchain_anthropic/_compat.py:35\u0060 calls \u0060get\u0060 and \u0060libs/partners/anthropic/langchain_anthropic/_compat.py:80\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":"libs/partners/anthropic/langchain_anthropic/_compat.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f896e003327a7da1eb02908c729bec738c9840abbb5c25d705a565882513e46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): libs/core/langchain_core/_api/__init__.py:61-87 | libs/core/langchain_core/vectorstores/__init__.py:27-53 \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":"libs/core/langchain_core/_api/__init__.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1c5be10c4e58bb2b57fa58919d8700e577c943f3f5d8cb54a8861aba5ddd63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 16): libs/core/langchain_core/callbacks/__init__.py:125-132 | libs/core/langchain_core/decisions/__init__.py:70-77 | libs/core/langchain_core/document_loaders/__init__.py:32-39 | libs/core/langchain_core/documents/__init__.py:48-55 | libs/core/langchain_core/embeddings/__init__.py:24-31 | libs/core/langchain_core/example_selectors/__init__.py:40-47 | libs/core/langchain_core/indexing/__init__.py:46-53 | libs/core/langchain_core/language_models/__init__.py:109-116 | libs/core/langchain_core/load/__init__.py:37-44 | libs/core/langchain_core/messages/__init__.py:205-212 | libs/core/langchain_core/outputs/__init__.py:59-66 | libs/core/langchain_core/prompts/__init__.py:94-101 | libs/core/langchain_core/runnables/__init__.py:129-136 | libs/core/langchain_core/tools/__init__.py:88-95 | libs/core/langchain_core/tracers/__init__.py:43-50 | libs/core/langchain_core/utils/__init__.py:104-111 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 16 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 16 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/callbacks/__init__.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"010c2d6fd88a16aa8f6a1469e78df3e0561773391f7fde089905bf34e2a9f62b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/core/langchain_core/messages/human.py:37-60 | libs/core/langchain_core/messages/system.py:37-60 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/core/langchain_core/messages/human.py:37\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":"libs/core/langchain_core/messages/human.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d319af8c9268cd723b1abfa73f100fc0362b38a0fbbcc2c5d955bd6a8c9b3636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): libs/core/langchain_core/messages/block_translators/anthropic.py:14-26 | libs/core/langchain_core/messages/block_translators/bedrock_converse.py:18-30 | libs/core/langchain_core/messages/block_translators/groq.py:15-27 \u2014 before extracting anything, compare \u0060libs/core/langchain_core/messages/block_translators/anthropic.py\u0060 and \u0060libs/core/langchain_core/messages/block_translators/bedrock_converse.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 104 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":"libs/core/langchain_core/messages/block_translators/anthropic.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b8724da83d5826709b6525501fb2c45d51492ad3ee82298b1b489b6189dc38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/core/langchain_core/prompts/few_shot.py:56-79 | libs/core/langchain_core/prompts/few_shot_with_templates.py:66-77 \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":"libs/core/langchain_core/prompts/few_shot.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d3f801f261b0eb1f498d5f5a9adbf365b345d3cd65287538bc5714323ccd09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/core/langchain_core/tools/simple.py:51-55 | libs/core/langchain_core/tools/structured.py:121-125 \u2014 before extracting anything, compare \u0060libs/core/langchain_core/tools/simple.py\u0060 and \u0060libs/core/langchain_core/tools/structured.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 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":"libs/core/langchain_core/tools/simple.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3f650a59d791a4d658c973f3e33c37c3ece854ea09e98d93684d96ede520ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 5): libs/langchain/langchain_classic/agents/agent_toolkits/csv/__init__.py:5-20 | libs/langchain/langchain_classic/agents/agent_toolkits/pandas/__init__.py:5-20 | libs/langchain/langchain_classic/agents/agent_toolkits/python/__init__.py:5-20 | libs/langchain/langchain_classic/agents/agent_toolkits/spark/__init__.py:5-20 | libs/langchain/langchain_classic/agents/agent_toolkits/xorbits/__init__.py:5-20 \u2014 \u0060libs/langchain/langchain_classic/agents/agent_toolkits/csv/__init__.py\u0060 and \u0060libs/langchain/langchain_classic/agents/agent_toolkits/pandas/__init__.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 16 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/agents/agent_toolkits/csv/__init__.py"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9544a285a9aba72d21eb9bef95ac15efa4e754c5e3e9372bbe1c50a8c05941f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/langchain/langchain_classic/agents/chat/base.py:56-66 | libs/langchain/langchain_classic/agents/structured_chat/base.py:61-71 \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. 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":"libs/langchain/langchain_classic/agents/chat/base.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e3ae4762193eaefd9b44a31d460892da89caa71631d3f4d254d61f7ce1495c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): libs/langchain/langchain_classic/agents/openai_functions_agent/base.py:218-245 | libs/langchain/langchain_classic/agents/openai_functions_multi_agent/base.py:271-298 \u2014 \u0060libs/langchain/langchain_classic/agents/openai_functions_agent/base.py\u0060 and \u0060libs/langchain/langchain_classic/agents/openai_functions_multi_agent/base.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 75 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"libs/langchain/langchain_classic/agents/openai_functions_agent/base.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a407c734113fdd7e4314288396b2abab5fd10b3cfb130355b19bbdc78b3d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): libs/langchain/langchain_classic/agents/openai_functions_agent/base.py:257-283 | libs/langchain/langchain_classic/agents/openai_functions_multi_agent/base.py:310-336 \u2014 \u0060libs/langchain/langchain_classic/agents/openai_functions_agent/base.py\u0060 and \u0060libs/langchain/langchain_classic/agents/openai_functions_multi_agent/base.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 75 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. 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":"libs/langchain/langchain_classic/agents/openai_functions_agent/base.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef13c90e9080383328582729276dcab35946e5fe53166820b0ecaed8e42422f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/langchain/langchain_classic/callbacks/streaming_aiter_final_only.py:20-25 | libs/langchain/langchain_classic/callbacks/streaming_stdout_final_only.py:21-26 \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":"libs/langchain/langchain_classic/callbacks/streaming_aiter_final_only.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4ffabb8deea0b8149e88259fd4064d18edfac6e7f84303bdc53dfa8f6bd48e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:721-725 | libs/langchain_v1/langchain/chat_models/base.py:716-720 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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 \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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07c21bd23edb8d914b33a848758a903f08374ace36cbb06443ec9b2fa276d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:1010-1023 | libs/langchain_v1/langchain/chat_models/base.py:1001-1014 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aca8ea9cdc28f222f72456dc74d526244b20e6f5f772b72961048bd6eda446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/langchain/langchain_classic/chat_models/base.py:1040-1052 | libs/langchain_v1/langchain/chat_models/base.py:1031-1043 \u2014 before extracting anything, compare \u0060libs/langchain/langchain_classic/chat_models/base.py\u0060 and \u0060libs/langchain_v1/langchain/chat_models/base.py\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 255 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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b8eae50ddcd85d1f3e03fa333d27c8ed7beb492cae9104dbae1f4cb5146afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): libs/langchain/langchain_classic/evaluation/embedding_distance/base.py:445-467 | libs/langchain/langchain_classic/evaluation/embedding_distance/base.py:599-621 | libs/langchain/langchain_classic/evaluation/string_distance/base.py:262-285 | libs/langchain/langchain_classic/evaluation/string_distance/base.py:396-417 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. 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":"libs/langchain/langchain_classic/evaluation/embedding_distance/base.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5737fb36f3dd85aa57c39feddc44de3cab5e37f643f54072a6de1e55a57162"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): libs/langchain/langchain_classic/evaluation/embedding_distance/base.py:481-503 | libs/langchain/langchain_classic/evaluation/embedding_distance/base.py:635-657 | libs/langchain/langchain_classic/evaluation/string_distance/base.py:300-322 | libs/langchain/langchain_classic/evaluation/string_distance/base.py:431-452 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. 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":"libs/langchain/langchain_classic/evaluation/embedding_distance/base.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"4961c2022473ee839daef4761b03f11e1e7694e0c563a2c253e213dc01bab109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/langchain/langchain_classic/memory/summary.py:151-160 | libs/langchain/langchain_classic/memory/summary_buffer.py:90-99 \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":"libs/langchain/langchain_classic/memory/summary.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd35826c2908dde83f530273d182c4c20ad1cb51bc974efa6fb19599808446a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/partners/anthropic/langchain_anthropic/_compat.py:10-16 | libs/partners/openai/langchain_openai/chat_models/_compat.py:79-85 \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. 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":"libs/partners/anthropic/langchain_anthropic/_compat.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8161c90cda7f671e1555662df07c4aaf2cf545e6d0e1ea4e332e8728ad4cfe18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/partners/anthropic/langchain_anthropic/chat_models.py:110-121 | libs/partners/openai/langchain_openai/chat_models/base.py:753-764 \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. 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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d4d9319ba7c7c9976b87e9a02bf285e232b31e532b3627a5a0a3b390e5c641"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): libs/partners/fireworks/langchain_fireworks/chat_models.py:1491-1495 | libs/partners/groq/langchain_groq/chat_models.py:880-884 | libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py:1230-1234 | libs/partners/openrouter/langchain_openrouter/chat_models.py:821-825 \u2014 before extracting anything, compare \u0060libs/partners/fireworks/langchain_fireworks/chat_models.py\u0060 and \u0060libs/partners/groq/langchain_groq/chat_models.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 104 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 \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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5e90831975d789dd86c51fab73f1bbff17047698affba08e4adf95ddcc09cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/partners/openai/langchain_openai/chat_models/azure.py:890-896 | libs/partners/openai/langchain_openai/chat_models/base.py:3874-3880 | libs/partners/xai/langchain_xai/chat_models.py:632-638 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/azure.py"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"747e8f351d38fd7b8a9d9c5fb7b5ffddf2988cf4828f116575333b16db970200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/partners/openai/langchain_openai/decisions/base.py:208-219 | libs/partners/openai/langchain_openai/decisions/classifier.py:229-240 \u2014 before extracting anything, compare \u0060libs/partners/openai/langchain_openai/decisions/base.py\u0060 and \u0060libs/partners/openai/langchain_openai/decisions/classifier.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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":"libs/partners/openai/langchain_openai/decisions/base.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0d2c6a0d9dcbf5f7702a05fa66ebe4d0e9067dabae17b1a30193b236ffc5f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/partners/openai/langchain_openai/decisions/base.py:223-228 | libs/partners/openai/langchain_openai/decisions/classifier.py:244-249 \u2014 before extracting anything, compare \u0060libs/partners/openai/langchain_openai/decisions/base.py\u0060 and \u0060libs/partners/openai/langchain_openai/decisions/classifier.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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":"libs/partners/openai/langchain_openai/decisions/base.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59b51a61a4529cb6970d3bbff8e4101a016854c02fd6812142d9e09e4267daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/qdrant.py:710-726 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:434-479 \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":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a684d19e347f67464f221e2eff09c08d4c011d462dfac5a4c50ca1ca222500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/qdrant.py:783-803 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:865-915 \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":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"519673947be5c73126b464c03ece34fa3b7334fcf37ea3c70fcf8a7df6aaab4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/qdrant.py:861-875 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:1151-1165 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ids\u0060 to \u0060list[str | int] | None = None\u0060 in one and \u0060list[str] | None = None\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":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d50c799e260f748215ff3c4d586d956f3be8cea72c554707882ff63655401cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/qdrant.py:1030-1036 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:2053-2059 \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":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"86394bd7b68c134c68274c0ec9d0cd3931cd5a0d6007ae61bfd94d7ae6fa6b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/qdrant.py:1080-1096 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:2027-2043 \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":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"c982cc9e9518a8a30028db3fa65cc57024331a72aa034fbab468b2fbb2b43047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): libs/core/langchain_core/output_parsers/base.py:357-361 | libs/core/langchain_core/prompts/base.py:363-374 | libs/langchain/langchain_classic/chains/base.py:736-757 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 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 3 times. 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":"libs/core/langchain_core/output_parsers/base.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac614ca9fa4bd4e27a381d71707b4688350630201fd60402651c4bed2023d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): libs/core/langchain_core/runnables/base.py:3876-3880 | libs/core/langchain_core/runnables/base.py:5557-5561 | libs/core/langchain_core/runnables/passthrough.py:342-346 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":3876}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66f0e2ab494b6bc8fd9b89e5073549ecd331cd086276cc9b9a2c740aa51940a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/langchain/langchain_classic/agents/loading.py:106-126 | libs/langchain/langchain_classic/chains/loading.py:703-711 \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. 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":"libs/langchain/langchain_classic/agents/loading.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"19585fda12be37d717d100a4e9574242e78a0a413778596bc25ace56262beea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/langchain/langchain_classic/agents/output_parsers/openai_tools.py:62-66 | libs/langchain/langchain_classic/agents/output_parsers/tools.py:107-111 \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":"libs/langchain/langchain_classic/agents/output_parsers/openai_tools.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4827434aadc0ca7707984f8c007a23f97c84da292798dc128177f4d62e658a08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/langchain/langchain_classic/chains/qa_with_sources/base.py:96-103 | libs/langchain/langchain_classic/chains/retrieval_qa/base.py:111-118 \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. 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":"libs/langchain/langchain_classic/chains/qa_with_sources/base.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"06df49ace8887bd77f53741d17e1f0697dd4ae8062395738e81c9e5c62d3b62e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/partners/openai/langchain_openai/chat_models/base.py:3817-3829 | libs/partners/openai/langchain_openai/llms/base.py:907-918 \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. 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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":3817}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e2cc09f65e2b7e9af031240ed0c551e217a34ddf5ac6331f11168c41e81c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/partners/qdrant/langchain_qdrant/qdrant.py:503-518 | libs/partners/qdrant/langchain_qdrant/vectorstores.py:154-180 \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":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"901de66b94b44b66a84529b44b1abbcfa093e962eaf3c4d7695b41b2d269e0f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/partners/chroma/langchain_chroma/vectorstores.py:100-106 | libs/partners/qdrant/langchain_qdrant/_utils.py:62-68 \u2014 before extracting anything, compare \u0060libs/partners/chroma/langchain_chroma/vectorstores.py\u0060 and \u0060libs/partners/qdrant/langchain_qdrant/_utils.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 61 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 \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":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d7434e0b847784ae6e20ca399d5d9856ee331f2347263f822b953181f096a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/partners/openai/langchain_openai/decisions/_classifier_input.py:205-211 | libs/partners/openai/langchain_openai/decisions/_input.py:88-94 \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":"libs/partners/openai/langchain_openai/decisions/_classifier_input.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5021a77c39a6403c55f45ac5e27ddc134c78a62988b467d601cf7eaa591fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/indexer.py:37-65 | libs/standard-tests/langchain_tests/integration_tests/indexer.py:227-255 \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":"libs/standard-tests/langchain_tests/integration_tests/indexer.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6461e794c91b1772128fe835c02c22e690f6733dfbc448db976cd631accf85"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:753-766 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:771-782 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:787-798 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:821-832 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfea1f77fd41742848afdcf949bd26e447057816fca21f7985f6dc22c5280e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2289-2365 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2373-2448 \u2014 These two members are one piece of code written twice and then edited apart: 76 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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":2289}}}],"partialFingerprints":{"codehealthFindingId/v1":"850e0c5fb4040975578907dcc8478472fb8b0d04fa750c08fe679d05e120aa52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2452-2521 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2599-2659 \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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed3d9c71b6cb0f8649651d5c2532db0774d4b95886034332c31287c2ae5fdde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1718-1739 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1770-1810 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1815-1855 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"49dc1b998489fa13d4831e9de6ceafc860a876eb090030d6189fc9252cc0eb90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1646-1724 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1727-1803 \u2014 These two members are one piece of code written twice and then edited apart: 77 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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"20903734853a6e47c23892fa94b48dbdbb4f079beb51a94a109476ffd7dcad31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:824-883 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:887-936 \u2014 These two members are one piece of code written twice and then edited apart: 50 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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b409ca6b1757fe0c5525209c97bb3152d864aa765388e8fd8332ff1fc76335"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1641-1661 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1666-1684 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4c6c7017c022d3663718973f0290565d917ee447634eb260beee392a591611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:524-545 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1949-1974 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bf7b9647378c7ef344f470058680a9f168c47747de6c4cd76af6fbcd6a9f2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1302-1319 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1535-1553 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1558-1576 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1620-1636 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71a57221dfe7286f582b6cfc27b30ef29c15280ef99ccb23150433de0a61831"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:888-902 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:907-924 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafa1d69d5fcccf6f8d47c71cb1a44f4b1be8fa97b460af93ecf3847ea79ae6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/indexer.py:135-158 | libs/standard-tests/langchain_tests/integration_tests/indexer.py:327-350 \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":"libs/standard-tests/langchain_tests/integration_tests/indexer.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f0d51d1e9b946091c0848260be3c2d3878a3902af787d07432263790f23c5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): libs/langchain_v1/examples/mcp/remote_server.py:21-40 | libs/langchain_v1/examples/mcp/tool_errors.py:22-41 \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":"libs/langchain_v1/examples/mcp/remote_server.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"539869bae1b47e94cedb47d3ea7419c9f8279071515b79407f428cc155887a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:165-176 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1860-1875 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6497df98d03e3b50568f8bd31be9e59a3b7b52ea46efb5c0e449d89b569760"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/indexer.py:68-91 | libs/standard-tests/langchain_tests/integration_tests/indexer.py:258-281 \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":"libs/standard-tests/langchain_tests/integration_tests/indexer.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4ace3f7de814266e0f382feb87fbba09f8d302830469873946511bee0bd536"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:981-997 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1002-1017 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a27c21c03bffa2e3a0e1ea1017733d277a16d29d6e9d34e53480afddb7eb6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/tools.py:13-43 | libs/standard-tests/langchain_tests/integration_tests/tools.py:46-70 \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":"libs/standard-tests/langchain_tests/integration_tests/tools.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5072d0238f89ddb9b7f6e16807347912791b7416aaee644dd13627503c384c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/embeddings.py:61-78 | libs/standard-tests/langchain_tests/integration_tests/embeddings.py:102-119 \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":"libs/standard-tests/langchain_tests/integration_tests/embeddings.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd736ea177e0f964d8c6f4c5ada65141e7ad219115849ae48fefa2288be3f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1172-1187 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1192-1207 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1212-1232 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1237-1250 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1255-1272 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3690d0ea45f1eabe758c651238b36e1b0dfe601f7d3d98bbba1e24cabf68a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:201-218 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1903-1923 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf723b1a220c40c712cce220877ac6ae2e37face0a32ebb1e455a6f1a80931e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/indexer.py:94-112 | libs/standard-tests/langchain_tests/integration_tests/indexer.py:284-304 \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":"libs/standard-tests/langchain_tests/integration_tests/indexer.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e284f2d6ab7dc056c58a7e52222d5b24039b6bfe882e0294d1c2854e0e2e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:803-816 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:870-883 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"80349e78a6fe57f5239c6dce83a2450dd56721ea20d13a43a8678b4134549033"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (84 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2960-3075 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:3078-3161 \u2014 These two members are one piece of code written twice and then edited apart: 84 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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"6137c4fe20c3dce4b2ab5e7194df72803cfc2000ecafab68145ae4d46a002e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:569-581 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:586-607 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af42c5258602e9f106c83429ff2c848a90b9043fd3eaf3579d1d21d96527563"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:308-322 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1054-1070 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1075-1093 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1131-1148 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1153-1167 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d3925966572c4d32942cfc6b7caf7868497859f8c0805e734ea3eae4d32529"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 25\u002B corresponding lines): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1003-1042 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1045-1069 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1072-1099 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1102-1129 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"f727ccd3871f05bd2e91ccae73c3f8b663e33c4347bf76eb247123c7310b2732"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:939-970 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:973-1000 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"8172184a392592657adc2e597831bac530181b32a33b87a1149a29e386f2354f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): libs/standard-tests/langchain_tests/unit_tests/chat_models.py:946-969 | libs/standard-tests/langchain_tests/unit_tests/embeddings.py:117-137 | libs/standard-tests/langchain_tests/unit_tests/tools.py:86-99 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/unit_tests/chat_models.py"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f28350840bd983e7944c07745ee4afab1876b66e7675c1ab018f65bf61a778"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/indexer.py:115-132 | libs/standard-tests/langchain_tests/integration_tests/indexer.py:307-324 \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":"libs/standard-tests/langchain_tests/integration_tests/indexer.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72f520af096f9c4d24dc8285f2355fe120ddc55a74d02cd2a7e13fbd56f4222"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:422-435 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:506-519 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"564303e18ba0804a9b7d5fc649f857e306e48ba07bcac565eddb20a3ec95f3fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): libs/standard-tests/langchain_tests/integration_tests/vectorstores.py:206-225 | libs/standard-tests/langchain_tests/integration_tests/vectorstores.py:228-247 | libs/standard-tests/langchain_tests/integration_tests/vectorstores.py:557-576 | libs/standard-tests/langchain_tests/integration_tests/vectorstores.py:581-600 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/integration_tests/vectorstores.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e4f1785fc6168722ab81a4482d86651cf77f371ccf79e9df140647e8054b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/base_store.py:153-162 | libs/standard-tests/langchain_tests/integration_tests/base_store.py:304-315 \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":"libs/standard-tests/langchain_tests/integration_tests/base_store.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f812adb837d73586d7f289dac923529e33535a43f1d84c7905f3996e63a4ac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:133-142 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:380-396 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:680-694 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b190a33893b4a6fbab30cabd7709882444849b200a563b92e3c2e893243d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1132-1157 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1160-1187 \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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3ab580b9b404128ee18614a7df47f784259b410dbdaac3134c82feb28158e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/base_store.py:111-117 | libs/standard-tests/langchain_tests/integration_tests/base_store.py:257-263 \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":"libs/standard-tests/langchain_tests/integration_tests/base_store.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5799af5e2877bf33f0922f4e0c61fc39e269260fa64318a73b46cff327800211"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/vectorstores.py:619-640 | libs/standard-tests/langchain_tests/integration_tests/vectorstores.py:645-681 \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":"libs/standard-tests/langchain_tests/integration_tests/vectorstores.py"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d86f18561aaefb95c66073fd89aee4746890c4d72762680dfef5d4ebfe96a03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): libs/core/langchain_core/example_selectors/semantic_similarity.py:288-319 | libs/core/langchain_core/example_selectors/semantic_similarity.py:335-366 \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":"libs/core/langchain_core/example_selectors/semantic_similarity.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae850a197f4f4484ca13420dbc2053a145cabd0e62b5fe874c7e3158b99520cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/vectorstores.py:329-367 | libs/standard-tests/langchain_tests/integration_tests/vectorstores.py:684-722 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"libs/standard-tests/langchain_tests/integration_tests/vectorstores.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a009339c9e12808e1a00afccbfe53194a59b0336eb80d80c0db6ae89912ee18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/vectorstores.py:266-287 | libs/standard-tests/langchain_tests/integration_tests/vectorstores.py:290-326 \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":"libs/standard-tests/langchain_tests/integration_tests/vectorstores.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7feeaed5d5d0eb5e1d45641294a6cb73a92940e1395352eea3fded7ce249e61b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/standard-tests/langchain_tests/integration_tests/base_store.py:227-233 | libs/standard-tests/langchain_tests/integration_tests/base_store.py:287-297 \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":"libs/standard-tests/langchain_tests/integration_tests/base_store.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9b7e8d74787439821e539ef6084d773790d028824c91796d96740f0db96014"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): libs/standard-tests/langchain_tests/integration_tests/base_store.py:94-99 | libs/standard-tests/langchain_tests/integration_tests/base_store.py:136-146 | libs/standard-tests/langchain_tests/integration_tests/base_store.py:240-245 \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":"libs/standard-tests/langchain_tests/integration_tests/base_store.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ee9bf31277cc828ae8c81fa4946a9b78b8fa13d05dcab2c66ec136c487284c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:864-883 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:917-936 \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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4b770f1b6e7f4ddcede41a762ac24aa88fe54c03f2e6dc8960e8ab2c4d749d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2332-2349 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2414-2431 \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 \u0060libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2332\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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":2332}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcd798c8be80c1dc4162a669f5d58fe027b11dcd36da822effc197de2ed3672"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1772-1788 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1817-1833 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4ca2a02f0c97e0fcf24ff6315c0c5408bb71df1f4288e934d098379187c0e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/indexer.py:50-65 | libs/standard-tests/langchain_tests/integration_tests/indexer.py:240-255 \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":"libs/standard-tests/langchain_tests/integration_tests/indexer.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5762306069da0b36b873713786c868fe60293f3dd57f2cc84a89376057ae2fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2351-2364 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2433-2447 \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 \u0060libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2351\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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6911a39906d0044ebd0e44d1d28cbd2446ed003389fe798ab72db8f85a7970"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1880-1894 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1903-1917 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd899d73f945c6b8f51a39de078021defaa2c7aceeb06dab4d574b543a95d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1356-1369 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1563-1574 \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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeaaca4f7de1ddda9c83e185fd3f6a36db58def43adcd3b3d03cfa24c2995068"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1406-1419 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1422-1435 \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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":1406}}}],"partialFingerprints":{"codehealthFindingId/v1":"408f9134c1c12394300e9bae8838e58e73330ccca5e7690826c40847f681297c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1712-1724 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1791-1803 \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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"766858c28d02fb8a61c1f060dd83d3415e15ea476d581286d05842c994266d6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1648-1660 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1672-1684 \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, \u0060libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1647\u0060 calls \u0060write\u0060 and \u0060libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1671\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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab42d2cdce4a72fc70a053760facb333d49703508716ffd820875f1fddf5f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1689-1701 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1744-1756 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"9491620eb0f2e456d0672fc7fbedde5a205a1a70aea0c8042af04a2aeb782cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:755-766 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:773-782 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:789-798 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"a224a886156973e7463d83eba3c932c457a209e79842519453a4c979a9f41815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:181-192 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:201-212 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"400431f68c7fdbb64c79a7d1576ee26df1acd5c54074cd2ef2274da1153fae02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2336-2345 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2356-2365 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2418-2427 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:2438-2448 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c47cf7a4a0c1fcd165edac8ea45df5e3cd5d865f24d8ea5d177fbf7d93e53c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:753-765 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:771-781 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:787-797 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:821-831 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a51426ce2e5ec01ed9ecde9cc2797b24b7e438ebf91f8f07f93879ed122d12d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1089-1099 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1119-1129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa07368158c9a64267a65b3570cf6ea4255af0e2add7f4dbc9d7164f2af94e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:893-902 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:913-923 \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 \u0060libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:913\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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"11247fc558e7f6bc1f88273de7cc1b41fecff7e8d80e23295a33dbd692153e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1373-1382 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1384-1393 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1395-1404 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f59ece3be0236457cdfd356e8337b0f22665afc429a57f968dff4e4577fe808"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1541-1549 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1565-1574 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1626-1634 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1565\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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"58133aefdca3871e83a8e361d404c93650d67186c9c0fde29abd48a2d47778dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:966-975 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:981-990 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8636c71921bfd6c47c7b33fabf1c59b5801dc1fdfecac8fa32c57ae80b95916"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1726-1737 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1833-1844 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"852b59859b04e539bde7d59b301624a0f17e05dc06e5625fabaaca1b50f18211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): libs/langchain_v1/examples/mcp/multi_server.py:37-43 | libs/langchain_v1/examples/mcp/protocol_eras.py:50-58 \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 \u0060libs/langchain_v1/examples/mcp/protocol_eras.py:50\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":"libs/langchain_v1/examples/mcp/multi_server.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e905ee7a319e424c7aba01758f68ee5c5b36908995e86de38155e12e810b3535"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1558-1566 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1597-1605 \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, \u0060libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1567\u0060 calls \u0060write\u0060 and \u0060libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1607\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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2ba240496ac2fd19dfed79e70fffb9a91124186f847074dafb017dd110295d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1867-1875 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1890-1898 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3f413a09caa066ff23a45b2f0535a064c688f41e1b565c27606ec89d3f3857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1192-1199 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1255-1262 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1302-1309 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1324-1331 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1535-1542 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1620-1627 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1641-1648 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1666-1673 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1263\u0060 calls \u0060write\u0060 and \u0060libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1201\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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8e13b6eaf2e87b55288d802554c57a7ba805e51d012a312ad906545b169e3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/langchain_v1/examples/mcp/destructive_interrupt.py:64-72 | libs/langchain_v1/examples/mcp/elicitation.py:34-41 \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 \u0060libs/langchain_v1/examples/mcp/destructive_interrupt.py:64\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/examples/mcp/destructive_interrupt.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4095c7bf24f96a6e3eb8d0364410a6757c8916d63165ce467334d8e9a3ff9df0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1150-1157 | libs/standard-tests/langchain_tests/integration_tests/chat_models.py:1180-1187 \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":"libs/standard-tests/langchain_tests/integration_tests/chat_models.py"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5a5c5cf3cd08db9347f05c59b086025ae758c24925039c11252c322e379071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:170-176 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:189-196 \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":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8095d05c04258d447e740a3de62fc90e44c0b278c233c21d4ea12fae64ea2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:870-876 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:888-894 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:907-915 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"1889c39a29f7bdc575bc447e1192fa906b5f0d8623e5e1a74ed0979316c884b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1734-1739 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1796-1801 | libs/standard-tests/langchain_tests/integration_tests/sandboxes.py:1841-1846 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/langchain_tests/integration_tests/sandboxes.py"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c164ac261252b0eb6f3e5ee3be373bfd8a21dfa2bc8059a1dab8d93e07e5033"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/standard-tests/langchain_tests/integration_tests/embeddings.py:74-78 | libs/standard-tests/langchain_tests/integration_tests/embeddings.py:115-119 \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":"libs/standard-tests/langchain_tests/integration_tests/embeddings.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9f9c25ba110d99b82e6f090b03061e549ca37edb2ee2527ea074ddc7fc0afc"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: langchain-core: langchain-core: abstractness 0.13, instability 0.00, distance 0.87 \u2014 zone of pain \u2014 concrete and depended on by 20 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aea0468d68850b9e00e5d6d98c432dba2440fb83b53652e9ed77762d11db78b1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ChatXAI (LCOM4 10): ChatXAI\u0027s methods fall into 10 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 10 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":"libs/partners/xai/langchain_xai/chat_models.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83eb40fad8aabd97a24b5753d28bdd580fa3daaa86dffdbe936ae8f98a56c40"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ChatDeepSeek (LCOM4 8): ChatDeepSeek\u0027s methods fall into 8 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 8 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":"libs/partners/deepseek/langchain_deepseek/chat_models.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"619f6724cdb6a2548e9b4e71461a2e1d148cedf589cbc5b214e4b6f0642c8a53"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VectorStore (LCOM4 6): VectorStore\u0027s methods fall into 6 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 6 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":"libs/core/langchain_core/vectorstores/base.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2646b428deb4bca4f6a481368200098557267aea6854f499564a046e6f1c2a95"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BaseTool (LCOM4 5): BaseTool\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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6416e8cec743cb20410f2d13eee19f714c448611edbf66aadf3468f329958f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ChatModelUnitTests (LCOM4 5): ChatModelUnitTests\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":"libs/standard-tests/langchain_tests/unit_tests/chat_models.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ef18d60cb25242ae06a4de11c4c2b814270f1f9b463b7b2f9add2bf2d7ea4c"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: test_tool_calling: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022Retry flaky tool calling behavior\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/groq/tests/integration_tests/test_standard.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebf19533679d52d80548f4b9f694ad6e9cdb6f9fe29b921e2eb7a1fc4bdad0f"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: test_tool_choice: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022Retry flaky tool choice behavior\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/groq/tests/integration_tests/test_standard.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f469043712ca78e8be4b08fb391b74823c7d15087da36c24f3214f48a5712e"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: test_tool_calling_async: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022Retry flaky tool calling behavior\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/groq/tests/integration_tests/test_standard.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8336f919eedfacc23c923b7286eec0d963b74232821b9d8cc8d2cb839d01bf"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: test_tool_calling_with_no_arguments: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022Retry flaky tool calling behavior\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/groq/tests/integration_tests/test_standard.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4bf71d183a42c1588a2af085f5ca4f2c7b5f4b4c0c5e4ee49f41fde8bc7af0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/partners/anthropic/langchain_anthropic/chat_models.py: libs/partners/anthropic/langchain_anthropic/chat_models.py changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in chat_models._format_messages at line 716. 10 of those changes were fix/bug commits, and the other 11 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/partners/anthropic/langchain_anthropic/chat_models.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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb32eac98c832c82d1ac5666b8dd94e25dc81913d1f6d79c483a679953621f68"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/partners/openai/langchain_openai/chat_models/base.py: libs/partners/openai/langchain_openai/chat_models/base.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in base._construct_responses_api_input at line 4938. 7 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/partners/openai/langchain_openai/chat_models/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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":4938}}}],"partialFingerprints":{"codehealthFindingId/v1":"b608bd0c3f84a13ea2fb7357bed8dd6d49c8f11cd82db04958e031bc9df19ae2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/langchain_v1/langchain/agents/factory.py: libs/langchain_v1/langchain/agents/factory.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in factory.create_agent at line 895. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/langchain_v1/langchain/agents/factory.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":"libs/langchain_v1/langchain/agents/factory.py"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d192eaaf99f88233a83d40f1ca27ddf0246dcb1afee6fbef3701d99bbea67d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/partners/anthropic/langchain_anthropic/_compat.py: libs/partners/anthropic/langchain_anthropic/_compat.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in _compat._convert_from_v1_to_anthropic at line 106. 4 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/partners/anthropic/langchain_anthropic/_compat.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":"libs/partners/anthropic/langchain_anthropic/_compat.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"678a2c3ee12440c0782d95406d60eb6e89d6ef6883d98775d51c29bb0301e2f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/partners/fireworks/langchain_fireworks/chat_models.py: libs/partners/fireworks/langchain_fireworks/chat_models.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ChatFireworks._stream at line 1385. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/partners/fireworks/langchain_fireworks/chat_models.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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"7951ec3e3b31aa65809f202bfdf37614e6308a479d0eb5a457fc39cbd2c6b5d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/core/langchain_core/language_models/chat_models.py: libs/core/langchain_core/language_models/chat_models.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in BaseChatModel._generate_with_cache at line 1935. 2 of those changes were fix/bug commits, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/core/langchain_core/language_models/chat_models.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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ae793decf1eeea6e28a6d12de1c2eab75e551f7ab810d03c2cf21104c5741d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/partners/openai/langchain_openai/chat_models/_compat.py: libs/partners/openai/langchain_openai/chat_models/_compat.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in _compat._convert_from_v1_to_responses at line 437. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/partners/openai/langchain_openai/chat_models/_compat.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":"libs/partners/openai/langchain_openai/chat_models/_compat.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f784ab1a831dbcebc888db250c9deca166f325b0974515b6fa3ce064424d742"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/partners/openai/langchain_openai/chat_models/azure.py: libs/partners/openai/langchain_openai/chat_models/azure.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in AzureChatOpenAI.validate_environment at line 627. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/partners/openai/langchain_openai/chat_models/azure.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":"libs/partners/openai/langchain_openai/chat_models/azure.py"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99805036a9adc75e89c9dec004ac4c646a0d5bc8f1bff43cb7f7e72825af6f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/partners/huggingface/langchain_huggingface/llms/huggingface_pipeline.py: libs/partners/huggingface/langchain_huggingface/llms/huggingface_pipeline.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in HuggingFacePipeline.from_model_id at line 113. 1 of those changes was a fix/bug commit, 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/partners/huggingface/langchain_huggingface/llms/huggingface_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":"libs/partners/huggingface/langchain_huggingface/llms/huggingface_pipeline.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8f808113fedb8611f197c7ba09edff0da7630a1dd68378dfd2dae52b13ddcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.py: libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in HumanInTheLoopMiddleware.after_model at line 760. 3 of those changes were fix/bug commits, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.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":"libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.py"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8e3776310fdf246a6a403eb80b729007d2124d8cd5c5734f421725526a89c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/core/langchain_core/tools/base.py: libs/core/langchain_core/tools/base.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BaseTool.arun at line 1138. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/core/langchain_core/tools/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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7816e094f41330cae751626ae783760d1028d661b5273febac66d19cc2626e3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/core/langchain_core/utils/function_calling.py: libs/core/langchain_core/utils/function_calling.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in function_calling.convert_to_openai_function at line 377. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/core/langchain_core/utils/function_calling.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":"libs/core/langchain_core/utils/function_calling.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"1266c6b2381c81b62fa549766e605be001e20bf8f915f8f9360ab29294077cc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/core/langchain_core/language_models/_compat_bridge.py: libs/core/langchain_core/language_models/_compat_bridge.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in _compat_bridge.chunks_to_events at line 586. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 00:43:30 \u002B00:00\u0027 --until=\u00272026-11-14 00:43:30 \u002B00:00\u0027 --full-history --no-merges -- libs/core/langchain_core/language_models/_compat_bridge.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":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40f51426458e46acc42049dff2c6de02eb6ebabffe457b3fbab27fdf88a0f40"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: libs/model-profiles/langchain_model_profiles/_summary.py, libs/partners/fireworks/langchain_fireworks/middleware/prompt_caching.py, libs/standard-tests/langchain_tests/_langsmith_plugin.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ac31eca9d8e814978fa5cf2cb61eb7423c3dc0eb9c368bfde8a8f2ec9daf706c"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 4 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 (7 single-owned of 446 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; 446 of the 1766 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (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: libs/partners/typesafe/langchain_typesafe/client.py, libs/langchain_v1/langchain/agents/_subagent_transformer.py, libs/langchain_v1/langchain/agents/middleware/tool_error.py, libs/langchain_v1/langchain/agents/middleware/internal_call_transformer.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO, API regressed for some reason after 2025-04-15 \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":"libs/partners/perplexity/tests/integration_tests/test_chat_models_standard.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cbaca8f05fe2f12e260544cf39c9ce137fa54ff8f3625b6c6cd09c98fd47cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove OPENAI_API_KEY support to avoid possible conflict when using \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":"libs/partners/openai/langchain_openai/llms/azure.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9699f2eb0739b79a1e9795b197011fc93b9f7768286310e21c022b926af07a0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove OPENAI_API_KEY support to avoid possible conflict when using \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":"libs/partners/openai/langchain_openai/embeddings/azure.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"773295e782ea2c295f4d8cbc4a9102dbd648a1d54b83af34b2716114d23168cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove OPENAI_API_KEY support to avoid possible conflict when using \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":"libs/partners/openai/langchain_openai/chat_models/azure.py"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"3780cf7b33ec99e471a034f09de87ee0c60bda1476cf705c557416cb28f816a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: write a unit test for this \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":"libs/partners/openai/langchain_openai/llms/base.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e1268302f23b62e2ee13e07ba851d210bb8103a892654752a3aea5d5cbf40d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Move to AzureOpenAIEmbeddings. \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":"libs/partners/openai/langchain_openai/embeddings/base.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d756462db39826c3cbd160752e6025df6ca8d4f8aa6544f03a4367036ea300"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(someday): support non asyncio runtimes here \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":"libs/partners/openai/langchain_openai/chat_models/_client_utils.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bfe771dccc0c4c5db2d7735405d44c42fadab746c2b73e8f428dff1b91ffbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(someday): support non asyncio runtimes here \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":"libs/partners/anthropic/langchain_anthropic/_client_utils.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f3ccad8c2581774287c490a519ec5f1ea99bbac707411db9538fa80eb74f06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Count bound tools as part of input. \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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"759e70e83c67f3945144427a8906ef3fb444253ebef6c41ec15b974c38049869"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: update after Ollama implements \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":"libs/partners/ollama/tests/integration_tests/chat_models/test_chat_models_standard.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1232a54a4df9741fd7cbd942f57d253ff148fa6e318132367968997ecc24a0a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: AudioContentBlock once models support \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":"libs/partners/ollama/langchain_ollama/_compat.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"81788c9b0c56aacec10dfab45c0e7f08c248e1b1984855c732ac812a7ca05456"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: FileContentBlock once models support \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":"libs/partners/ollama/langchain_ollama/_compat.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61d2c7dd51833a3a62a17afb40093c76234c42d12cffc8dbf614b05241f0907"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle retries \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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f885dd26289a2473d8b9bf6600a1be387c3a7c82aef5feb35001e0cb53a876"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle retries \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":"libs/partners/mistralai/langchain_mistralai/embeddings.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cc0b20b6705d4e7b8ed8e308b7f1787f8261e111c47ca5d208b14af137cb68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle retries and max_concurrency \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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7e348c38322b3f6aed4e5bacc67a6057ca1dfdac534bc2297f01a411a9882b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle retries and max_concurrency \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":"libs/partners/mistralai/langchain_mistralai/embeddings.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"957fb59eef622f43b7676dd59828d563e193e12589cce5be053926a87a15fd4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Update to pass in tool name as tool_choice if/when Mistral supports \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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a43b5089b7e5bf12bab153ea817fada8345fe89c6942adab03d728e2d19ec74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: rename \u0060type\u0060 to something else, as it is a reserved keyword \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":"libs/partners/exa/langchain_exa/tools.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aca513ec30fe4c9ccdad36f12b1079be2d75b4a41e82def38412b77727549e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: RELEVANCE SCORE IS BROKEN. FIX 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":"libs/partners/chroma/tests/integration_tests/test_vectorstores.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fa3d0e559a5662fd4fe10e65421b2535d393d730d15d7e68655485fb8ec15d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Chroma can do batch querying, \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":"libs/partners/chroma/langchain_chroma/vectorstores.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"641141fa5cb4e95517fa4de7edb99ade59660661d4181e7ce60c0af6a19cdb8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: update example to trigger action \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":"libs/partners/anthropic/tests/integration_tests/test_chat_models.py"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"99746d85b923514d2084e5f932adb76013cbb49970487b3b91cbd772e7df2655"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: dump all \u0060data\u0060 with \u0060mode=\u0022json\u0022\u0060 \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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":2574}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b89a8aff4afaa33f56335969a496352b5ddcd0ee72802f97e7fa91e5c29214b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: make \u0060method=\u0022json_schema\u0022\u0060 the default in a future release. \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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":2992}}}],"partialFingerprints":{"codehealthFindingId/v1":"0771df725ddda2be6756025ebb2cce04d8d2cb4c83e4934623116b962766407b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: TYPE ERROR not yet detected by mypy - AnalysisMiddleware expects AnalysisResult, \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":"libs/langchain_v1/tests/unit_tests/agents/middleware_typing/test_middleware_type_errors.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc258935d8b8c653953753ff5cbd69cd2d820d3dfb4f5b6608bdadada76bb439"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: replace with operator.call when lower bounding to Python 3.11 \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":"libs/langchain_v1/langchain/chat_models/base.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"305e3c6aaccabc6ecedb7c218f0e3c166b20639c95f59ac16d2d2c8d0f7ca9c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test whether \u0022instructions\u0022 is passed to the retry_chain \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":"libs/langchain/tests/unit_tests/output_parsers/test_fix.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c870a77ef94f88db8eeaa387d9498dbebc38faf1e34b1ddae6ea1b475cd196e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: test whether \u0022instructions\u0022 is passed to the retry_chain \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":"libs/langchain/tests/unit_tests/output_parsers/test_fix.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a361fd9dc4dac6a68b6184122395f1cc0dbed8b3e6c5c53f75ae4619e202e03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: How should this be handled? \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":"libs/langchain/tests/unit_tests/agents/test_structured_chat.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae3ea82c66f5ae639a1e012529c2d444f13c9f838b4903be1802cb9e3ac618c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add more tests. \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":"libs/langchain/tests/unit_tests/agents/test_structured_chat.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ebca93493e285329a90c97d0979b7d0e91668f00236598697062ed175677fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Create a default helpfulness evaluator \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":"libs/langchain/langchain_classic/smith/evaluation/runner_utils.py"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9367e84f1eaf4e00be9488b28fa59dcb2e0b03cf70e15cbfe8238dd4e396ab8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Not currently surfaced. Update \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":"libs/langchain/langchain_classic/smith/evaluation/string_run_evaluator.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0044c8a6e7cb19504aa68f7a9a55e21895e5c54f5a66e2579233675fbbb6bba7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add run ID once we can declare it via callbacks \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":"libs/langchain/langchain_classic/smith/evaluation/string_run_evaluator.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d66ece5b71ac564726d6eb759dcdd047db2d78b864c5a4ad351b2a13b41bbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: abstract as a queue \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":"libs/langchain/langchain_classic/retrievers/time_weighted_retriever.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6b62fee981f771727fe2bb8d402df3f8705609065ecc2ab2bf7a65f64c9957"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Update vector store doc once \u0060update\u0060 method is exposed. \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":"libs/langchain/langchain_classic/retrievers/time_weighted_retriever.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b4587199eae37f20e5a9f8d6eef53bf008ef2ea429bea85e53691039e77c5b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: update to use model= once ChatBedrock supports \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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c622f9c98349c84736f20dc94b649ad88201104869709195db3e5c6182b019"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: document prompt \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":"libs/langchain/langchain_classic/chains/question_answering/chain.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e999eecddf570107ec27455a03b6f7624dd4758c4540895b718c7bafa39ad6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: document prompt \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":"libs/langchain/langchain_classic/chains/question_answering/chain.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3f0af6d15880c4564abf7afb92bbe38d009e9328ce59b968d1c7fd9f29d189"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Support more MIME types. \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":"libs/langchain/langchain_classic/chains/openai_functions/openapi.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc9b8e88d7aa560e35dcb6ed6809bcad3251808b18511bb3c43f249b047857f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: replace this with proper cursoring, ignoring the fact this is \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":"libs/langchain/langchain_classic/chains/natbot/crawler.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b860d585d232964ed9f4a2a5081f6fcad2d06393dccf0fc0ad416062391d41cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: If used by two LLM runs in parallel this won\u0027t work as expected \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":"libs/langchain/langchain_classic/callbacks/streaming_aiter.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"63dd60f3ddacd23552ce75fce909ac219ad112558afb9f72149ff6cbd9381fe6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: implement the other methods \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":"libs/langchain/langchain_classic/callbacks/streaming_aiter.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8745029c20ce8c7f9a5a30a65706fe46e95567ad0407a053b3d4da7975b386ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This could yield each result as it becomes available \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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2beb9d7040ab115cdb76068e02ab3be21b4810ef528c92a6a1763799bbef93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add tags from the serialized object directly. \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":"libs/langchain/langchain_classic/agents/initialize.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66245a3bed272c9c2ee1541d30dda88f6ac8adfd587c944c331c7df5659e0c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: deprecate \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":"libs/langchain/langchain_classic/agents/xml/prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0285ba45ae8e7a7f9cba2c13eb679a3b32463f8e3a737f0ea89a6aa80eb70ab7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Pagination \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":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7519db22f6ac0aedba448a36cac7deed0e21beb80333d8609e1f3d9887ffa0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Pagination \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":"libs/langchain/langchain_classic/agents/openai_assistant/base.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa0ec6ec9a1d4b633be7f046857df4c4ec572123d872633131c3e284afb4075"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: should be RunnableRouter \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":"libs/core/tests/unit_tests/runnables/test_runnable.py"},"region":{"startLine":2947}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fe456035d9020872adc8dbc019a170ec5d2a5302879ab3101ff7f28e23a79c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Rewrite properly the statement above \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":"libs/core/tests/unit_tests/runnables/test_runnable.py"},"region":{"startLine":3272}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb88c392b3fbcf08dfab93099f7770b2c912e14b1d645721b08aaefd5e4f9d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: consider changing this \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":"libs/core/tests/unit_tests/messages/test_utils.py"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c676e12e1b8fc59ddad29d4ffe24cd710bf36a97f5497dd5559e2e6797694c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: would be nice to change to \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":"libs/core/langchain_core/vectorstores/in_memory.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"49de4edb803bac5cdf3e5f4ee563cd4734dc15f4a587dff689fca6af713ea2f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add below special handling for \u0027type\u0027 key in 0.3 and remove \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":"libs/core/langchain_core/utils/_merge.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1819869b0d0ca2a4006da9bf33453d310bb6f51131b3cc6dc09a9640b56e55f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove this once merge_dict is updated with special \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":"libs/core/langchain_core/utils/_merge.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c801689bcdcaa6596edc03d45207a420f365b09e56119c45279319e38ecf1747"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This feels like it still has edge cases, no? \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":"libs/core/langchain_core/utils/mustache.py"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b2129704cb2b939b8edd63508aa09dd93d2edcca9f446fdb8ed73568344382"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(0.3): Determine if there is a more \u0022pydantic\u0022 way to preserve annotations. \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":"libs/core/langchain_core/utils/pydantic.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"668ba45bdd78ca7c91c655979d207c10ac451b3a85e3831125a7521ccb397b22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Figure out how to expose kwargs here \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":"libs/core/langchain_core/tracers/core.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dccf888a723d6b0a5011107bccabc7d253f0d8c108f5079998ba9a53c104bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Use get_args / get_origin and fully \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":"libs/core/langchain_core/tools/base.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b5fd9db868c1225497456f27c5a8ab34a1c58d9f216bd182edc63e45b3bacc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this is for backwards compatibility, remove in future \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":"libs/core/langchain_core/tools/simple.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc89bda709fcb116151fc8f53ea3f394c76628b54408997af7146b2cdc8e2b12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Is this needed? \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":"libs/core/langchain_core/tools/structured.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3768832ba0776aec89ca64beea9e70d95853bd3877dd0209fb8448db22aeea20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Handle partials \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":"libs/core/langchain_core/prompts/chat.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"74580d082cb3fae3a429b1a58c9de0ff571439f2c03a21b20fc6b67377658238"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Handle partials \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":"libs/core/langchain_core/prompts/chat.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd21a53f6d299a04cb3f0142579424555a89dab33446177391aef217ab2c0656"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle partials \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":"libs/core/langchain_core/prompts/chat.py"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"121d4386fb0208d5e2d01a5667a359cfb9c1df21959bca2b9b8af6429c89a85b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle partials \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":"libs/core/langchain_core/prompts/string.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"51312f0ce85faecff20239b64b6dff4be9db45fffccda0a91e6fff2c8dd769e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: rename \u0027completion\u0027 -\u003E \u0027text\u0027. \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":"libs/core/langchain_core/output_parsers/base.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4350fd879e2ffc0c0c53081319edd76f6892fbb95f17f84ac23dd25b0ea6ae0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Support more granular streaming of objects. \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":"libs/core/langchain_core/output_parsers/openai_tools.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c51b7924480ebed08288af13fc086578d6d2c4806e7aff75f95652f656e58a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this logic if possible, reducing breaking nature of changes \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":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01f48a2f7f62e608d824bb241e548b06cdb393c2fd62f26345aeac931a97a3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: handle non-string content. \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":"libs/core/langchain_core/messages/base.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f0d5c936a8bbac376126fe7059accc05de9d4bcc9eb804d0a425c3269b552d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Consider making this NotRequired[str] in the future. \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":"libs/core/langchain_core/messages/content.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b4429d0e010f420f894a53a10829ac1e7c7ec735edcaafc982dd8ac467b256"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Consider making this NotRequired[str] in the future. \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":"libs/core/langchain_core/messages/content.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf5328e8c07d1162e8d8407a679a92c24c3f563097bd198684cfce50d3dec68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Consider making this NotRequired[str] in the future. \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":"libs/core/langchain_core/messages/content.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f710fc631bb42480532fa61858bee09877d59dc94118fb1267d8d725256991"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Consider making fields NotRequired[str] in the future. \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":"libs/core/langchain_core/messages/content.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf043a297a6c2146cd477c97fab113d24a5ad18dd4f17c3957a4071c48c02f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Consider making fields NotRequired[str] in the future. \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":"libs/core/langchain_core/messages/content.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70a289b02bfd8e6e877cce153a38a65cca68e2c8f41ce5b08180e5ea521ff94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Update so validation errors (for token_counter, for example) are raised on \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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b8b0b9d58ca59b1108ff5a4a8ffc54597d6121e3036906279c7f48f4187315"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add model_name to all Bedrock chunks and update core merging logic \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":"libs/core/langchain_core/messages/block_translators/bedrock.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ad9877fcd38f842623db312fe4781f456ffefe6ce0fb859f2a768d7d7b33cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: attribute this claim \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":"libs/core/langchain_core/messages/block_translators/langchain_v0.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fb2143dadc1498feef01896977f395a480ff0eb21455d0abad6218c2f91cbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: standardise container_file_citation? \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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a2f6f3a99e490509919a6ce054d79ce2b6527b281fb126e36cfe3d67ca8a9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: consider adding a \u0060_model_identifier\u0060 property on BaseChatModel \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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad285bdd5614dfd73b1e923c0c386882ec48c538c2cffb8850a2ad375d5ff90f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support multiple run managers \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":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e55ecdd682ab8f49539cbf1c65bc9bac2b43861d168f0a1777bb906082a961"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add caching here. \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":"libs/core/langchain_core/language_models/llms.py"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc8b531efc4f17aa0a05e57fdd0ff22685100ab8c85a5b29ea4ef1237d86be9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add more detail about formats? \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":"libs/core/langchain_core/language_models/model_profile.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2dcc61858068936d889fba4d22e49d00f9c782fa333d5a007652d396368c27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add more detail about formats? e.g. bytes or base64 \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":"libs/core/langchain_core/language_models/model_profile.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b372df73d0cf7e7ffedaf4e9236a57df069294c62931901fdef713bd1be5d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add more detail about formats? e.g. bytes or base64 \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":"libs/core/langchain_core/language_models/model_profile.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe20e0783bc444fd0c90c2b4aa074c3adfe3cb4b58fbd0e37681d366d8b7e57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: add more detail about formats? e.g. bytes or base64 \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":"libs/core/langchain_core/language_models/model_profile.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"44efc11c91e82882963a97e8657d345b23b2ffd895c07d3d839616d395696f98"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. The recognised ADR directories in this tree were read \u2014 \u0060libs/core/langchain_core/decisions\u0060, \u0060libs/core/tests/unit_tests/decisions\u0060, \u0060libs/partners/openai/langchain_openai/decisions\u0060, \u0060libs/partners/openai/tests/integration_tests/decisions\u0060, \u0060libs/partners/openai/tests/unit_tests/decisions\u0060 \u2014 and none of their files is a decision record (a README, index or template page does not count). What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060libs/standard-tests/pyproject.toml\u0060 makes this repository a deployable product (line 50)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/standard-tests/pyproject.toml"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9634e37eef14827a0eec4b92a03e38790aaf66a4a8396d82ea59b20cc7d004d6"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 3 of 22 project(s) overshoot their size bounds, lowering Project Cohesion to 7.3/10. The most over is \u0060libs/langchain\u0060 (57113 LoC, 1196 module-visible types across 186 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e075c3efd07a688d4c3ee98133f9017fd46ca7b6671db9f50ac241aadb0e297b"},"properties":{"commitSha":"7a93356cbc5d89cc0f7dd746d8f1bb52666fd0f1"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01f6212d8db7241cb3e1bedbf91860988dbba4d54dc23e995226ec382f43560f"},"properties":{"commitSha":"6bc451b942d255cadab8afa7b64c3d9c7595eff0"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b4243082f404bc34752099ea37b24202df3eb0d542a85f5ff31767e614d42e9"},"properties":{"commitSha":"d57d08fd01e05889af4e59fa3577c824de6df09d"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2afbfd9d5e5fedd5ae543a7010b28637a7bb1007e34a0e43ed9160a91ce8c77"},"properties":{"commitSha":"5944c1851b14eb9b152b63efcbb5fe35127e1500"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a267b4b531996af428116162f3279170bded11be272153b0491b56fb2bdea15b"},"properties":{"commitSha":"bfbb97b74cf3b3b2c8dccac6f996371ffde06237"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6bf1a57a429965c7af25c0c9073e9539d1c833af6099c2365bc49074e3233418"},"properties":{"commitSha":"3d0449bb451425e705ed65ba2813a473f71ff2fe"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3583b60b74447e1f95f97f1e58ba7f4c2f33ff0f1193f063725859142f758d1"},"properties":{"commitSha":"47070b83148026c193192c5e4cecf555d49a51c6"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security 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":"a2d78d10bdab2f1b2a6e5618c1095f72eef82cb1952e477a479df862979d0ad4"},"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":"376f57d8a12bd222f0d4dfd9f554727ebbbdda27a21ba8767314a0755ba484df"},"taxa":[{"id":"CWE-250","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":"e5cf579cac37168a0a767032e0dd5d97d168cc4495e190c9b276db80107b9897"},"taxa":[{"id":"CWE-250","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":"e592af625637151a8d96191e02d2342f08760deca75794764613e89b0b0c6d95"},"taxa":[{"id":"CWE-250","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":"4a6bc324e4fd02b3b6f9bfebe712ee1efb3742d320d18ac0d56506b25d96fd15"},"taxa":[{"id":"CWE-250","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":"af64d341b6a202b4f31163e31505ae1a04ac3e0eafa8827ae055d0255f3ad738"},"taxa":[{"id":"CWE-250","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":"30e651bd92d93c1fc26a6938526a32de51b3b9023762a2bdc02749f2e1c0eb79"},"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":"cf57260da7c82aa216984ed27ecaedffb53f7478e25cd345eaf70a308bcb5f2c"},"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":"f16e0306c99cff9af3a6450032c64a3863c5cc19002753203808d39140496021"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"baf820cb96860a0cf55c98fa5eb663b20a3f1c93932ecb4c5e89f152bb919d2c"},"taxa":[{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"6136403e7e264cd3f8b81d5b64689077f676aaf0ee496c0643cf8fb8363fe889"},"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":"48eb0834244bf2654cb35f79883cb57d1abdef4c518907082097eab343d0f4d5"},"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":"4ab760681f86532f74bc8707d9f851b70ed9af719c077b50840195d032168302"},"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":"0526a06315e3d4dc11efd0f85f96bfca56b08f074cc759e408f3ed8cd609e6ea"},"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":"3fb95b4532b51a9760de59f5d7a0b1f3d8011b2b868f7b062ce75f4d0c22b6e5"},"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":"1a62abd4825f28cda5dc8fce7baf7688824389e326522861d8b609cd05405a8f"},"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":"7896aed90dc2cf098568d4cf0909da3c3c4b20f694b711ed8805bcd40cb2542f"},"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":"4c31f5bb94f2e804de7e4be252b1b290574e003cb425ca3e4c79227c9733cbbf"},"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":"91f86ba6b79d46634dfe0fe2ddc22c717cb30d5b312bd284e7aacacddb354504"},"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":"c4d522cdbd709b62299bf869febc0c7e5643e0c8f1dffe2abcd1b43f41ee6c00"},"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":"902e63fb41a03012a6763ab07446a9f4e27b26533bccbd24a58c562dff279406"},"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":"5fcc68ad6bd488492fa5462562154d16cef1ddd4d140c486f1759ccb057a1d6f"},"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":"0f1f66afe51a938890d1464f486c2b38fae214c87624f4659836fa2972d3c515"},"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":"2a791c1210e2323314664b53df59225a40d38a2a858617e4c0eea064c1df70eb"},"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":"b7ddf07436c368d610c265c46d6419f60878ef09867e6c5ec25e6deb23faabe3"},"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":"80c50761e1da0312825e8f21138069f11c19cfbcfc5e4f50e993effe537d7d13"},"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":"132bc680db5b8ac147d63361d34bca07ddad53d5eac5e37a738f7be74e416faf"},"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":"47e0599cd7fd44ff100c743f07554569ae0e480af80fec3fa4c62c66dc0baf58"},"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":"90d58a028742e34808681b12069005b7742970cb3140c31c84230ffc12eaf7e6"},"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":"b150b1eaf8906009b42b6d7797d22421702055e84e5a5e7ce7df3d179ce90331"},"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":"a34355d1dc70588e983e228aa49aff9c94b0ab9c1fc7e20615ba5039c5b6d98a"},"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":"d59c5e74be8ee9b202aed182d4a60a454ab991d56175c3a03ba7865cd61fbf36"},"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":"0e6ef2111ce4d6f788162b38aa88b9f1915c476c1f0095e4a349c7c3ab4f78ae"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"ff0c459a0439b0c5a19591be70c5d47a330365c1cf583e40581b418cee237417"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"6dd9a4ddecf92370f33f5a30ceef19c33014521f8d6a3c015ebbc72fecf874c8"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"1eaece92d6effe5249145840185e19901cf2a22d3f601e31927a3bf606c0c043"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"44866183e118bd027212d8976e22f9160ffe43c702fbd42e9c95d98643f7f004"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"30ce36f5df466fb2469524faddf974f439382f5cd4d878470d27ebb08aa3f051"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"8968a16557ab8e198b0400ee849f049e75dfae0782b22dccaf37771e58fc5673"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58f6b4977556f936b8fd66f6b006c8b17f47c943a090029a5dda60cdb85bdd8c"},"properties":{"dependency":{"package":"chromadb","version":"1.5.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-311","PYSEC-2026-3813","PYSEC-2026-3814","PYSEC-2026-3815"],"reachability":{"kind":"production","file":"libs/partners/chroma/langchain_chroma/vectorstores.py","line":18}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8de53d7cbabe47564ac73742a1a216720c9ca502265efa55aaca724efd95e519"},"properties":{"dependency":{"package":"jupyter-server","version":"2.20.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4054"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d2701940968240476661e80669ca063b68dfd820a4521cdf35573b80adf8d11"},"properties":{"dependency":{"package":"nltk","version":"3.10.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-3740"],"reachability":{"kind":"production","file":"libs/text-splitters/langchain_text_splitters/html.py","line":62}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7bc3790707c7047c7722dbd2f9d5742100afaef0ecda57db785c46a57b82f544"},"properties":{"dependency":{"package":"soupsieve","version":"2.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b1e395e174dbd94ab27e239a562357c02c1f93a1db94b718fd72b2d93fdb629"},"properties":{"dependency":{"package":"filelock","version":"3.20.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c613c23137db8af7425a4eb45e83ecbfa4543328b5f9c1993ab4893c193347c6"},"properties":{"dependency":{"package":"tornado","version":"6.5.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92e323067b207240fa112815161a7d412ec4c857159baa7d22f8cdd54614b7e8"},"properties":{"dependency":{"package":"tornado","version":"6.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dc163392b0bed6547c2619290831dbaceab7a28bf0d862511827da90c08780a7"},"properties":{"dependency":{"package":"tornado","version":"6.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"8c53ffe122513753ebcc8499ecd83477466dc57f5d7d7ce0340539ce2a0219a0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"cee99469d14cc13beb87027c4404826a4634a334f57f3c541845bd663bd9acc8"},"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":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/chains/constitutional_ai/principles.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfc02afc430d6c9529ea3cbb39513c16c2cc6d1488720d92fc5388a6a5f9009"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 57 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: libs/langchain/langchain_classic/llms/__init__.py, libs/langchain/langchain_classic/chains/sql_database/prompt.py, libs/langchain/langchain_classic/__init__.py, libs/langchain/langchain_classic/chains/question_answering/chain.py, libs/langchain/langchain_classic/chains/qa_with_sources/base.py, libs/langchain/langchain_classic/chains/summarize/chain.py, libs/langchain/langchain_classic/memory/prompt.py, libs/langchain/langchain_classic/chains/question_answering/map_reduce_prompt.py (and 49 more) (58 orphaned of 446 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; 446 of the 1766 production source files in this repository met that bar). 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":"libs/langchain/langchain_classic/llms/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fab7083562e82e713776995d0a50d1aad945e7a0180b9e93c92fd4a429a49d4"}},{"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":"libs/langchain/langchain_classic/chains/sql_database/prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b3fc10b410b954462b4640608ba5750827b4debfa5db9d5c6b3dcc7b57ad9b"}},{"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":"libs/langchain/langchain_classic/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db74ae4c1e99c7e76cee6293845ff7f36beddf6d51a98257e03e832ab7cfc532"}},{"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":"libs/langchain/langchain_classic/chains/question_answering/chain.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"188a1b716739a0b4955499dcec84e3684da1f4f1b02c677b10b7000f30f5df46"}},{"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":"libs/langchain/langchain_classic/chains/qa_with_sources/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"070367adc101099e4bb971944ea5775aad3f7e3a78c605b1a5b1cecc2d7f20be"}},{"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":"libs/langchain/langchain_classic/chains/summarize/chain.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4272425acc88e35b1f5e7876e737c02453eae9765cecd0210205204387339078"}},{"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":"libs/langchain/langchain_classic/memory/prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80994cd6060595ccc33c6be76fdf51157786e0e14a2d9beadd4a6d607a916ae"}},{"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":"libs/langchain/langchain_classic/chains/question_answering/map_reduce_prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ec601b9f83a157df570193956541b0a9e152f2a613bf2a2c43e585cb9849ae"}},{"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":"libs/langchain/langchain_classic/vectorstores/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b192ca982b527a25a1e2667f4c05b8fce2191a0766da8e03d5a742dd872613"}},{"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":"libs/langchain/langchain_classic/chains/qa_with_sources/loading.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f47887ae6c417a5255bf3952bab222e3f4fa3f8aee51950a9885f5de0330457"}},{"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":"libs/langchain/langchain_classic/chains/qa_with_sources/map_reduce_prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2aa15cc7a4410d0a3d87a4cdc97d0ce4a3ee16f53a90be5af1859aab01cd24"}},{"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":"libs/langchain/langchain_classic/chains/query_constructor/prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"216097075ae891c2a8ff28cc50e4ee7f3e1585318fa9392cc4d76eb143e0044b"}},{"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":"libs/core/langchain_core/tracers/stdout.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b3d3f7119358643b6ae3944cc66d0542f07adcb0b1752b38087da167dfcd5d"}},{"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":"libs/langchain/langchain_classic/chains/qa_with_sources/stuff_prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4ac3c072bb9636662852973358575e624825f4da9c3bcc3fcb7ea1dd073a69"}},{"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":"libs/langchain/langchain_classic/agents/react/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"383a3305014c36c2d7d8f2b9ed90628e3cc0394dfe88019e4e7392d6dd6de0df"}},{"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":"libs/langchain/langchain_classic/agents/conversational_chat/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ea01a33540fa2697f73cf866097687887111f02a0b98ea5e5e48926107b7ce"}},{"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":"libs/langchain/langchain_classic/agents/react/wiki_prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e72760c94999eada790763df975002298abace0b91cd3766df45f1e6bd7c41"}},{"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":"libs/langchain/langchain_classic/agents/conversational/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dc4c846747626a6df62cd3f90ccc41d84d45acf6ff8a5ac7e8996e2e16cb71"}},{"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":"libs/langchain/langchain_classic/evaluation/agents/trajectory_eval_prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac443510b105843ef60b03cb10236940de346f0b5a330854671db3e34b250f1c"}},{"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":"libs/langchain/langchain_classic/memory/summary_buffer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"562eb52893e418b17205b21f88ba684e5c8ecd5bedcbf519e2aa04ad3788e5ce"}},{"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":"libs/core/langchain_core/output_parsers/transform.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9a2bc28767f853950b20ad253e36ea2074ec6133efaf5ed2e55ef946337695"}},{"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":"libs/langchain/langchain_classic/evaluation/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"675cc9b2f33ea3ebfccdecea1974a21ca8ab0eca6b196b41e14ae03b878a8415"}},{"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":"libs/langchain/langchain_classic/chains/natbot/prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7290dc3b2d8b5128aeef8eda4898dc634908152fed503e9b094607af9fe9d795"}},{"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":"libs/partners/anthropic/langchain_anthropic/experimental.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38036019e49ae17e876822516b0adacc097b35f11bb21c13b1b7b923aa342849"}},{"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":"libs/langchain/langchain_classic/retrievers/document_compressors/chain_extract.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1346f3d3b4e246198941e2b416203e87f9ec4dd00a47e1c5a0494493e3d7d59a"}},{"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":"libs/langchain/langchain_classic/chains/hyde/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a4d93bc5661144b6c3872170d3112c51d44cbc54e9a1f9e71d8ea75589d761"}},{"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":"libs/langchain/langchain_classic/agents/structured_chat/output_parser.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62abebab764caf35b27b8b2707215f675b92cbdfddd779167b0c7bd7c91073d6"}},{"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":"libs/langchain/langchain_classic/output_parsers/format_instructions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d39033a12fa66b4d3ca6eff8c554e25bd6dd29212982633c2547fea399acae"}},{"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":"libs/langchain/langchain_classic/evaluation/qa/eval_prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9458b3c8e210af502eb99bd05cb81b268917483238e7e0898693bdd57e676d"}},{"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":"libs/core/langchain_core/language_models/fake.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77775c216a6c9b45623d4e4f668027f8ee85e1bfb99287b2da6c8f6b56e8cf58"}},{"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":"libs/langchain/langchain_classic/callbacks/streaming_aiter_final_only.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f78b621e5348b6f85f3eeacad6eb44b31308ba5b6287c790f35bac5b4dd0204"}},{"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":"libs/langchain/langchain_classic/smith/evaluation/progress.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45d756e512832444684af2d30154bfff61f32398ce867b49bb7b03969a3db04"}},{"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":"libs/langchain/langchain_classic/agents/openai_functions_agent/agent_token_buffer_memory.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6764bc7b482d21a44a8d1eb24d4931ad9fc6ecb5d9ad6e5d18d6fd5fc8aae6a"}},{"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":"libs/langchain/langchain_classic/agents/output_parsers/openai_functions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a812e95dc5ca4278fdc58daad4d3ce6f30b17e835705aa8210e4b1fcbefcc35"}},{"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":"libs/langchain/langchain_classic/retrievers/merger_retriever.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62366b0d20824ac8169d7d19d890013cc8dc8a1f5b31dcdcd21f70f8afe3153f"}},{"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":"libs/langchain/langchain_classic/callbacks/streaming_stdout_final_only.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be1770ae4107f376eb48abada93b7a321b0440f45b6f22168ff6fb5835e92ed"}},{"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":"libs/langchain/langchain_classic/output_parsers/structured.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3acadd13483fb58c42c401b559dea6fefd20def2c294eaf4df0e4ade8b8a2b"}},{"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":"libs/partners/anthropic/langchain_anthropic/output_parsers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcac2bbb55e8bbd04c35a16bef39baaa8977b341cc0b4091c44bf6523b85a8a3"}},{"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":"libs/langchain/langchain_classic/chains/api/open_meteo_docs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb50f4ed76718faec08286a10a9d29ff2bd176b8c81c41365c0f6e2f16705134"}},{"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":"libs/langchain/langchain_classic/callbacks/streamlit/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"243893fd326e631f491b009468aa6f74507b863b438fe42c2611399a357772d1"}},{"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":"libs/langchain/langchain_classic/agents/agent_toolkits/conversational_retrieval/openai_functions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4c091f11bf75b626eead0f56cda6f0ce961ddcd5e7b5af08b03fc04a274922"}},{"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":"libs/partners/perplexity/langchain_perplexity/output_parsers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8cd8b41cc14cb477206dd100eab2498e6f07ab5c7dd9d445544f630e98fcc0"}},{"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":"libs/langchain/langchain_classic/retrievers/document_compressors/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2937c36f2b6f7cb039f20b77f97b22b8f48c18dc423753b267d528950a1f0daa"}},{"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":"libs/core/langchain_core/utils/formatting.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f230c48001c8bee39ec68c2f1b08e2a338564137a5940b1148099672443d9f75"}},{"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":"libs/langchain/langchain_classic/evaluation/exact_match/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"556a9530820aef83204c12bf9cbb1e45da5771d43db01a8d6c83adc233c910c2"}},{"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":"libs/langchain/langchain_classic/memory/combined.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ca1c0605a932d5e670c1a35a08070589a93ff13d0cc7d81d798c619e5c3abd"}},{"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":"libs/core/langchain_core/tracers/_compat.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a8eca50af8dda7e6e71cc2ebd1729eaab78c4b7e9ce5c0081c9c2cc6ab4785"}},{"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":"libs/langchain/langchain_classic/retrievers/re_phraser.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"948117c3427fab69d29ff47c82d4c4a9efae8d65079424ecd1c26f93aba02c99"}},{"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":"libs/langchain/langchain_classic/agents/conversational_chat/prompt.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a4d42cf9785057580521240070d05ca5098df5d7d34474d9a40291819d5e5e"}},{"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":"libs/langchain/langchain_classic/memory/token_buffer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de98de874f6263aec65352970dfbd13738e748c216d1a88276b46a7180513e56"}},{"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":"libs/langchain/langchain_classic/agents/format_scratchpad/openai_functions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ff0389a8bbec0c12ef13d7e5a14884dc328b5c06c53d188a559f57125288f5"}},{"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":"libs/langchain/langchain_classic/agents/output_parsers/react_json_single_input.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f306aa5f18fe22baae768bc9a8eaf02953829299b0cd1944f361a6ea8a70a35"}},{"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":"libs/partners/perplexity/langchain_perplexity/retrievers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cebaa78f098e2fec4efe5f13b544fdc396ff532343bb4ba349e13575a71e88"}},{"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":"libs/langchain/langchain_classic/evaluation/regex_match/base.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1cd172896699ca30ae22e0c077b112e0714fb78b3c098150929d2e0ebc7206"}},{"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":"libs/langchain/langchain_classic/chains/qa_with_sources/retrieval.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4becb6fd6cab2f5e4bf3d4edfc1d084fb0580783a41916ebd7f40e7780332420"}},{"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":"libs/langchain/langchain_classic/chains/api/news_docs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb813d1b0a08f7f62006f7aeb0bdd5bd3c9930d2e0a6ed16a154f5fc054ae67"}},{"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":"libs/langchain/langchain_classic/agents/chat/output_parser.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6006fa610ba0eaa60fa70a7828c1a8b46e0d9112a586a93ddd289f11f5b2fe"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: extraction.py \u2194 base.py: \u0060libs/langchain/langchain_classic/chains/openai_tools/extraction.py\u0060 and \u0060libs/langchain/langchain_classic/chains/structured_output/base.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 \u0060468dad17\u0060 chore: use model IDs, latest anthropic models (#33747); \u006009102a63\u0060 fix: update some links (#33686); \u00606e25e185\u0060 fix(docs): Fix several typos and grammar (#33487) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/chains/openai_tools/extraction.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4478b9965c9472e0762fe1f156e3e383471daee1fb42f081b4edf330dca830"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: context_editing.py \u2194 todo.py: \u0060libs/langchain_v1/langchain/agents/middleware/context_editing.py\u0060 and \u0060libs/langchain_v1/langchain/agents/middleware/todo.py\u0060 change together 75% of the time (9 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 9 shared commits counted here, the most recent 3 are \u00604ab94579\u0060 feat(langchain): support \u0060SystemMessage\u0060 in \u0060create_agent\u0060\u0027s \u0060system_\u2026; \u0060b7d1831f\u0060 fix: deprecate \u0060setattr\u0060 on \u0060ModelCallRequest\u0060 (#34022); \u0060f2410f7e\u0060 revert: Support for SystemMessage in create_agent (#33889) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/context_editing.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee29564f145a7f1ea6b3d015616fe290ab8d1ce69f4e51599b23d3a619c68aa6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: extraction.py \u2194 extraction.py: \u0060libs/langchain/langchain_classic/chains/openai_functions/extraction.py\u0060 and \u0060libs/langchain/langchain_classic/chains/openai_tools/extraction.py\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 7 shared commits counted here, the most recent 3 are \u0060468dad17\u0060 chore: use model IDs, latest anthropic models (#33747); \u006009102a63\u0060 fix: update some links (#33686); \u00606e25e185\u0060 fix(docs): Fix several typos and grammar (#33487) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/chains/openai_functions/extraction.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a698767ac6f4f8b81b11586b99a0e105f0728a890b878b0fc57f0f6e964262f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: chat_models.py, embeddings.py, llms.py: 3 files \u2014 \u0060libs/partners/ollama/langchain_ollama/chat_models.py\u0060, \u0060libs/partners/ollama/langchain_ollama/embeddings.py\u0060, \u0060libs/partners/ollama/langchain_ollama/llms.py\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/ollama/langchain_ollama/chat_models.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0d2221b9bc7dcf0a34869327207c0afee878d8bdab9ae9d6eda64ccb152d80"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: factory.py \u2194 context_editing.py: \u0060libs/langchain_v1/langchain/agents/factory.py\u0060 and \u0060libs/langchain_v1/langchain/agents/middleware/context_editing.py\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \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 7 shared commits counted here, the most recent 3 are \u00604ab94579\u0060 feat(langchain): support \u0060SystemMessage\u0060 in \u0060create_agent\u0060\u0027s \u0060system_\u2026; \u0060f2410f7e\u0060 revert: Support for SystemMessage in create_agent (#33889); \u0060cf595dcc\u0060 chore(langchain): Support for SystemMessage in create_agent (#33640) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/factory.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36910ba175bdfdb26ce58439cdccd4137066cc3282c6f0186dbdcc09e487605f"}},{"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":"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":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 12/13 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060libs/model-profiles\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 27 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/block_fork_main_prs.yml"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"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":"P8","level":"warning","message":{"text":"Schema created by SQLAlchemy create_all() (no migration path): SQLAlchemy create_all() builds the schema from the model at startup and keeps no migration history, so there is no reviewed, repeatable upgrade path for an existing production database \u2014 a renamed column is dropped and re-added rather than migrated. Adopt Alembic (\u0060alembic revision --autogenerate\u0060 \u002B \u0060alembic upgrade head\u0060), so every schema change is a versioned file applied the same way in every environment."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain/langchain_classic/indexes/_sql_record_manager.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbffa09cad3a00b5cf6dae9b865191396c00b6a3060fedba932d80ebca30f0e"}},{"ruleId":"X1","level":"warning","message":{"text":"Task from \u0060asyncio.get_running_loop().create_task\u0060 is not kept: The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python\u0027s documentation for \u0060asyncio.create_task\u0060: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled \u2014 it surfaces, if at all, as \u0022Task exception was never retrieved\u0022 in a log. Keep the task: \u0060await\u0060 it, gather it, start it in an \u0060asyncio.TaskGroup\u0060 (\u0060async with asyncio.TaskGroup() as tg: tg.create_task(\u2026)\u0060), or, for genuine fire-and-forget, add it to a set and \u0060task.add_done_callback(tasks.discard)\u0060 with a callback that also reads its exception."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/_client_utils.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"888d3c71b799b2a1d6a74067b9412205ab40fd356a693b872a2bdafae02ca7a7"}},{"ruleId":"X1","level":"warning","message":{"text":"Task from \u0060asyncio.get_running_loop().create_task\u0060 is not kept: The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python\u0027s documentation for \u0060asyncio.create_task\u0060: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled \u2014 it surfaces, if at all, as \u0022Task exception was never retrieved\u0022 in a log. Keep the task: \u0060await\u0060 it, gather it, start it in an \u0060asyncio.TaskGroup\u0060 (\u0060async with asyncio.TaskGroup() as tg: tg.create_task(\u2026)\u0060), or, for genuine fire-and-forget, add it to a set and \u0060task.add_done_callback(tasks.discard)\u0060 with a callback that also reads its exception."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/anthropic/langchain_anthropic/_client_utils.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"249ea965ab7e627ba6ff20090b8b09985ea31ef6811976c753609ef36a086b78"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022base64\u0022 in block or block.get(\u0022source_type\u0022) == \u0022base64\u0022\u0060 appears character-identically in 3 files \u2014 libs/core/langchain_core/messages/block_translators/openai.py, libs/partners/anthropic/langchain_anthropic/chat_models.py, libs/partners/openrouter/langchain_openrouter/chat_models.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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba21284b3ed8903d91fa16795eb70931e00859ce9761b0ce923cd3c622321635"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022file_id\u0022 in block or block.get(\u0022source_type\u0022) == \u0022id\u0022\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/language_models/chat_models.py, libs/partners/typesafe/langchain_typesafe/_assets.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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65608e613342dde4cfaffbf13c346cd7aa4b4f5be16a124e5b39e67cf2b3043"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022llm_chain\u0022 not in values and values[\u0022llm\u0022] is not None\u0060 appears character-identically in 2 files \u2014 libs/langchain/langchain_classic/chains/llm_math/base.py, libs/langchain/langchain_classic/chains/natbot/base.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":"libs/langchain/langchain_classic/chains/llm_math/base.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1bea83cab0daf2e1260a15033a491181a4eaec6938dae8c5543172c9b8ced53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022max_tokens\u0022 in kwargs and isinstance(kwargs[\u0022max_tokens\u0022], int)\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/language_models/chat_models.py, libs/core/langchain_core/language_models/llms.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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad1d3d2bb54b7b486501bcd05446674629143a7aefd4970d670b76ec8159957"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022model\u0022 in kwargs and isinstance(kwargs[\u0022model\u0022], str)\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/language_models/chat_models.py, libs/core/langchain_core/language_models/llms.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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"662ec25ae0f2c91c8be50407fbf10e205582f0bd643b3f6b1ffa4450b3c2f7e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022name\u0022 in function_call and function_call[\u0022name\u0022] is None\u0060 appears character-identically in 5 files \u2014 libs/partners/fireworks/langchain_fireworks/chat_models.py, libs/partners/groq/langchain_groq/chat_models.py, libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py, libs/partners/openai/langchain_openai/chat_models/base.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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ff57b9c490d76f8e3a38f1fc997a011b965322544429781f2d0c7c7c91545b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022temperature\u0022 in kwargs and isinstance(kwargs[\u0022temperature\u0022], (int, float))\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/language_models/chat_models.py, libs/core/langchain_core/language_models/llms.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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dc34f581183a41221e13fd1b60ddb369699200d02e0a6228da748b5226297a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022tool_calls\u0022 in message_dict and message_dict[\u0022content\u0022] == \u0022\u0022\u0060 appears character-identically in 2 files \u2014 libs/partners/fireworks/langchain_fireworks/chat_models.py, libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7580659d841851cf9c8650417d410e170d12a52106ed40482e8a22aafc6c0b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022type\u0022 in tool and tool[\u0022type\u0022] != \u0022function\u0022\u0060 appears character-identically in 2 files \u2014 libs/partners/openai/langchain_openai/chat_models/base.py, libs/partners/perplexity/langchain_perplexity/chat_models.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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":4626}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a40baa4c54cb123e54f4fcc08ca1276084c249c25aefd403c54414cf5bca6f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_get_default_model_profile(self.model) or None\u0060 appears character-identically in 3 files \u2014 libs/partners/anthropic/langchain_anthropic/chat_models.py, libs/partners/mistralai/langchain_mistralai/chat_models.py, libs/partners/perplexity/langchain_perplexity/chat_models.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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"39054f541e8c4f22aea6b6b91db4eb0e0569eb11247967d8ed79fa2eba6ec61e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_get_default_model_profile(self.model_name) or None\u0060 appears character-identically in 7 files \u2014 libs/partners/deepseek/langchain_deepseek/chat_models.py, libs/partners/fireworks/langchain_fireworks/chat_models.py, libs/partners/groq/langchain_groq/chat_models.py, libs/partners/openai/langchain_openai/chat_models/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":"libs/partners/deepseek/langchain_deepseek/chat_models.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d73dd3d70c377519fb4e4a3f661d18f484a44f6d4d0915b6b1dcc72107d56e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060block.get(\u0022source_type\u0022) == \u0022base64\u0022 or \u0022base64\u0022 in block\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/messages/block_translators/openai.py, libs/partners/openrouter/langchain_openrouter/chat_models.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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"525b0f56124ee0b4674d0fc28c1b6c23483129e3bfbfd05af957b689d5592137"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060block.get(\u0022source_type\u0022) == \u0022id\u0022 or \u0022file_id\u0022 in block\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/messages/block_translators/openai.py, libs/partners/openrouter/langchain_openrouter/chat_models.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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d0dbba84c92ef8ba26d19c7cbf74636f5a990a23ca5715ae30089d09d0029b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060block.get(\u0022type\u0022) == \u0022text\u0022 and isinstance(block.get(\u0022text\u0022), str)\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/messages/base.py, libs/partners/mistralai/langchain_mistralai/_compat.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":"libs/core/langchain_core/messages/base.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3dd410a08f7015f2b8e3a6f083f88a5d30007713d4baceb71f20056fd42fde"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060block.get(\u0022type\u0022) == \u0022thinking\u0022 and isinstance( block.get(\u0022thinking\u0022), list )\u0060 appears character-identically in 2 files \u2014 libs/partners/mistralai/langchain_mistralai/_compat.py, libs/partners/mistralai/langchain_mistralai/chat_models.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":"libs/partners/mistralai/langchain_mistralai/_compat.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a709a0c7c0735d096e1d16e179c27c9648684c0d3de330be1a165df8227ccc7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config is None or isinstance(config, dict) or len(config) \u003C= 1\u0060 appears character-identically in 2 files \u2014 libs/langchain/langchain_classic/chat_models/base.py, libs/langchain_v1/langchain/chat_models/base.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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb1e24c97d310f1c7128ed9d63f12bd218bfa198fafabed607b8b0a0cf21ce7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.get(\u0022run_name\u0022) or self.get_name()\u0060 appears character-identically in 7 files \u2014 libs/core/langchain_core/retrievers.py, libs/core/langchain_core/runnables/base.py, libs/core/langchain_core/runnables/branch.py, libs/core/langchain_core/runnables/fallbacks.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":"libs/core/langchain_core/retrievers.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2295843dfeaf349f11d12cf99eca1532b58bc813dba8744cf80d371ce40e4f89"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config_prefix and not config_prefix.endswith(\u0022_\u0022)\u0060 appears character-identically in 2 files \u2014 libs/langchain/langchain_classic/chat_models/base.py, libs/langchain_v1/langchain/chat_models/base.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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"58806a7b3294afa76fb1ed50e0282ca85bc0e96e3b8d521a4a99091c0799d21e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config_prefix and not configurable_fields\u0060 appears character-identically in 2 files \u2014 libs/langchain/langchain_classic/chat_models/base.py, libs/langchain_v1/langchain/chat_models/base.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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb065f32eae08f172b7345fce56a8d1b8512988f9626a67a4d03a9eb4b710b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060examples is None and example_selector is None\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/prompts/few_shot.py, libs/core/langchain_core/prompts/few_shot_with_templates.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":"libs/core/langchain_core/prompts/few_shot.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba4bbebbd2b76b01e3c9a6bec435f013cb74b12749623f958020afe42ff9034"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(self, \u0022max_tokens\u0022) and isinstance(self.max_tokens, int)\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/language_models/chat_models.py, libs/core/langchain_core/language_models/llms.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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"1012be105cfa50b647f71a9a7db2a7b7c61f94b2d4f0736f560faf22339b675b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(self, \u0022model\u0022) and isinstance(self.model, str)\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/language_models/chat_models.py, libs/core/langchain_core/language_models/llms.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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d5e86553b0a16a733a5bf7b1d30b36438726c68a004424ed7288daef5a09ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(self, \u0022model_name\u0022) and isinstance(self.model_name, str)\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/language_models/chat_models.py, libs/core/langchain_core/language_models/llms.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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd159e2c4d646557b3a7101cf37b710c2c27f05bf4316ff94dbb64d49e870a53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(self, \u0022temperature\u0022) and isinstance( self.temperature, (int, float) )\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/language_models/chat_models.py, libs/core/langchain_core/language_models/llms.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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"2959d9a99748a26700d34888ea49b2b752404efcac84fdd5d772476883b3ba9b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060include and not _is_valid_include_pattern(include)\u0060 appears character-identically in 2 files \u2014 libs/langchain_v1/langchain/agents/middleware/file_search.py, libs/partners/anthropic/langchain_anthropic/middleware/file_search.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":"libs/langchain_v1/langchain/agents/middleware/file_search.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"196f7a0e8f77a709d0318ca19e2f1153f8e8105991082a63b77ab25aeeea50c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inspect.isclass(root_type) and not isinstance(root_type, GenericAlias) and issubclass(root_type, BaseModel)\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/runnables/base.py, libs/core/langchain_core/runnables/history.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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e67b6cc027f13a7e4b5984f769d09f5f0251b10aded260db1b9b85d4b25fef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(block, dict) and block.get(\u0022type\u0022)\u0060 appears character-identically in 3 files \u2014 libs/core/langchain_core/language_models/_utils.py, libs/core/langchain_core/messages/ai.py, libs/partners/openai/langchain_openai/chat_models/base.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":"libs/core/langchain_core/language_models/_utils.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0799b2bae33e103cbb358f8baa9e612994111d3a4d8f23b93e50b564ff6f3993"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(block, dict) and block.get(\u0022type\u0022) == \u0022text\u0022\u0060 appears character-identically in 6 files \u2014 libs/core/langchain_core/messages/block_translators/openai.py, libs/core/langchain_core/messages/utils.py, libs/partners/deepseek/langchain_deepseek/chat_models.py, libs/partners/groq/langchain_groq/chat_models.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":"libs/core/langchain_core/messages/block_translators/openai.py"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"900135d9cdf7fd3bc207da447d508131413da365692a3cbb7bcf32ac49b546bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(block, dict) and block.get(\u0022type\u0022) == \u0022text\u0022 and \u0022text\u0022 in block\u0060 appears character-identically in 2 files \u2014 libs/partners/mistralai/langchain_mistralai/chat_models.py, libs/partners/openai/langchain_openai/chat_models/base.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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"56eec09602159a90d597324d54fcf36e2f44cccb9192fd0188889b495b292578"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(block, dict) and block.get(\u0022type\u0022) == \u0022tool_call\u0022\u0060 appears character-identically in 3 files \u2014 libs/core/langchain_core/messages/ai.py, libs/core/langchain_core/messages/block_translators/bedrock.py, libs/core/langchain_core/messages/block_translators/google_genai.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":"libs/core/langchain_core/messages/ai.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f855f49936683a5bfb1aa4f396fa8bf433ca67af91bd2f9b601a0206ed16444b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(block, dict) and is_data_content_block(block)\u0060 appears character-identically in 3 files \u2014 libs/partners/groq/langchain_groq/chat_models.py, libs/partners/mistralai/langchain_mistralai/chat_models.py, libs/partners/openrouter/langchain_openrouter/chat_models.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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"c426e7ab4761449414367e70ed057fc7d02c1b952c696db1e87789407d606b7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(message, AIMessage) and message.tool_calls\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/messages/utils.py, libs/core/langchain_core/output_parsers/openai_tools.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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"979e6b2cca678d7da85214895cb610c09009d5e3f2e1ee6d2d6cdc7e7b427e06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(message, AIMessageChunk) and len(message.tool_call_chunks) == 1 and message.chunk_position != \u0022last\u0022\u0060 appears character-identically in 3 files \u2014 libs/core/langchain_core/messages/block_translators/anthropic.py, libs/core/langchain_core/messages/block_translators/bedrock_converse.py, libs/core/langchain_core/messages/block_translators/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":"libs/core/langchain_core/messages/block_translators/anthropic.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1afbb37c8979646a164b6b640a7ed269f798c87e781d2f940a77c371738c5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(msg, AIMessage) and msg.tool_calls\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/messages/utils.py, libs/langchain_v1/langchain/agents/middleware/summarization.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":"libs/core/langchain_core/messages/utils.py"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ee43c4d48e0f3d4957ff690ac89eb1530c28ffbe183ce01672cf0185bbb4c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(obj, type) and is_basemodel_subclass(obj)\u0060 appears character-identically in 6 files \u2014 libs/partners/fireworks/langchain_fireworks/chat_models.py, libs/partners/groq/langchain_groq/chat_models.py, libs/partners/openai/langchain_openai/chat_models/azure.py, libs/partners/openai/langchain_openai/chat_models/base.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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":2055}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37554fa29860296759a56a4fe73ed09d9bb0d031e446da4959e38ce525ffccd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(path, str) and path.startswith(\u0022lc://\u0022)\u0060 appears character-identically in 3 files \u2014 libs/core/langchain_core/prompts/loading.py, libs/langchain/langchain_classic/agents/loading.py, libs/langchain/langchain_classic/chains/loading.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":"libs/core/langchain_core/prompts/loading.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9838bc75856a27992dbf64a3701e92127d0508c6965d16b55ba95e38c297cc82"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(schema, dict) and \u0022json_schema\u0022 in schema and schema.get(\u0022type\u0022) == \u0022json_schema\u0022\u0060 appears character-identically in 2 files \u2014 libs/partners/mistralai/langchain_mistralai/chat_models.py, libs/partners/openai/langchain_openai/chat_models/base.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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a2e0c02c5f3db7df9d38bc32990d5b97760a6a1e65184fc3ca8dbf0c19a757"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(schema, dict) and \u0022name\u0022 in schema and \u0022schema\u0022 in schema\u0060 appears character-identically in 2 files \u2014 libs/partners/mistralai/langchain_mistralai/chat_models.py, libs/partners/openai/langchain_openai/chat_models/base.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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0bc1c2e78b5750954cc1d75ff236f668fa2475bc15f5cd2059aab9870e1f4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(schema, dict) and isinstance(schema.get(\u0022strict\u0022), bool)\u0060 appears character-identically in 2 files \u2014 libs/partners/mistralai/langchain_mistralai/chat_models.py, libs/partners/openai/langchain_openai/chat_models/base.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":"libs/partners/mistralai/langchain_mistralai/chat_models.py"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"3631915a2981277c6bca3c40fee1275693878d977d7acef8789dbd6f671d9df2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(schema, type) and is_basemodel_subclass(schema)\u0060 appears character-identically in 6 files \u2014 libs/core/langchain_core/language_models/chat_models.py, libs/langchain/langchain_classic/chains/openai_functions/qa_with_structure.py, libs/partners/anthropic/langchain_anthropic/chat_models.py, libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f9348133b80ab0edc5c6c1a31013a94f219aade20e5cbc4e2c930f0d81986a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(schema, type) and issubclass(schema, BaseModel)\u0060 appears character-identically in 2 files \u2014 libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.py, libs/langchain_v1/langchain/agents/structured_output.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":"libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9518212a604e6524ea73aded51bf7ed2a18ea652cff81b0a28f6d9f1b2288a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(tool_choice, str) and ( tool_choice not in (\u0022auto\u0022, \u0022none\u0022, \u0022required\u0022) )\u0060 appears character-identically in 2 files \u2014 libs/partners/groq/langchain_groq/chat_models.py, libs/partners/openrouter/langchain_openrouter/chat_models.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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"b017e513ae2705564a3a2c4307f3c2bee69c516a67f3a195463dad3ef8e1240c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, Sequence) and not isinstance(value, (str, bytes, bytearray))\u0060 appears character-identically in 3 files \u2014 libs/partners/openai/langchain_openai/decisions/_classifier_input.py, libs/partners/openai/langchain_openai/decisions/_input.py, libs/partners/typesafe/langchain_typesafe/_state.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":"libs/partners/openai/langchain_openai/decisions/_classifier_input.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45264dde66761cd5914807750b24f536514ccefc767ab64d0ea217fa0f4e017"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(openai_functions) == 1 and enforce_single_function_usage\u0060 appears character-identically in 2 files \u2014 libs/langchain/langchain_classic/chains/openai_functions/base.py, libs/langchain/langchain_classic/chains/structured_output/base.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":"libs/langchain/langchain_classic/chains/openai_functions/base.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68d082b112093e07e4536dc2d0e35b990c5ea82daec52ecb0dd7117d8e7fe20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060list(islice(metadatas_iterator, batch_size)) or None\u0060 appears character-identically in 2 files \u2014 libs/partners/qdrant/langchain_qdrant/qdrant.py, libs/partners/qdrant/langchain_qdrant/vectorstores.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":"libs/partners/qdrant/langchain_qdrant/qdrant.py"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"1191e6d0800c2d6cc6450d32f5f5f404bf43b7e23ac5ee21c232cb3b9eb137c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.content == \u0022\u0022 and not message.additional_kwargs and not message.tool_calls\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/messages/block_translators/bedrock.py, libs/core/langchain_core/messages/block_translators/bedrock_converse.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":"libs/core/langchain_core/messages/block_translators/bedrock.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3357f7c5bcc9a13fb089c1fbc3460648b0d0edd63e58dbba440e3d8a482fc6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.tool_calls or message.invalid_tool_calls\u0060 appears character-identically in 8 files \u2014 libs/partners/anthropic/langchain_anthropic/chat_models.py, libs/partners/fireworks/langchain_fireworks/chat_models.py, libs/partners/groq/langchain_groq/chat_models.py, libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7fbde18255e71ced3f52db74dbfb81e778f77d686cacb1abef4eff4351b34b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message_dict[\u0022content\u0022] == \u0022\u0022 or ( isinstance(message_dict[\u0022content\u0022], list) and not message_dict[\u0022content\u0022] )\u0060 appears character-identically in 2 files \u2014 libs/partners/groq/langchain_groq/chat_models.py, libs/partners/openrouter/langchain_openrouter/chat_models.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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a29018e1f08b001dacc6ac7f927a4125d65065dc829ec831db0bb80e507b88"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model_provider or _attempt_infer_model_provider(model)\u0060 appears character-identically in 2 files \u2014 libs/langchain/langchain_classic/chat_models/base.py, libs/langchain_v1/langchain/chat_models/base.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":"libs/langchain/langchain_classic/chat_models/base.py"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"2043798d6cf58a337c12ec5475ab127dcf7977292352e27a5331001cb8d67699"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not last_ai_msg or not last_ai_msg.tool_calls\u0060 appears character-identically in 2 files \u2014 libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.py, libs/langchain_v1/langchain/agents/middleware/todo.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":"libs/langchain_v1/langchain/agents/middleware/human_in_the_loop.py"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5f2e13ae46d06beda3473ea0a3884f6f578e13269598ebbabc8540573703d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not self.azure_ad_async_token_provider or self.azure_ad_token or self.azure_ad_token_provider\u0060 appears character-identically in 3 files \u2014 libs/partners/openai/langchain_openai/chat_models/azure.py, libs/partners/openai/langchain_openai/embeddings/azure.py, libs/partners/openai/langchain_openai/llms/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":"libs/partners/openai/langchain_openai/chat_models/azure.py"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f40d4e199f79ff907e78a7639c9b7c459e3daaa651cf855fcbf4fc96ab95e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not warned and type(self) is obj and not is_caller_internal()\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/_api/beta_decorator.py, libs/core/langchain_core/_api/deprecation.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":"libs/core/langchain_core/_api/beta_decorator.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"816771cfd6380d76fb9da06d004717cdd211fe523ccf73730592df4c22310e21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060openai_api_base and self.validate_base_url\u0060 appears character-identically in 3 files \u2014 libs/partners/openai/langchain_openai/chat_models/azure.py, libs/partners/openai/langchain_openai/embeddings/azure.py, libs/partners/openai/langchain_openai/llms/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":"libs/partners/openai/langchain_openai/chat_models/azure.py"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7048e440211f7026d72cd42e0b46c41453b62990de2a1662f0323974403640"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output_parser or PydanticAttrOutputFunctionsParser( pydantic_schema=_OutputFormatter, attr_name=\u0022output\u0022, )\u0060 appears character-identically in 2 files \u2014 libs/langchain/langchain_classic/chains/openai_functions/base.py, libs/langchain/langchain_classic/chains/structured_output/base.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":"libs/langchain/langchain_classic/chains/openai_functions/base.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e967f26892d70999597cda936aafdf157cf6b90212c96a563ebc84ba3f6ed6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output_parser or cls._get_default_output_parser()\u0060 appears character-identically in 4 files \u2014 libs/langchain/langchain_classic/agents/agent.py, libs/langchain/langchain_classic/agents/chat/base.py, libs/langchain/langchain_classic/agents/conversational_chat/base.py, libs/langchain/langchain_classic/agents/mrkl/base.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":"libs/langchain/langchain_classic/agents/agent.py"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0517f23c70b8e5ec6aeb9ae96d769f2118ac14d2a6280dda3c6b8b938c01ce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output_parser or get_openai_output_parser(functions)\u0060 appears character-identically in 2 files \u2014 libs/langchain/langchain_classic/chains/openai_functions/base.py, libs/langchain/langchain_classic/chains/structured_output/base.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":"libs/langchain/langchain_classic/chains/openai_functions/base.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b209a3c7cd648cd9e95307474029bb7c42b068396ce67d52eca2acd48874a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prompt or PROMPT_SELECTOR.get_prompt(llm)\u0060 appears character-identically in 2 files \u2014 libs/langchain/langchain_classic/chains/qa_generation/base.py, libs/langchain/langchain_classic/chains/retrieval_qa/base.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":"libs/langchain/langchain_classic/chains/qa_generation/base.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84d16e3a8722a395dd979d4ed4d4c9530fd87fbe50196fbbf880d0b68be64c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.tool is not None and request.tool.description\u0060 appears character-identically in 2 files \u2014 libs/langchain_v1/langchain/agents/middleware/auto_mode.py, libs/partners/openai/langchain_openai/middleware/auto_mode.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":"libs/langchain_v1/langchain/agents/middleware/auto_mode.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba446d8752dd4d6f912d9be4a5c01c7d9860ff9227f9b5499a1bea65b5a8bf4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060role == \u0022assistant\u0022 or default_class == AIMessageChunk\u0060 appears character-identically in 7 files \u2014 libs/partners/fireworks/langchain_fireworks/chat_models.py, libs/partners/groq/langchain_groq/chat_models.py, libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py, libs/partners/mistralai/langchain_mistralai/chat_models.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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb04dbab106a4e99ae82313afbf2fd765f7ba043c7bec40a152727775a036eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060role == \u0022function\u0022 or default_class == FunctionMessageChunk\u0060 appears character-identically in 5 files \u2014 libs/partners/fireworks/langchain_fireworks/chat_models.py, libs/partners/groq/langchain_groq/chat_models.py, libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py, libs/partners/openai/langchain_openai/chat_models/base.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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"8058884f4a937664e7a3d1f4a8e2075a084446f7857d7d0be4fe53ec625005ef"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060role == \u0022system\u0022 or default_class == SystemMessageChunk\u0060 appears character-identically in 6 files \u2014 libs/partners/fireworks/langchain_fireworks/chat_models.py, libs/partners/groq/langchain_groq/chat_models.py, libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py, libs/partners/mistralai/langchain_mistralai/chat_models.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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"350944aa0746174ac52eb3432d76ec1666972193217b343fcf9d5521bfa5b7bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060role == \u0022tool\u0022 or default_class == ToolMessageChunk\u0060 appears character-identically in 6 files \u2014 libs/partners/fireworks/langchain_fireworks/chat_models.py, libs/partners/groq/langchain_groq/chat_models.py, libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py, libs/partners/openai/langchain_openai/chat_models/base.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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd63257418dfd8dc486352ac670f4a0b8569b9db993488244e207016f9d2376f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060role == \u0022user\u0022 or default_class == HumanMessageChunk\u0060 appears character-identically in 7 files \u2014 libs/partners/fireworks/langchain_fireworks/chat_models.py, libs/partners/groq/langchain_groq/chat_models.py, libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py, libs/partners/mistralai/langchain_mistralai/chat_models.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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"0873237934ba6a849e1211717a7d9342160fd98027c320563349f7dc9bdb45da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060role or default_class == ChatMessageChunk\u0060 appears character-identically in 6 files \u2014 libs/partners/fireworks/langchain_fireworks/chat_models.py, libs/partners/groq/langchain_groq/chat_models.py, libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py, libs/partners/mistralai/langchain_mistralai/chat_models.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":"libs/partners/fireworks/langchain_fireworks/chat_models.py"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c665568370c296572bb33b554f22968d63d39cd0c6d66acffa99764057a4002"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run_manager and _signature_parameters(self.coroutine).get(\u0022callbacks\u0022)\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/tools/simple.py, libs/core/langchain_core/tools/structured.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":"libs/core/langchain_core/tools/simple.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2868392c4242808f0a4182658175ed52574da45c67207cebf0b9e7bd3e1dfdcc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run_manager and _signature_parameters(self.func).get(\u0022callbacks\u0022)\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/tools/simple.py, libs/core/langchain_core/tools/structured.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":"libs/core/langchain_core/tools/simple.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b7637ecad39972a110493b3fbf0b25cc630de3b33b86fbb7074bb324a962c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run_manager or AsyncCallbackManagerForChainRun.get_noop_manager()\u0060 appears character-identically in 10 files \u2014 libs/langchain/langchain_classic/chains/api/base.py, libs/langchain/langchain_classic/chains/combine_documents/base.py, libs/langchain/langchain_classic/chains/conversational_retrieval/base.py, libs/langchain/langchain_classic/chains/llm_math/base.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":"libs/langchain/langchain_classic/chains/api/base.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e2d6eb212df6857739efc7cc4b8859ce745f172f6a165b311793257e73137c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060run_manager or CallbackManagerForChainRun.get_noop_manager()\u0060 appears character-identically in 20 files \u2014 libs/langchain/langchain_classic/chains/api/base.py, libs/langchain/langchain_classic/chains/combine_documents/base.py, libs/langchain/langchain_classic/chains/constitutional_ai/base.py, libs/langchain/langchain_classic/chains/conversational_retrieval/base.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":"libs/langchain/langchain_classic/chains/api/base.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e47b8f502c2f0921235a7585127dc07dd88ad145be4b1a355c407bb9918edaa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.api_key is None or ( isinstance(self.api_key, SecretStr) and not self.api_key.get_secret_value().strip() )\u0060 appears character-identically in 2 files \u2014 libs/partners/openai/langchain_openai/decisions/base.py, libs/partners/openai/langchain_openai/decisions/classifier.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":"libs/partners/openai/langchain_openai/decisions/base.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32baf76117996c087ff7c982419c5e8d0d2c0e9d0ec2a787d71311f2536b0b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.azure_ad_token or self.azure_ad_token_provider or self.azure_ad_async_token_provider\u0060 appears character-identically in 3 files \u2014 libs/partners/openai/langchain_openai/chat_models/azure.py, libs/partners/openai/langchain_openai/embeddings/azure.py, libs/partners/openai/langchain_openai/llms/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":"libs/partners/openai/langchain_openai/chat_models/azure.py"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee518879f6cb8dbb7f1e381955239d243d171e1539853e83ac944ef1fc725edd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.error_on_chunk_number is not None and i_c == self.error_on_chunk_number\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/language_models/fake.py, libs/core/langchain_core/language_models/fake_chat_models.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":"libs/core/langchain_core/language_models/fake.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dd05ae614822e4a974482f439d4d36e486e8a2a5c44370cdb6ecaccc9e0fdc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.http_client or self.http_async_client\u0060 appears character-identically in 2 files \u2014 libs/partners/openai/langchain_openai/chat_models/base.py, libs/partners/openai/langchain_openai/embeddings/base.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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"4598c1a881cb1405432a59f53f0d045474a30ca606a38c3ed19fd62e61520c99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.huggingfacehub_api_token or os.getenv( \u0022HF_TOKEN\u0022 )\u0060 appears character-identically in 2 files \u2014 libs/partners/huggingface/langchain_huggingface/embeddings/huggingface_endpoint.py, libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.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":"libs/partners/huggingface/langchain_huggingface/embeddings/huggingface_endpoint.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c279fc196620ec325f1cabe2d97731a50cbf3e85014c182a9191db946b83fbf0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.include_names is None and self.include_types is None and self.include_tags is None\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/runnables/utils.py, libs/core/langchain_core/tracers/log_stream.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":"libs/core/langchain_core/runnables/utils.py"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c77e1958580553c1b62c93e813e17226b33cdc37e57d30bf6d6fd9b03c53eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.legacy and hasattr(self.retry_chain, \u0022arun\u0022)\u0060 appears character-identically in 2 files \u2014 libs/langchain/langchain_classic/output_parsers/fix.py, libs/langchain/langchain_classic/output_parsers/retry.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":"libs/langchain/langchain_classic/output_parsers/fix.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"289f9f9d3cd02d8c7c1205d456531b0b77ade25ade85fe46ea77976ece8793ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.legacy and hasattr(self.retry_chain, \u0022run\u0022)\u0060 appears character-identically in 2 files \u2014 libs/langchain/langchain_classic/output_parsers/fix.py, libs/langchain/langchain_classic/output_parsers/retry.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":"libs/langchain/langchain_classic/output_parsers/fix.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d61c676fd460a722948e5e293b066f67ab1ef76dfc499da34f1b199af2a7ed2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.n is not None and self.n \u003E 1 and self.streaming\u0060 appears character-identically in 3 files \u2014 libs/partners/openai/langchain_openai/chat_models/azure.py, libs/partners/openai/langchain_openai/chat_models/base.py, libs/partners/xai/langchain_xai/chat_models.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":"libs/partners/openai/langchain_openai/chat_models/azure.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06d2c9c7fcfdac437faf3c840d8931f43726014e314ec44a5a271c2b45993a3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.openai_organization or os.getenv(\u0022OPENAI_ORG_ID\u0022) or os.getenv(\u0022OPENAI_ORGANIZATION\u0022)\u0060 appears character-identically in 2 files \u2014 libs/partners/openai/langchain_openai/chat_models/azure.py, libs/partners/openai/langchain_openai/chat_models/base.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":"libs/partners/openai/langchain_openai/chat_models/azure.py"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"784326a5aef22bc4da81ef381f151b531f41f7ef1bd2c4b92b6fe0230fa7f031"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.openai_proxy and not self.http_async_client\u0060 appears character-identically in 2 files \u2014 libs/partners/openai/langchain_openai/chat_models/base.py, libs/partners/openai/langchain_openai/embeddings/base.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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da306fcf528fb3374e7cf9ef71859257b289de56798f824063347e3f66b084b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.openai_proxy and not self.http_client\u0060 appears character-identically in 2 files \u2014 libs/partners/openai/langchain_openai/chat_models/base.py, libs/partners/openai/langchain_openai/embeddings/base.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":"libs/partners/openai/langchain_openai/chat_models/base.py"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"0053ce30e599e67a144cda3ecd5e02793f56c3b43ced7773b2add767518bfd44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.parent_run_id or other.parent_run_id\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/callbacks/base.py, libs/core/langchain_core/callbacks/manager.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":"libs/core/langchain_core/callbacks/base.py"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"085412ea1a1fc65858a96aeb341b47d6d3119aed976c2c4c0f1fb966408727f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.reduce_k_below_max_tokens and isinstance( self.combine_documents_chain, StuffDocumentsChain, )\u0060 appears character-identically in 2 files \u2014 libs/langchain/langchain_classic/chains/qa_with_sources/retrieval.py, libs/langchain/langchain_classic/chains/qa_with_sources/vector_db.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":"libs/langchain/langchain_classic/chains/qa_with_sources/retrieval.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe52fb738df09080cf2cc1f04742db851c86b17c867e48cd95f5371543beb41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state is None or isinstance(state, (int, float, bool))\u0060 appears character-identically in 2 files \u2014 libs/partners/openai/langchain_openai/decisions/_classifier_input.py, libs/partners/typesafe/langchain_typesafe/_state.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":"libs/partners/openai/langchain_openai/decisions/_classifier_input.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"145481319c1bb8d77af85eda592e58644ce4ae86eba4a19c9e1ca37543844fd4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stop or params.get(\u0022stop\u0022, None) or self.stop\u0060 appears character-identically in 2 files \u2014 libs/partners/groq/langchain_groq/chat_models.py, libs/partners/openrouter/langchain_openrouter/chat_models.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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efe6686c685ac3521826a6449d63c97f675cefadd4b64f740852a259beb24ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060temperature is not None and temperature != 1\u0060 appears character-identically in 2 files \u2014 libs/partners/anthropic/langchain_anthropic/chat_models.py, libs/partners/openai/langchain_openai/chat_models/base.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":"libs/partners/anthropic/langchain_anthropic/chat_models.py"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7629f256feb873c26edd1e6cdf1dbe6206dc528c1bfa96c947b1e7d192aca1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060thread_limit is None and run_limit is None\u0060 appears character-identically in 2 files \u2014 libs/langchain_v1/langchain/agents/middleware/model_call_limit.py, libs/langchain_v1/langchain/agents/middleware/tool_call_limit.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":"libs/langchain_v1/langchain/agents/middleware/model_call_limit.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7899ad71c87f13a0262e8d8323a47fa13ceb2839a1a392906fd92660621e6f45"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060token_usage and isinstance(message, AIMessage)\u0060 appears character-identically in 5 files \u2014 libs/partners/groq/langchain_groq/chat_models.py, libs/partners/huggingface/langchain_huggingface/chat_models/huggingface.py, libs/partners/mistralai/langchain_mistralai/chat_models.py, libs/partners/openai/langchain_openai/chat_models/base.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":"libs/partners/groq/langchain_groq/chat_models.py"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f18749b0bc7df5c5d753fa1a541f5b587987d6b7e4452c60d9054e03e3f3f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060usage.get(\u0022total_tokens\u0022) or input_tokens \u002B output_tokens\u0060 appears character-identically in 2 files \u2014 libs/core/langchain_core/decisions/types.py, libs/partners/fireworks/langchain_fireworks/chat_models.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":"libs/core/langchain_core/decisions/types.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c1f240d40fd65bbfeb24a13870037352b98a6766d55290a99c3b8ae5f5e0d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value is None or isinstance(value, (str, int, float, bool))\u0060 appears character-identically in 2 files \u2014 libs/partners/openai/langchain_openai/decisions/_input.py, libs/partners/typesafe/langchain_typesafe/_state.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":"libs/partners/openai/langchain_openai/decisions/_input.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d5061d713733cd24c8bf5743888c79ecde4afe1655964b85a545cff04d1efc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060split_json\u0060 is public, takes a document from its caller (line 116) and hands it to \u0060_list_to_dict_preprocessing\u0060, which calls itself at line 75 (\u0060self._list_to_dict_preprocessing\u0060) with a piece of \u0060data\u0060 (and at line 79) \u2014 and nowhere in \u0060_list_to_dict_preprocessing\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_list_to_dict_preprocessing\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/text-splitters/langchain_text_splitters/json.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c835e1fdd0cd237f948adc71e1114014aba26d9875db6438c82a9868585d0f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060replace\u0060 is public and takes \u0060value: JsonValue\u0060 from its caller, and it calls itself at line 43 (\u0060self.replace\u0060) with a piece of \u0060value\u0060 (and at line 45) \u2014 and nowhere in \u0060replace\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 \u0060replace\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/typesafe/langchain_typesafe/_assets.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eec50601092e72e9ff10113a00cf56a26d4ec4fcdb98acdb6b740670dbcb16a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060merge_dicts\u0060 is public and takes \u0060left: dict[str, Any]\u0060 from its caller, and it calls itself at line 66 (\u0060merge_dicts\u0060) with a piece of \u0060left\u0060 \u2014 and nowhere in \u0060merge_dicts\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 \u0060merge_dicts\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/utils/_merge.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9b159b797c148f61b2e8aad174c4dcced4570ac41cbfc9138f3ceea889fd28"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060dereference_refs\u0060 is public, takes a document from its caller (line 188) and hands it to \u0060_dereference_refs_helper\u0060, which calls itself at line 136 (\u0060_dereference_refs_helper\u0060) with a piece of \u0060obj\u0060 (and at line 178) \u2014 and nowhere in \u0060_dereference_refs_helper\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_dereference_refs_helper\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/utils/json_schema.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0e97f9e22bb4788788a0e450a421b08f1370b8af8003c4e48b49214140c1a6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060stringify_value\u0060 is public and takes \u0060val: Any\u0060 from its caller, and it calls itself at line 21 (\u0060stringify_value\u0060) with a piece of \u0060val\u0060 \u2014 and nowhere in \u0060stringify_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 \u0060stringify_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/utils/strings.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dbc910ff97a75e440b94f44e64b858b34fa93f20d8a0c51189ff858b623c8a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060add_subgraph\u0060 is public and takes \u0060viz: Any\u0060 from its caller, and it calls itself at line 190 (\u0060self.add_subgraph\u0060) with a piece of \u0060viz\u0060 \u2014 and nowhere in \u0060add_subgraph\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 \u0060add_subgraph\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/runnables/graph_png.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a587da6655da54d48e4c36df04abc548f26bd6f2ebe238511f976121491e787b"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 161 is called with an argument built by \u0060sorted(overrides)\u0060 (line 163), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/langchain_v1/langchain/agents/middleware/model_fallback.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b83a44975906a0509dba2ccaf8d679b79c4abcc3680c346462a0c1f0b13c578"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: This condition tests \u0060others\u0060 for emptiness and then indexes it on a branch that test does not reach. \u0060others[0]\u0060 is evaluated whenever the guarded half is false \u2014 which includes the case the guard exists to anticipate, \u0060others\u0060 being empty \u2014 so an empty \u0060others\u0060 indexes position 0 of nothing and throws. This same condition already shows the intended bracketing at line 202: \u0060others[0]\u0060 sits INSIDE the guard. Either the guard is load-bearing, in which case this access escapes it and crashes, or \u0060others\u0060 cannot be empty here, in which case the guard beside it is dead code \u2014 the condition is wrong under both readings. Move the parenthesis so the emptiness test brackets every access to \u0060others\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/prompts/structured.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9702cab80b66e7a87f3f1202b39a90bc551097350c936c597f12791e68f35227"}},{"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":"libs/partners/openai/langchain_openai/chat_models/_client_utils.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6ed7ef36412ed872bd7101c31e22a92efba53296d5d550f479b8406e63833f"}},{"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":"libs/partners/openai/langchain_openai/chat_models/_client_utils.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"12382be85ebb64d9c1512064a21ed418e25e71e4e3f858cba90c3417a5e6f4f5"}},{"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. On a teardown path letting it propagate is not an option (throwing out of \u0060__del__()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/_client_utils.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"741119f012ded89f9420e78077dd23ce919067786525ee441c6b5f2d2b1fbc43"}},{"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. On a teardown path letting it propagate is not an option (throwing out of \u0060__del__()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/openai/langchain_openai/chat_models/_client_utils.py"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"757d2d3a7205550f7d7eadbac3d5adc722b844a657223ce65171170af2c33fcb"}},{"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. On a teardown path letting it propagate is not an option (throwing out of \u0060__del__()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/anthropic/langchain_anthropic/_client_utils.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc9923690d651d93f7d2f1cb05d88223df3b28b9813bf549084685dbb97717f"}},{"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. On a teardown path letting it propagate is not an option (throwing out of \u0060__del__()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/anthropic/langchain_anthropic/_client_utils.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d8e729d4c85a25576a90717ba801c1c7afaa77a161848dcf9c2a4a1ea50ac9"}},{"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":"libs/langchain_v1/langchain/agents/middleware/summarization.py"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f0b520f8711b6055b9e5454d2da652283886df9987da5a80830a2eb1d4e9f0"}},{"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":"libs/core/langchain_core/sys_info.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69dfe097c04c1bae383e31a256744a1bb8dfee3b8b29d66535ccd4436a0e4a2"}},{"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":"libs/core/langchain_core/sys_info.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1fc97926a1d664052fe8e9b6dc038465c89531b7c6af27cdf1d78a4bfe1daf"}},{"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":"libs/core/langchain_core/sys_info.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbfd31ce32dd11677b7b5f9441a2f3d5f83126985b54f70082d32d054181913"}},{"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":"libs/core/langchain_core/tracers/core.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd900ee44c1e25f182e41299095d7feb4f01d6d4673879a89209bb2d8b68339"}},{"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":"libs/core/langchain_core/tracers/stdout.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4a76ec3e640fe16744dd6e04d298a9c9d7420cd5ec5faef7c7ff1ba37a314b"}},{"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":"libs/core/langchain_core/runnables/base.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"93da890cd05ef07a78dee309b446ed66b2751849ca57a9b13120e57be4da4c07"}},{"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":"libs/core/langchain_core/load/serializable.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba63227f1f48a34f6fe62f0b73c6feeac7b33aeadaa76757f37efeee1390d43"}},{"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":"libs/core/langchain_core/load/serializable.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed800d9bc0ec5fa9f5364a5daa1c2fd4e434383377f45a51118921a5c13919a"}},{"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":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc432f0fc234eb6fc47fe36fae735a4e39fe777145fae185f6bdaa02856ae62"}},{"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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3ba9e25746342c41f5d3bda8f179983981a943b8a36eaaac2d99d4b4789312"}},{"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":"libs/core/langchain_core/language_models/chat_models.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"08de3644158c3e1b473907c95e4d25bf3495c2ee714ce41ba0ebe46306206637"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 309 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/huggingface/langchain_huggingface/llms/huggingface_endpoint.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8eebec3c1d7f97cf9025beb631e00f4e2844cf2ee1b9912a7b172ecaa351f6b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 231 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/partners/huggingface/langchain_huggingface/llms/huggingface_pipeline.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3102750501686e3f9938c0897dad94465025c99cfef47c71183d9cf69080f85a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/messages/block_translators/groq.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"009cb10e9d99c8bf7f3eac536684439c903eca091bd83347363317608d4fb9f6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_iter_protocol_blocks\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/core/langchain_core/language_models/_compat_bridge.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e386e4ea5fddb73c0d27270c33d1f7ae53d80575abab524825811913870d7ec8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060get_function_nonlocals\u0060 returns \u0060[]\u0060 when \u0060(SyntaxError, TypeError, OSError, SystemError)\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":"libs/core/langchain_core/runnables/utils.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"287373a27eb919bee68559d9055fc584b3704e126305c094a61cd6403941b709"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060glob_search\u0060 (in \u0060__init__\u0060) returns \u0060\u0027No files found\u0027\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":"libs/langchain_v1/langchain/agents/middleware/file_search.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"096667a48d0c795e8023d53b82e74cf12512775c7fa0f63e3d76ae5b196f6730"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_ripgrep_search\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":"libs/langchain_v1/langchain/agents/middleware/file_search.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec806268c7d0f2e8ddbe3a0136f7fe101af615a7914d5ca41e8274549ebc4c75"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_python_search\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":"libs/langchain_v1/langchain/agents/middleware/file_search.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"26792d975f1729fe6e6801dc87cbe2e9f0ae7f14fe8f6524eb1facd573d0042d"}}],"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-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-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.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-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":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_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-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":60,"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."]}]}