{"$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":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"]}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"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":"PartialFillExchange::ack_new (cyclomatic 51): PartialFillExchange::ack_new has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: hftbacktest/src/backtest/proc/partialfillexchange.rs holds 2 of the 28 functions over the threshold \u2014 including the worst \u2014 and 47 of the 162 points over it (29%), 2.5\u00D7 the next-largest file (py-hftbacktest/hftbacktest/data/utils/difforderbooksnapshot.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"805fb79ca90eb39a53fd6133d835467221863ad1bd7fe9a132101e694564dc46"}},{"ruleId":"D1","level":"warning","message":{"text":"DiffOrderBookSnapshot.snapshot (cyclomatic 34): DiffOrderBookSnapshot.snapshot 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":"py-hftbacktest/hftbacktest/data/utils/difforderbooksnapshot.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"727f9c80ebc040fad3ddd156d7cb469d451999402ad7ea40ff2d607434adfe6c"}},{"ruleId":"D1","level":"warning","message":{"text":"NoPartialFillExchange::process (cyclomatic 26): NoPartialFillExchange::process 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"26afa27d903b789225391313b6da173cc7b6057fef8d0a19f618d2e318f74026"}},{"ruleId":"D1","level":"warning","message":{"text":"PartialFillExchange::process (cyclomatic 26): PartialFillExchange::process 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: hftbacktest/src/backtest/proc/partialfillexchange.rs holds 2 of the 28 functions over the threshold \u2014 including the worst \u2014 and 47 of the 162 points over it (29%), 2.5\u00D7 the next-largest file (py-hftbacktest/hftbacktest/data/utils/difforderbooksnapshot.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"748c6101daaedf41e0df891673f8807c68247ef1d9edc3822abd37c10749ecd7"}},{"ruleId":"D1","level":"warning","message":{"text":"ROIVectorMarketDepth::modify_order (cyclomatic 26): ROIVectorMarketDepth::modify_order 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":"hftbacktest/src/depth/roivectormarketdepth.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"038c6f2ffba5e76b96ad723ce79fc9821dc4652f10a77a8a73ce6651d453637e"}},{"ruleId":"D1","level":"warning","message":{"text":"PrivateStream::handle_private_stream (cyclomatic 23): PrivateStream::handle_private_stream 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":"connector/src/bybit/private_stream.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a1a539d4b79d0304396e6ef3049fa4f3213ebac56075cea611fe28a13f253d"}},{"ruleId":"D1","level":"warning","message":{"text":"UserDataStream::connect (cyclomatic 21): UserDataStream::connect 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":"connector/src/binancespot/user_data_stream.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cedaed46ed7a2696ff30f25d83729da7c18be11a72483ee1e1b9dad9822f00d"}},{"ruleId":"D1","level":"warning","message":{"text":"LiveBot::process_event (cyclomatic 21): LiveBot::process_event 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":"hftbacktest/src/live/bot.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eae4fcc56ca45b6412ca2877baef8cec0450514a30de3275aac1a36ef2a1c3f"}},{"ruleId":"D1","level":"warning","message":{"text":"binancefutures.convert (cyclomatic 21): binancefutures.convert 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":"py-hftbacktest/hftbacktest/data/utils/binancefutures.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a7d107954958ce4e253c19421b8eb5bf693dc377e26a7cb583a42f8091102c"}},{"ruleId":"D1","level":"warning","message":{"text":"UserDataStream::connect (cyclomatic 20): UserDataStream::connect has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/binancefutures/user_data_stream.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8759795e76bd0a7fe31aa3eda229aaa0bd3199c7ced8806e8cf609ab567da58"}},{"ruleId":"D1","level":"warning","message":{"text":"L3NoPartialFillExchange::process (cyclomatic 20): L3NoPartialFillExchange::process 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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62f31ac873b1bb98b89b62a7ae300da9732af2261d660b2acdc639d2624d9d4"}},{"ruleId":"D1","level":"warning","message":{"text":"hyperliquid.convert (cyclomatic 20): hyperliquid.convert 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":"py-hftbacktest/hftbacktest/data/utils/hyperliquid.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f81c4d9ae7a754f4c2d96e8e375c741bf68b8f3ce9471b032be9d69577096d9"}},{"ruleId":"D1","level":"warning","message":{"text":"ROIVectorMarketDepth::clear_depth (cyclomatic 18): ROIVectorMarketDepth::clear_depth 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":"hftbacktest/src/depth/roivectormarketdepth.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25e4ac1a8084957b7c4709d0ffddfbbd1e4578271345f58846bf0307badd2b5"}},{"ruleId":"D1","level":"warning","message":{"text":"hftbacktest_derive::dtype_derive (cyclomatic 18): hftbacktest_derive::dtype_derive has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest-derive/src/lib.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70199e7b99918d672b6899ba0f7e800ce596450df21ed82af30f41c89b633b6"}},{"ruleId":"D1","level":"warning","message":{"text":"binancehistmktdata.convert (cyclomatic 18): binancehistmktdata.convert 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":"py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"855ea5e5bad98962c5d7aa07d84d98abf2d0061453a4294b11886bff5da9a51a"}},{"ruleId":"D1","level":"warning","message":{"text":"bybithistmktdata.convert (cyclomatic 18): bybithistmktdata.convert 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":"py-hftbacktest/hftbacktest/data/utils/bybithistmktdata.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8c1d56c24a88219021b53b6a796594655db0ee5e32bafeb071f340eea507b9"}},{"ruleId":"D1","level":"warning","message":{"text":"collector::hyperliquid::http::connect (cyclomatic 17): collector::hyperliquid::http::connect 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":"collector/src/hyperliquid/http.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a19bc128bc7ae40a2b565df1dbe8a5c8c6fe25b253fdc144f888e0048810781"}},{"ruleId":"D1","level":"warning","message":{"text":"Backtest::goto (cyclomatic 17): Backtest::goto 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":"hftbacktest/src/backtest/mod.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"41934f12d8b954bf5a50b61d2693346d1d0e2d53259fb4b7313c127534245b53"}},{"ruleId":"D1","level":"warning","message":{"text":"L3FIFOQueueModel::modify_backtest_order (cyclomatic 17): L3FIFOQueueModel::modify_backtest_order 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. This shape REPEATS in the file: one other method here (L3FIFOQueueModel::modify_market_feed_order) 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb92a45b61d1b871f389307843a40349237afd3608597f288901e94605fa83f3"}},{"ruleId":"D1","level":"warning","message":{"text":"L3FIFOQueueModel::modify_market_feed_order (cyclomatic 17): L3FIFOQueueModel::modify_market_feed_order 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. This shape REPEATS in the file: one other method here (L3FIFOQueueModel::modify_backtest_order) 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a083f501aac1034d5daf7b002780bd7148608f2833b58e241fb2ba0a01a143"}},{"ruleId":"D1","level":"warning","message":{"text":"L3NoPartialFillExchange::ack_new (cyclomatic 17): L3NoPartialFillExchange::ack_new has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbd3902b36308d959bf8c6ac9b0de9dab8a3770f30dd1d204a86f8a24821998"}},{"ruleId":"D1","level":"warning","message":{"text":"NoPartialFillExchange::ack_new (cyclomatic 17): NoPartialFillExchange::ack_new has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"06991e42c45062aa1a373ab0166b152925be34dd82ac5a6b41d08ac4d603bb11"}},{"ruleId":"D1","level":"warning","message":{"text":"FusedHashMapMarketDepth::update_bid_depth (cyclomatic 17): FusedHashMapMarketDepth::update_bid_depth 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. This shape REPEATS in the file: one other method here (FusedHashMapMarketDepth::update_ask_depth) 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd50349c721eae87eab93937271c784d5fe0522365fef6d8104bab1754bd9528"}},{"ruleId":"D1","level":"warning","message":{"text":"FusedHashMapMarketDepth::update_ask_depth (cyclomatic 17): FusedHashMapMarketDepth::update_ask_depth 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. This shape REPEATS in the file: one other method here (FusedHashMapMarketDepth::update_bid_depth) 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6312b0aae1fa62d6294a138775eae9bf3e731029427ed75ace9c718b6fb020b3"}},{"ruleId":"D1","level":"warning","message":{"text":"databento.convert (cyclomatic 17): databento.convert 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":"py-hftbacktest/hftbacktest/data/utils/databento.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7de62b3aa93d7f9c3b1fcbd1b3bec4d42b09caffbdec79c3fa1c6171b986692"}},{"ruleId":"D1","level":"warning","message":{"text":"L3FIFOQueueModel::fill_market_feed_order (cyclomatic 16): L3FIFOQueueModel::fill_market_feed_order 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"44292fa67fc86702583da94cf741d77f1699b8d53a4faaf6c900092bdeba50a0"}},{"ruleId":"D1","level":"warning","message":{"text":"mexc.convert (cyclomatic 16): mexc.convert 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":"py-hftbacktest/hftbacktest/data/utils/mexc.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae3698f9720ab88cbfba083d28c5c7d7333de00e629c48de663faa7b4c8af9e"}},{"ruleId":"D1","level":"warning","message":{"text":"tardis.convert (cyclomatic 16): tardis.convert 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":"py-hftbacktest/hftbacktest/data/utils/tardis.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e65b9df782b253f202e604ecce52592f7bee7b26d45f8df4bccb955d21b410"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialFillExchange::ack_new (cognitive 194): PartialFillExchange::ack_new has cognitive complexity 194 (threshold 15). Drivers by points: if/else 29 (129 pts), loops 10 (48 pts), match/switch 6 (17 pts) (nesting depth added 149). 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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"06edf119e07df498809e6de5acf53d080275bb8cb27ec5904f83c21450279522"}},{"ruleId":"D2","level":"warning","message":{"text":"ROIVectorMarketDepth::modify_order (cognitive 80): ROIVectorMarketDepth::modify_order has cognitive complexity 80 (threshold 15). Drivers by points: if/else 22 (74 pts), boolean chains 6 (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":"hftbacktest/src/depth/roivectormarketdepth.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c6cd303468c633e2206ba8d1f633d1b3f50530c28eb9b9c7ff0c3411e7d427"}},{"ruleId":"D2","level":"warning","message":{"text":"DiffOrderBookSnapshot.snapshot (cognitive 67): DiffOrderBookSnapshot.snapshot has cognitive complexity 67 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 12 (18 pts), boolean chains 1 (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":"py-hftbacktest/hftbacktest/data/utils/difforderbooksnapshot.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d367abd71e3d033f0c8a7c817bd69fb6b0a638e794888318387813b7fbc56c0"}},{"ruleId":"D2","level":"warning","message":{"text":"NoPartialFillExchange::process (cognitive 59): NoPartialFillExchange::process has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 6 (22 pts), boolean chains 4 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2ec7b601429ba2220952c074330fd25fcbba55ee937440f6a87ff17b4bf329"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialFillExchange::process (cognitive 59): PartialFillExchange::process has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 6 (22 pts), boolean chains 4 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f32b8165decd84283652fa9f12e45a869e55e4e89d97abeb5637190bef3f439"}},{"ruleId":"D2","level":"warning","message":{"text":"bybithistmktdata.convert (cognitive 54): bybithistmktdata.convert has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (29 pts), ternaries 4 (17 pts), loops 4 (8 pts) (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":"py-hftbacktest/hftbacktest/data/utils/bybithistmktdata.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03fedce5010b0e6e8ff08f19faffa44d8e287706055f068a0310a8ca09cc70d"}},{"ruleId":"D2","level":"warning","message":{"text":"PrivateStream::handle_private_stream (cognitive 50): PrivateStream::handle_private_stream has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (25 pts), match/switch 5 (13 pts), loops 5 (12 pts) (nesting depth added 31). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/bybit/private_stream.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce666e86f5355c3bb19565c17e9b37b8ac3e2fbabd9e8830550417f06b13244"}},{"ruleId":"D2","level":"warning","message":{"text":"binancehistmktdata.convert (cognitive 49): binancehistmktdata.convert has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (43 pts), ternaries 2 (4 pts), loops 2 (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":"py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94095cbf72dc59a3ae4a96e9c47bcd498e74f0c59e664c9e6923772d8aee3a0"}},{"ruleId":"D2","level":"warning","message":{"text":"HashMapMarketDepth::modify_order (cognitive 46): HashMapMarketDepth::modify_order has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (46 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":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"7136ce22e795fc65b9338ab287da64b3a32678c476faa95b3de45c038745b986"}},{"ruleId":"D2","level":"warning","message":{"text":"binancefutures.convert (cognitive 45): binancefutures.convert has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 5 (17 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-hftbacktest/hftbacktest/data/utils/binancefutures.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b871544dd37fb574b126956990b7a0eed8d07c42dc8f05885a7617a4692f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"hyperliquid.convert (cognitive 45): hyperliquid.convert has cognitive complexity 45 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 6 (16 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-hftbacktest/hftbacktest/data/utils/hyperliquid.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"26be1a43e06046204c7e1b43cd0cdbea3f22e89192b458f55ad68f39fd52c746"}},{"ruleId":"D2","level":"warning","message":{"text":"ROIVectorMarketDepth::clear_depth (cognitive 43): ROIVectorMarketDepth::clear_depth has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 2 (8 pts), match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/roivectormarketdepth.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"170640c035609a5cc372ff4ddc6eac155ffd73fca996c468692298afbfb0ca49"}},{"ruleId":"D2","level":"warning","message":{"text":"L3FIFOQueueModel::modify_backtest_order (cognitive 41): L3FIFOQueueModel::modify_backtest_order has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (L3FIFOQueueModel::modify_market_feed_order) 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eac12e27480b4317b882e0991b06daa9f8cdcb10b1a56b4b45e8b7d214d6238"}},{"ruleId":"D2","level":"warning","message":{"text":"L3FIFOQueueModel::modify_market_feed_order (cognitive 41): L3FIFOQueueModel::modify_market_feed_order has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (32 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (L3FIFOQueueModel::modify_backtest_order) 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd9d3c7c4692279a9c3f2e365a46d05c3ebc53a115dbb45617f82ba770d7b82"}},{"ruleId":"D2","level":"warning","message":{"text":"FusedHashMapMarketDepth::update_bid_depth (cognitive 39): FusedHashMapMarketDepth::update_bid_depth has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 1 (4 pts), boolean chains 3, match/switch 1 (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. This shape REPEATS in the file: one other method here (FusedHashMapMarketDepth::update_ask_depth) 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9667ebd4c538190db840450c8f76fe330aaa31fcd97a579e0269da52173d6b"}},{"ruleId":"D2","level":"warning","message":{"text":"FusedHashMapMarketDepth::update_ask_depth (cognitive 39): FusedHashMapMarketDepth::update_ask_depth has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 1 (4 pts), boolean chains 3, match/switch 1 (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. This shape REPEATS in the file: one other method here (FusedHashMapMarketDepth::update_bid_depth) 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b81501a019d5fb099d6f0ab6d521b30f9aaeba43ba7bb2bceb072324b6e7c5"}},{"ruleId":"D2","level":"warning","message":{"text":"_Fuse.process_depth (cognitive 39): _Fuse.process_depth has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (11 pts), ternaries 1 (4 pts), boolean chains 2 (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":"py-hftbacktest/hftbacktest/data/utils/tardis.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"411f5fc0bd2d42642fb180260e1444e88dd4160df76e96a7277edbca4ccf186d"}},{"ruleId":"D2","level":"warning","message":{"text":"mexc.convert (cognitive 37): mexc.convert has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 6 (16 pts), ternaries 1 (4 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":"py-hftbacktest/hftbacktest/data/utils/mexc.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f2ef4d615cab5adb5d494f9aefcf60bbdc0304651eb026daae281f3dfbbd12"}},{"ruleId":"D2","level":"warning","message":{"text":"HashMapMarketDepth::clear_depth (cognitive 35): HashMapMarketDepth::clear_depth has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (8 pts), match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"39541bd7d26cfffe55fab394690bbbe85eccc0a148fae26b85116880e4fa0e54"}},{"ruleId":"D2","level":"warning","message":{"text":"hftbacktest_derive::build_asset (cognitive 35): hftbacktest_derive::build_asset has cognitive complexity 35 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 4 (14 pts), match/switch 1 (6 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":"hftbacktest-derive/src/lib.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e372c188aad1accc957fb554a97ddbfe7ff1c607a03f83ed1f263f2ee9dcfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"Backtest::goto (cognitive 33): Backtest::goto has cognitive complexity 33 (threshold 15). Drivers by points: if/else 4 (16 pts), match/switch 5 (14 pts), loops 2, boolean chains 1 (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":"hftbacktest/src/backtest/mod.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c66b4102c52a2ed4c989a1fb477bad6ef4409f0e1a1c3dbdcbd6539cccb65bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Local::process_recv_order_ (cognitive 32): Local::process_recv_order_ has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/local.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e1200460c00ccad97c854f5d4dd3baad502c79a382fa9969cd28d9a3f68f07"}},{"ruleId":"D2","level":"warning","message":{"text":"ROIVectorMarketDepth::delete_order (cognitive 32): ROIVectorMarketDepth::delete_order has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (30 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":"hftbacktest/src/depth/roivectormarketdepth.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f56d78735586a4904474de7c19106bd4528d34cc92560f968de67ad2024a770"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeMarketDepth::clear_depth (cognitive 31): BTreeMarketDepth::clear_depth has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (8 pts), match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f7f35bd8ac0d70fdfc25683feaf833b90b43a6991ad736f53bc88dcd4ac88c"}},{"ruleId":"D2","level":"warning","message":{"text":"UserDataStream::connect (cognitive 30): UserDataStream::connect has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 4 (12 pts), loops 2 (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":"connector/src/binancespot/user_data_stream.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"39469a4b084b7f1f175a22f263559cc378ed9ebb349e983ff1c4db498adf60e2"}},{"ruleId":"D2","level":"warning","message":{"text":"L3NoPartialFillExchange::process (cognitive 30): L3NoPartialFillExchange::process has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 4 (9 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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fc06212cf55f39a57e6f4e144f47dbfde4eb2a18f32c313f2cdb0f9dbf9cd9"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveBot::process_event (cognitive 30): LiveBot::process_event has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/live/bot.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27702ed8fab01e2540acda9367705d1e95eefe59880911149c6a880c56f5c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"bybit._convert_depth (cognitive 30): bybit._convert_depth has cognitive complexity 30 (threshold 15). Drivers by points: loops 5 (16 pts), if/else 5 (11 pts), ternaries 1 (3 pts) (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-hftbacktest/hftbacktest/data/utils/bybit.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b95a7063d534001798349dc018c28ee2437fc015843453cb2ec0f55c4b0f43f"}},{"ruleId":"D2","level":"warning","message":{"text":"tardis._convert_depth (cognitive 30): tardis._convert_depth has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (24 pts), ternaries 1 (3 pts), boolean chains 2, 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":"py-hftbacktest/hftbacktest/data/utils/tardis.py"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"444f7577c1d460d1b2441c24f57765e7ccc469cc20b6db9ff020c8fdd504625f"}},{"ruleId":"D2","level":"warning","message":{"text":"L3FIFOQueueModel::fill_market_feed_order (cognitive 29): L3FIFOQueueModel::fill_market_feed_order has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (8 pts), match/switch 3 (7 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"646d06c4736c54479e28086c79ad4de3886b4f50066eb2eb421a620b4547c950"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeMarketDepth::modify_order (cognitive 28): BTreeMarketDepth::modify_order has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (28 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2d168d7421c702c89614b9c5b11c23c9f788c89cc23f8545267e0aee9b44c4"}},{"ruleId":"D2","level":"warning","message":{"text":"binancehistmktdata.convert_snapshot (cognitive 28): binancehistmktdata.convert_snapshot has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (25 pts), ternaries 1 (2 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0e2c594f560d013a079f10694a0819ad5198ceafa2da532d375ba8cfd291f2"}},{"ruleId":"D2","level":"warning","message":{"text":"UserDataStream::connect (cognitive 27): UserDataStream::connect has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 4 (12 pts), loops 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":"connector/src/binancefutures/user_data_stream.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd50bb3648807f02714d6c7aabfc1cd42d68c8edd61035bb9e10d2b9ce38dfc1"}},{"ruleId":"D2","level":"warning","message":{"text":"connector::run_publish_task (cognitive 27): connector::run_publish_task has cognitive complexity 27 (threshold 15). Drivers by points: loops 4 (14 pts), match/switch 3 (9 pts), if/else 1 (4 pts) (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/main.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a707da62678f36522aa1afcac93a1269cdc068721ea9a9324ef6d2edab8951"}},{"ruleId":"D2","level":"warning","message":{"text":"PublicStream::handle_public_stream (cognitive 25): PublicStream::handle_public_stream has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 5 (9 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/bybit/public_stream.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b77c5a7b54fade71a3db7487537030f84e669caab43fc51d93bec9ee34135f"}},{"ruleId":"D2","level":"warning","message":{"text":"L3Local::process_recv_order (cognitive 25): L3Local::process_recv_order has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 13). 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":"hftbacktest/src/backtest/proc/l3_local.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc360b143b32b3a21a8be41b412f2022903a2c40efb6bd979b5567e874c6f5c"}},{"ruleId":"D2","level":"warning","message":{"text":"L3NoPartialFillExchange::ack_new (cognitive 25): L3NoPartialFillExchange::ack_new has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 7 (11 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"024644e40d4e74019432e7ba0dd251bf3e8963b6de864525fe5573177c657faf"}},{"ruleId":"D2","level":"warning","message":{"text":"NoPartialFillExchange::ack_new (cognitive 25): NoPartialFillExchange::ack_new has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 7 (11 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49b0a32ae73f5973a7e6339c02f88aa411c4f44a96cfc17c0d51a3166530d89"}},{"ruleId":"D2","level":"warning","message":{"text":"FusedHashMapMarketDepth::clear_depth (cognitive 25): FusedHashMapMarketDepth::clear_depth has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (6 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdcbf50d692b407f489b5efeb169d61680f952314287faa87153b0048f14b36"}},{"ruleId":"D2","level":"warning","message":{"text":"collector::hyperliquid::handle (cognitive 24): collector::hyperliquid::handle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 1 (3 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":"collector/src/hyperliquid/mod.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64d33b56d3d1982a7c3275befecf4cf875440b8348fbae818689c6c7a86d44a"}},{"ruleId":"D2","level":"warning","message":{"text":"MarketDataStream::process_message (cognitive 23): MarketDataStream::process_message has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 4 (8 pts), loops 2 (6 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa02ffc24f687563415874dfe57b9732766cc5d5210131d8f2bf3c6596af6db2"}},{"ruleId":"D2","level":"warning","message":{"text":"MarketDataStream::process_message (cognitive 23): MarketDataStream::process_message has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 4 (8 pts), loops 2 (6 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/binancespot/market_data_stream.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7dad86000629483c4daff2e56b002568e8d6c52c302bedb595ccb67f2983992"}},{"ruleId":"D2","level":"warning","message":{"text":"L3FIFOQueueModel::fill_bid_between (cognitive 23): L3FIFOQueueModel::fill_bid_between has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (L3FIFOQueueModel::fill_ask_between) 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c0c1270e88eeb8eb07e73df8320ade0af4142cc953eed3420fb5a1d1a7d267"}},{"ruleId":"D2","level":"warning","message":{"text":"L3FIFOQueueModel::fill_ask_between (cognitive 23): L3FIFOQueueModel::fill_ask_between has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (L3FIFOQueueModel::fill_bid_between) 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d62da9480379bcbef9f0c83b53be096d082005d3422a69a1c45a7c204b17399"}},{"ruleId":"D2","level":"warning","message":{"text":"bybit.convert_fused (cognitive 23): bybit.convert_fused has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (5 pts), ternaries 1 (5 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":"py-hftbacktest/hftbacktest/data/utils/bybit.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"19553490a9e55ea12d20df40998751460b61b2592576881bb0e7d335d4af5bac"}},{"ruleId":"D2","level":"warning","message":{"text":"FusedHashMapMarketDepth::update_best_bid (cognitive 22): FusedHashMapMarketDepth::update_best_bid has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), boolean chains 3, match/switch 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. This shape REPEATS in the file: one other method here (FusedHashMapMarketDepth::update_best_ask) 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5b99fa589d7a1a2340c1439b0d4bbb3efcd3397c9fbf9a3e0b3a6b49c5ed17"}},{"ruleId":"D2","level":"warning","message":{"text":"FusedHashMapMarketDepth::update_best_ask (cognitive 22): FusedHashMapMarketDepth::update_best_ask has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), boolean chains 3, match/switch 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. This shape REPEATS in the file: one other method here (FusedHashMapMarketDepth::update_best_bid) 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8f6c7dcd28d0ba10b9c8f44d1b2fe548130a33fdc6360b07e23cc149a6eb76"}},{"ruleId":"D2","level":"warning","message":{"text":"IceoryxUnifiedChannel::recv_timeout (cognitive 22): IceoryxUnifiedChannel::recv_timeout has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (6 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":"hftbacktest/src/live/ipc/iceoryx.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84e0d1356108889b6537fba95104d655bc892acdf88ea421525bd87137e4950"}},{"ruleId":"D2","level":"warning","message":{"text":"py_hftbacktest::fuse::fusemarketdepth_process_event (cognitive 22): py_hftbacktest::fuse::fusemarketdepth_process_event has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (22 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":"py-hftbacktest/src/fuse.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9198277a85ac41403fd4eb5a9434c1ff2208eaa6481377f405391cad5d7c7761"}},{"ruleId":"D2","level":"warning","message":{"text":"PrivateStream::connect (cognitive 21): PrivateStream::connect has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 2 (8 pts), loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/bybit/private_stream.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"240847b4d85c25268216cc2ab29d84712f0faeab75e9dd1c27bf84fe3a9efc08"}},{"ruleId":"D2","level":"warning","message":{"text":"connector::handle_ev (cognitive 21): connector::handle_ev has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 6 (8 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/main.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b2e08e3d9dcddfa79ce0ecc88292d6f9ef26284e89d090df31e24741c3a29b"}},{"ruleId":"D2","level":"warning","message":{"text":"collector::hyperliquid::http::connect (cognitive 20): collector::hyperliquid::http::connect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (4 pts), loops 3, 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":"collector/src/hyperliquid/http.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3af1ff319aeb2449f30c55cff23349764a28856ee19003b918c2e8b611ba11"}},{"ruleId":"D2","level":"warning","message":{"text":"collector::binancefuturesum::http::connect (cognitive 20): collector::binancefuturesum::http::connect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 pts), 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":"collector/src/binancefuturesum/http.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b539d2265623bda1b2ef9698f2198c246701be75e9751cc2c4e427541fe2b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"collector::binance::http::connect (cognitive 20): collector::binance::http::connect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 pts), 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":"collector/src/binance/http.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea348ab1a4ef2cf6dcd3fe377122e5333cb7cc6595dab210dc7da05cb8cfed6f"}},{"ruleId":"D2","level":"warning","message":{"text":"collector::binancefuturescm::http::connect (cognitive 20): collector::binancefuturescm::http::connect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 pts), 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":"collector/src/binancefuturescm/http.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cab08cb4ff3db198aa285b97f44896431070d15872ad20fa975ee2599eb27a0"}},{"ruleId":"D2","level":"warning","message":{"text":"HashMapMarketDepth::delete_order (cognitive 20): HashMapMarketDepth::delete_order has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (20 pts) (nesting depth added 12). 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":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef29c6f0647d66ef73a415b06654137c0752a3f4f3735565afd23abc8b6c9acb"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveBot::elapse_ (cognitive 20): LiveBot::elapse_ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/live/bot.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a50a63e7446137ad9a1064a4ff18ef13b9c82a2e70693639a07ecb2d2cbfdcf"}},{"ruleId":"D2","level":"warning","message":{"text":"tardis.convert (cognitive 20): tardis.convert has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-hftbacktest/hftbacktest/data/utils/tardis.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7948413892f68498eaaa27fb2d2ff27b2f48975b1cfc980ce8ce9b51d6a3ca9b"}},{"ruleId":"D2","level":"warning","message":{"text":"collector::bybit::http::connect (cognitive 19): collector::bybit::http::connect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (7 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"collector/src/bybit/http.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c97ce7bdac26c52babaace60cefdd3220a7a396c7456e308d5c9fa71dbfaae"}},{"ruleId":"D2","level":"warning","message":{"text":"NpyHeader::from_header (cognitive 18): NpyHeader::from_header has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (11 pts), loops 3 (7 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/data/npy/mod.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f556c6857aeae224238d9771d72e16865d806f1e0276ce95f094e46e974e67"}},{"ruleId":"D2","level":"warning","message":{"text":"IntpOrderLatency::entry (cognitive 18): IntpOrderLatency::entry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, 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":"hftbacktest/src/backtest/models/latency.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1bdbcdd0c9940b1887ca9f5e3e20992fea9719ff5adffca442554c6c27e908"}},{"ruleId":"D2","level":"warning","message":{"text":"NoPartialFillExchange::on_best_bid_update (cognitive 18): NoPartialFillExchange::on_best_bid_update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (8 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. This shape REPEATS in the file: one other method here (NoPartialFillExchange::on_best_ask_update) 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ae44cb2e5b35a3a4b3929d0abf59e11ceb1ec8c9a9e8c1a7d6937d4384bf15"}},{"ruleId":"D2","level":"warning","message":{"text":"NoPartialFillExchange::on_best_ask_update (cognitive 18): NoPartialFillExchange::on_best_ask_update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (8 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. This shape REPEATS in the file: one other method here (NoPartialFillExchange::on_best_bid_update) 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1895fd83a8fba2aa872bee40a9fdf1f47f08648950524ffbdc1b07159f94485"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialFillExchange::on_best_bid_update (cognitive 18): PartialFillExchange::on_best_bid_update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (8 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. This shape REPEATS in the file: one other method here (PartialFillExchange::on_best_ask_update) 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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb55cdb300b277af59aab3a8f87fc2fc72dc2b55439276af1b51c573a40c946"}},{"ruleId":"D2","level":"warning","message":{"text":"PartialFillExchange::on_best_ask_update (cognitive 18): PartialFillExchange::on_best_ask_update has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (8 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. This shape REPEATS in the file: one other method here (PartialFillExchange::on_best_bid_update) 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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f5bf224a73f236884f9e5c08b236c5b3e50dbb9732dc6f338ee4238829e469"}},{"ruleId":"D2","level":"warning","message":{"text":"HashMapMarketDepth::update_bid_depth (cognitive 18): HashMapMarketDepth::update_bid_depth has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 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. This shape REPEATS in the file: one other method here (HashMapMarketDepth::update_ask_depth) 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":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8270d19f551ea16b7a27f362c2e9f9f53583272dc2fa49731ffba0f69fba8d"}},{"ruleId":"D2","level":"warning","message":{"text":"HashMapMarketDepth::update_ask_depth (cognitive 18): HashMapMarketDepth::update_ask_depth has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 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. This shape REPEATS in the file: one other method here (HashMapMarketDepth::update_bid_depth) 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":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"696e65708554edf36f6f02738215530604bbb3ce1696e462781c71c6c1a5876e"}},{"ruleId":"D2","level":"warning","message":{"text":"collector::binance::handle (cognitive 17): collector::binance::handle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 1 (5 pts), boolean chains 2 (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":"collector/src/binance/mod.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89de350f707552bc3d081c603bc01145623f4aa263d89d28639836b8db21634"}},{"ruleId":"D2","level":"warning","message":{"text":"MarketDataStream::connect (cognitive 16): MarketDataStream::connect has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fe4b979d0b9c2eba2eb85c08fa35568f0a3a6f827936e3f37d9f5410e473c2"}},{"ruleId":"D2","level":"warning","message":{"text":"MarketDataStream::connect (cognitive 16): MarketDataStream::connect has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/binancespot/market_data_stream.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e26621880becdb180e2090124fef21c7bffc2ed21222bd2c316598efbec97e"}},{"ruleId":"D2","level":"warning","message":{"text":"databento.convert (cognitive 16): databento.convert has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-hftbacktest/hftbacktest/data/utils/databento.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e463183ab1abd501be3c30b4faab70984df4ea353a3b68b66a6ae3efcc41def3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hftbacktest/binding.py: FileTooLong \u2014 985 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 485 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":"py-hftbacktest/hftbacktest/binding.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdb98b46ccb3f6c275283c47b24676bf064dac879bb1224d535f0ed985f9f5c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PartialFillExchange.ack_new: MethodTooLong \u2014 ack_new runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b7058893f2d5fe87866f2a8b7742a916689d8cb4417a3177a6ad215b55fa62"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ExecutionReport: TooManyFields \u2014 50 stored fields. The bar is 30 stored fields; this is 20 over it, 1.67\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/binancespot/msg/stream.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e156678f95e3b68a63c702112058b29f8b53b179e723b4fbac0845e770dc4b27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backtest/mod.rs: FileTooLong \u2014 759 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 259 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2306f2d2bc335f17fbd1ca4f812a62567b60a0034a6b5f3e086927c549da3244"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PrivateOrder: TooManyFields \u2014 42 stored fields. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/bybit/msg.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a04b2452371d35c3dfd8e6e218299c5c510fc5c388c12e14dc0fa6fb42b2b1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ROIVectorMarketDepth: ClassTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 6 blocks, lines 15-803. The bar is 400 significant lines; this is 154 over it, 1.39\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":"hftbacktest/src/depth/roivectormarketdepth.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fbd24e5b4aa2c18c550335f7e105b6b6fe3a4f1c23f5c5582e8f0f7d49c42a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/queue.rs: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: L3FIFOQueueModel (3 blocks, 481-1128). The bar is 500 significant lines; this is 186 over it, 1.37\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8dd86c19ccd5a219febde06a718dc5771d4cf62066470bac941538803bd422"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PartialFillExchange: ClassTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 3 blocks, lines 78-867. The bar is 400 significant lines; this is 145 over it, 1.36\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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ec8d202a5366079555cdb70a2e11bb1f3d2aef83d42a8b1788d1ed9aa44996"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: py_hftbacktest::live: TooManyFunctions \u2014 39 free functions. The bar is 30 free functions; 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":"py-hftbacktest/src/live.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aee3e144c3b4e191c77b41f648410d1da5482d04da77377c0ee1b0ad1a667d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrivateStream.handle_private_stream: MethodTooLong \u2014 handle_private_stream runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/bybit/private_stream.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a773fd2e50ff83bd5eb88e99079405911d9a5800cc330f50d4c7ae672398a08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: proc/partialfillexchange.rs: FileTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: PartialFillExchange (3 blocks, 78-867). The bar is 500 significant lines; this is 77 over it, 1.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ca538624181557d956bba7b8cd12a3ee3182161e9344863ad63ce8a38524c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: depth/roivectormarketdepth.rs: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: ROIVectorMarketDepth (6 blocks, 15-803). The bar is 500 significant lines; this is 76 over it, 1.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/roivectormarketdepth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11902a33a2b667da19e4442ad4279f43533dbda3c1b191e1304d76c6e846e79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Position: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/bybit/msg.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5bae0782bf11a58e37cf506b3de88662c55cf5bff5d2ab4c51f612741c81d6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: L3FIFOQueueModel: ClassTooLong \u2014 444 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 3 blocks, lines 481-1128. The bar is 400 significant lines; this is 44 over it, 1.11\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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0a22e2fb698a20dbf7038263ce37a10a84af4174384cf97f357fe53c292503"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hftbacktest_derive::build_asset: FunctionTooLong \u2014 hftbacktest_derive::build_asset runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest-derive/src/lib.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6729318043c89287c38551953ca4f634457431e051a230f59c6f6da8e44ad9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HashMapMarketDepth: ClassTooLong \u2014 428 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods, 6 blocks, lines 21-617. The bar is 400 significant lines; this is 28 over it, 1.07\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":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e18022f66743af6203712b77761bbd60e046f03e631631f46ed6a6ee4464b67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 19 over it, 1.04\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":"hftbacktest/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b540140e47b2553b4c033b0f19206503a8b6923c9adebadbfaadde98c2989c87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bybit/msg.rs: FileTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/bybit/msg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c25253f369e2b6d0b6ce155391df716215a0ea544df888d351253c572fe120f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (89 shared lines): hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs:172-278 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:314-434 \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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad35f9cc8be6b917c0fde9bea9dc02c13ae4f66603b5c5aff76e15c49a8f076"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (53 shared lines): hftbacktest/src/depth/fuse.rs:347-453 | hftbacktest/src/depth/fuse.rs:455-561 \u2014 These two members are variants of one another: 53 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3d86857a988d2885fa40a2d61d15c5fecd6aba20779ed8c446f38367cae247"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (32 shared lines): hftbacktest/src/depth/btreemarketdepth.rs:337-401 | hftbacktest/src/depth/hashmapmarketdepth.rs:494-576 \u2014 These two members are variants of one another: 32 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dce89a877d68ed2d5226768ace36610e44eac1042c15982b3eb4b8e19a631a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (24 shared lines): hftbacktest/src/live/ipc/iceoryx.rs:76-115 | hftbacktest/src/live/ipc/iceoryx.rs:117-157 \u2014 These two members are variants of one another: 24 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":"hftbacktest/src/live/ipc/iceoryx.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fff6dfeabda70ccb16d7fdd3e63eb105dd1d9c881b71ca230e634d4df7fbba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): connector/src/binancefutures/mod.rs:236-308 | connector/src/binancespot/mod.rs:239-311 \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":"connector/src/binancefutures/mod.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb43a894fc754f9cf27889d857991bd11ab6212ba10fbc7252d90ce64d08b50"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): py-hftbacktest/hftbacktest/data/utils/binancefutures.py:28-297 | py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py:144-303 | py-hftbacktest/hftbacktest/data/utils/bybithistmktdata.py:25-175 | py-hftbacktest/hftbacktest/data/utils/databento.py:29-127 | py-hftbacktest/hftbacktest/data/utils/hyperliquid.py:34-181 | py-hftbacktest/hftbacktest/data/utils/mexc.py:24-197 | py-hftbacktest/hftbacktest/data/utils/tardis.py:64-231 | py-hftbacktest/hftbacktest/data/utils/tardis.py:483-640 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-hftbacktest/hftbacktest/data/utils/binancefutures.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e68fbf8b21e5be54a1d7bf3b045a03b9e465e34e58d2219df449303157707b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): connector/src/binancefutures/market_data_stream.rs:265-337 | connector/src/binancefutures/user_data_stream.rs:115-234 | connector/src/binancespot/market_data_stream.rs:265-337 | connector/src/binancespot/user_data_stream.rs:114-248 | connector/src/bybit/private_stream.rs:246-360 | connector/src/bybit/public_stream.rs:166-243 | connector/src/bybit/trade_stream.rs:61-158 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4371c7a10392498f01214bb250d9fcca9cda5db108bf4f13c643b7ee18deef"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): collector/src/binance/http.rs:131-172 | collector/src/binancefuturescm/http.rs:132-173 | collector/src/binancefuturesum/http.rs:132-173 | collector/src/bybit/http.rs:107-148 \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":"collector/src/binance/http.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffe920488a025fca1f34f075bad81cb4d190507e73e088b46d7e0226fca6c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): connector/src/binancefutures/market_data_stream.rs:65-185 | connector/src/binancefutures/market_data_stream.rs:187-263 | connector/src/binancespot/market_data_stream.rs:65-185 | connector/src/binancespot/market_data_stream.rs:187-263 \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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"389d020b1806c2c67a04c4a0f50b4361d10a4a16078b27aeb05a22baffb21d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): connector/src/binancefutures/ordermanager.rs:164-197 | connector/src/binancefutures/ordermanager.rs:203-245 | connector/src/binancespot/ordermanager.rs:149-182 | connector/src/binancespot/ordermanager.rs:188-230 \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":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"304f956f91be7a8c1cf76dfe65b1ddf90bb4917895da46e4fe34797c42a774aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:218-228 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:230-240 | hftbacktest/src/backtest/proc/partialfillexchange.rs:267-277 | hftbacktest/src/backtest/proc/partialfillexchange.rs:279-289 \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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab24eeaf13fec3c74927d3a9c7904aa733da09443a2dcf4b67a2b2b0ae8a17c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:247-276 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:283-312 | hftbacktest/src/backtest/proc/partialfillexchange.rs:296-337 | hftbacktest/src/backtest/proc/partialfillexchange.rs:344-385 \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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d95b9a3bd87425b841eebb2c93e57053b71e40b55d2141f7203a39fb1fa337a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 3): collector/src/binance/http.rs:62-125 | collector/src/binancefuturescm/http.rs:63-126 | collector/src/binancefuturesum/http.rs:63-126 \u2014 \u0060collector/src/binance/http.rs\u0060 and \u0060collector/src/binancefuturescm/http.rs\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 4 separate duplicated blocks between them, totalling at least 114 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":"collector/src/binance/http.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"491b933d391d1c7f68895748842ad6ce343a139b975b1220593aa98bba7b3105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): connector/src/binancefutures/market_data_stream.rs:69-114 | connector/src/binancespot/market_data_stream.rs:69-114 \u2014 \u0060connector/src/binancefutures/market_data_stream.rs\u0060 and \u0060connector/src/binancespot/market_data_stream.rs\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 12 separate duplicated blocks between them, totalling at least 188 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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a8fd67d4c61f8b9c1746f178d147b0ae4f58d87fbdb67f5b756891bb068746"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:473-514 | hftbacktest/src/backtest/proc/partialfillexchange.rs:691-732 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d66e620a4157f6ff994b45c925eb3dda89ee3d88a0dd29611c547497bb6c6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs:213-253 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:362-402 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 172 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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4548b0b5d8fad4b9998e6857a007cec63d1bbc0b4efa4c76064f106b669f3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:530-568 | hftbacktest/src/backtest/proc/partialfillexchange.rs:748-786 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"d266639e44b6065b3c803340fcfb0bb1f95441a157cf16c41aac9be391ef4001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): py-hftbacktest/src/lib.rs:531-568 | py-hftbacktest/src/lib.rs:588-625 \u2014 both copies are in the same file, so extract the block 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":"py-hftbacktest/src/lib.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b7eaf4b2371e5b6821f00add7d15d439dad9c7286147bbea9ed90d5b07d752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): hftbacktest/src/backtest/proc/l3_local.rs:265-300 | hftbacktest/src/backtest/proc/local.rs:85-120 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_local.rs\u0060 and \u0060hftbacktest/src/backtest/proc/local.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 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":"hftbacktest/src/backtest/proc/l3_local.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"96721781c63d3fa51798373306eb67bd4cacc411aa3f2b3fb87d35545bfe6bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 3): hftbacktest/src/depth/btreemarketdepth.rs:404-437 | hftbacktest/src/depth/hashmapmarketdepth.rs:579-612 | hftbacktest/src/depth/roivectormarketdepth.rs:765-798 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d74452cade1e965167997985c55a16559c7d8e8340ead4dad9e45bacfc3a497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): hftbacktest/src/backtest/mod.rs:255-287 | hftbacktest/src/backtest/mod.rs:477-509 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/mod.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a8d93775b120e5a861bd3896fa01e5d8b0dbc633f8a2b7ef974f854538b3ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): hftbacktest/src/depth/fuse.rs:96-128 | hftbacktest/src/depth/fuse.rs:212-244 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b097ae234e632d7f52947035ad4a3e3e699dd701a70f9d5a7fb4062391f4e838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): collector/src/binancefuturescm/mod.rs:21-51 | collector/src/binancefuturesum/mod.rs:21-51 \u2014 \u0060collector/src/binancefuturescm/mod.rs\u0060 and \u0060collector/src/binancefuturesum/mod.rs\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 4 separate duplicated blocks between them, totalling at least 84 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":"collector/src/binancefuturescm/mod.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"654f2041906f277a7f613b5016f0aecdf07cab511c85e1a07c3b13e50bdf53ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): connector/src/binancefutures/ordermanager.rs:311-340 | connector/src/binancespot/ordermanager.rs:296-325 \u2014 \u0060connector/src/binancefutures/ordermanager.rs\u0060 and \u0060connector/src/binancespot/ordermanager.rs\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 9 separate duplicated blocks between them, totalling at least 183 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":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5e3ee19392b6b34bcb08663881923c2ce30fd1db8bafcbd358935640ddbc3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs:174-203 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:316-345 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 172 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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"afed0ddc166a02b657b050a8b3e095a1b878af5466e9fbdcef9b65aa41030165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:437-466 | hftbacktest/src/backtest/proc/partialfillexchange.rs:655-684 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b5a76fd7f55924973592acd326c36ed30da74297d3380a1a370419db66df9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 3): collector/src/binance/mod.rs:44-71 | collector/src/binancefuturescm/mod.rs:46-73 | collector/src/binancefuturesum/mod.rs:46-73 \u2014 \u0060collector/src/binance/mod.rs\u0060 and \u0060collector/src/binancefuturescm/mod.rs\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 53 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":"collector/src/binance/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"733436564d79cdb9d4e8dbaf3dab7b0e3727ac477da8eed8c6b7abf29a883103"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): connector/src/binancefutures/user_data_stream.rs:173-200 | connector/src/binancespot/user_data_stream.rs:175-202 \u2014 \u0060connector/src/binancefutures/user_data_stream.rs\u0060 and \u0060connector/src/binancespot/user_data_stream.rs\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 6 separate duplicated blocks between them, totalling at least 79 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":"connector/src/binancefutures/user_data_stream.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51c1810dd952d57ead3334dad3190577bf9360938ebf68da8a0290a1737061c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): connector/src/binancefutures/ordermanager.rs:165-191 | connector/src/binancespot/ordermanager.rs:150-176 \u2014 \u0060connector/src/binancefutures/ordermanager.rs\u0060 and \u0060connector/src/binancespot/ordermanager.rs\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 9 separate duplicated blocks between them, totalling at least 183 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":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7271e2fddc2b4d89fb63739343db58253f04823a5448a8a0cb43d0d5c99a4845"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): hftbacktest/src/backtest/proc/l3_local.rs:127-153 | hftbacktest/src/backtest/proc/local.rs:188-214 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_local.rs\u0060 and \u0060hftbacktest/src/backtest/proc/local.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 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":"hftbacktest/src/backtest/proc/l3_local.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eae647ab9ea695b1403e19b4d60e89fd93e6344024d814561681f7e47065aba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): connector/src/binancefutures/ordermanager.rs:283-308 | connector/src/binancespot/ordermanager.rs:268-293 \u2014 \u0060connector/src/binancefutures/ordermanager.rs\u0060 and \u0060connector/src/binancespot/ordermanager.rs\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 9 separate duplicated blocks between them, totalling at least 183 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":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"842c3a6c6501ffd3fc1f97d0d7fe8e70dfdfc7b35f649cb8e5a5dce87b40e8e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:569-594 | hftbacktest/src/backtest/proc/partialfillexchange.rs:787-812 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2924b020c0f065e16c9225c1137b4fa06aeb3016f5eddb62538760385e693ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): hftbacktest/src/depth/fuse.rs:146-171 | hftbacktest/src/depth/fuse.rs:391-416 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f8aadac30707c25d48b8d6ea8595cff1f2b5334febee54c293368593ef2593"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): hftbacktest/src/depth/fuse.rs:262-287 | hftbacktest/src/depth/fuse.rs:499-524 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1d91136a1f100e2f589c59cf51e85560332c3a13434202dab14296af16f798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs:114-138 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:172-196 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 172 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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0159e0ab03be9353ad5088c73ab53a3046bf13f4a12b48f2f64a1066af929f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 3): connector/src/bybit/private_stream.rs:339-360 | connector/src/bybit/public_stream.rs:220-243 | connector/src/bybit/trade_stream.rs:137-158 \u2014 before extracting anything, compare \u0060connector/src/bybit/private_stream.rs\u0060 and \u0060connector/src/bybit/trade_stream.rs\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"connector/src/bybit/private_stream.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74795c4b4e36ab517ab8894199a0986ef2414e36e63a859c8e6817583706dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): hftbacktest/src/backtest/models/queue.rs:1010-1033 | hftbacktest/src/backtest/models/queue.rs:1051-1074 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b11202521b16f23ebebdbd4dbc67d33a7ce8d24339905edc3b7177f4feb0a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): hftbacktest/src/backtest/proc/l3_local.rs:95-118 | hftbacktest/src/backtest/proc/local.rs:156-179 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_local.rs\u0060 and \u0060hftbacktest/src/backtest/proc/local.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 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":"hftbacktest/src/backtest/proc/l3_local.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf1dd0b0d179c82c521a0f0e7e53448f4e842f60bb126989b88677719b25990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs:417-439 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:614-636 | hftbacktest/src/backtest/proc/partialfillexchange.rs:832-854 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 172 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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4197b958e8f08838beaf247362086ac8e63199e61bf358abe9efed0bb78c64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): connector/src/binancefutures/ordermanager.rs:248-270 | connector/src/binancespot/ordermanager.rs:233-255 \u2014 \u0060connector/src/binancefutures/ordermanager.rs\u0060 and \u0060connector/src/binancespot/ordermanager.rs\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 9 separate duplicated blocks between them, totalling at least 183 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":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa9f6198cdc728fd79ac3635479e2cc8a10268df4c3f9cd0d7abac7c6868440"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 4): collector/src/binance/http.rs:152-172 | collector/src/binancefuturescm/http.rs:153-173 | collector/src/binancefuturesum/http.rs:153-173 | collector/src/bybit/http.rs:128-148 \u2014 \u0060collector/src/binance/http.rs\u0060 and \u0060collector/src/binancefuturescm/http.rs\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 4 separate duplicated blocks between them, totalling at least 114 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":"collector/src/binance/http.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb98b2e9e6010d324f59c4486c7769b535f7fc4c40ced7be33c31334c00dc9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): connector/src/binancefutures/market_data_stream.rs:283-303 | connector/src/binancespot/market_data_stream.rs:283-303 \u2014 \u0060connector/src/binancefutures/market_data_stream.rs\u0060 and \u0060connector/src/binancespot/market_data_stream.rs\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 12 separate duplicated blocks between them, totalling at least 188 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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86a7b831ca8226917a7a8d4046e4ddb715ac0f41c05ee5e363a2b4152a40a44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): connector/src/binancefutures/ordermanager.rs:219-239 | connector/src/binancespot/ordermanager.rs:204-224 \u2014 \u0060connector/src/binancefutures/ordermanager.rs\u0060 and \u0060connector/src/binancespot/ordermanager.rs\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 9 separate duplicated blocks between them, totalling at least 183 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":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc0bd8d70038113aeb212cb800baa3d42293bbd82c3485f7e5df4a72ef7a2aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): hftbacktest/src/backtest/mod.rs:290-309 | hftbacktest/src/backtest/mod.rs:512-531 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/mod.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f736f8406c32c72cb1e99aec9a160eb61cdfa3472ca2632be74680b7284b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): hftbacktest/src/backtest/proc/partialfillexchange.rs:147-166 | hftbacktest/src/backtest/proc/partialfillexchange.rs:187-206 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc9324dd821a03a1ccdb894225c28ce191178b1fd779a46cde3c2a6f6e4db01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): hftbacktest/src/backtest/models/queue.rs:791-809 | hftbacktest/src/backtest/models/queue.rs:832-850 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"1582961bb5721174ba240e45cc3ac49a8a824ab82dd05e0ca33f8546813e07c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): hftbacktest/src/backtest/models/queue.rs:811-829 | hftbacktest/src/backtest/models/queue.rs:852-870 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"041162820f314cf9f2ef21ec16b5a2ea084d3345586ddd996bacff19e1f969a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): hftbacktest/src/depth/fuse.rs:406-424 | hftbacktest/src/depth/fuse.rs:541-559 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3aa5534ef861584b05c3ad5bea6c5f84c9c0eb753ce56a6def1d2b8e4ab61b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): hftbacktest/src/depth/fuse.rs:433-451 | hftbacktest/src/depth/fuse.rs:514-532 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac05dc8c6db837fbcc57c4892939f4fca797be02f017d2d2476a31b360705beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:352-369 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:409-426 | hftbacktest/src/backtest/proc/partialfillexchange.rs:484-501 | hftbacktest/src/backtest/proc/partialfillexchange.rs:614-631 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3d4c76d078c294ceb6edcff6c2e60a6957a37581f3ee0c93a0e2bc04cef0f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): collector/src/binance/http.rs:132-149 | collector/src/binancefuturescm/http.rs:133-150 | collector/src/binancefuturesum/http.rs:133-150 \u2014 \u0060collector/src/binance/http.rs\u0060 and \u0060collector/src/binancefuturescm/http.rs\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 4 separate duplicated blocks between them, totalling at least 114 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":"collector/src/binance/http.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4fe3b9bbaeb1cf9b16cf61e1afa0e8b391d0d2b2b707eb8ee9f5f2d457d45f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): connector/src/binancefutures/mod.rs:350-367 | connector/src/binancespot/mod.rs:354-371 \u2014 \u0060connector/src/binancefutures/mod.rs\u0060 and \u0060connector/src/binancespot/mod.rs\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 11 separate duplicated blocks between them, totalling at least 112 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":"connector/src/binancefutures/mod.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4445bc080aeecc457efb79803ae0ff3d0b5480ba807b223538c59fc80af9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): connector/src/binancefutures/ordermanager.rs:86-103 | connector/src/binancespot/ordermanager.rs:71-88 \u2014 \u0060connector/src/binancefutures/ordermanager.rs\u0060 and \u0060connector/src/binancespot/ordermanager.rs\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 9 separate duplicated blocks between them, totalling at least 183 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":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c49b6ca1539aafab7583c5e4cef4feabd9bcb4852a0daa2f99fce1158fac61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): hftbacktest/src/backtest/models/queue.rs:892-909 | hftbacktest/src/backtest/models/queue.rs:931-948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0ae71b8f54b0741d362b5fa6c3f186aeb5006d06fb37d23ad3fa224be38420"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): hftbacktest/src/backtest/proc/l3_local.rs:156-173 | hftbacktest/src/backtest/proc/local.rs:217-234 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_local.rs\u0060 and \u0060hftbacktest/src/backtest/proc/local.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 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":"hftbacktest/src/backtest/proc/l3_local.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"195d3463a3f4a5f8c992dbee3e75ff5c9defe0d486cba0188d65c0c3cdd767eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:199-216 | hftbacktest/src/backtest/proc/partialfillexchange.rs:248-265 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd8e64c6fbb56c5db99c52609e21cad2e001a4c697bd5c3bbdf7982e453691d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): hftbacktest/src/backtest/proc/partialfillexchange.rs:320-337 | hftbacktest/src/backtest/proc/partialfillexchange.rs:368-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b976587c7533994e075e0d5710b1925a433f1f0f647919e31d65d4f825aad827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): collector/src/binance/mod.rs:83-99 | collector/src/binancefuturescm/mod.rs:84-99 | collector/src/binancefuturesum/mod.rs:84-99 \u2014 \u0060collector/src/binance/mod.rs\u0060 and \u0060collector/src/binancefuturescm/mod.rs\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 53 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":"collector/src/binance/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9d91246a31c9a61079cdc5fffa05aa34746ea2a70f9d8e8537fc1ab99fa465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): connector/src/binancefutures/user_data_stream.rs:137-153 | connector/src/binancespot/user_data_stream.rs:152-168 \u2014 \u0060connector/src/binancefutures/user_data_stream.rs\u0060 and \u0060connector/src/binancespot/user_data_stream.rs\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 6 separate duplicated blocks between them, totalling at least 79 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":"connector/src/binancefutures/user_data_stream.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"87991f6daa46d2a89d12ad4ec0a12f79d5bd4ec29d4e1963a36d7c80b03438cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): hftbacktest/src/backtest/models/queue.rs:912-928 | hftbacktest/src/backtest/models/queue.rs:951-967 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cd73885cb00c736a5b0c313013ddbc3935337c75fd59e476ebfd026f453458"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): hftbacktest/src/backtest/proc/partialfillexchange.rs:420-436 | hftbacktest/src/backtest/proc/partialfillexchange.rs:548-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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25dffa38e2d64bcc894304bd52a120bb444d8e3fde65f92fb3ab5c438dfec2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): hftbacktest/src/depth/hashmapmarketdepth.rs:97-113 | hftbacktest/src/depth/hashmapmarketdepth.rs:152-168 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b395435199bb596733c60d3017c6429ff43391d928c307f5b5a8fe90ea57155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): connector/src/binancefutures/market_data_stream.rs:136-151 | connector/src/binancespot/market_data_stream.rs:136-151 \u2014 \u0060connector/src/binancefutures/market_data_stream.rs\u0060 and \u0060connector/src/binancespot/market_data_stream.rs\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 12 separate duplicated blocks between them, totalling at least 188 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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"983845abf0dd6edb9101a22f4f846a54c64a0c08b372007a91c9904a1faaa61d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): connector/src/binancefutures/market_data_stream.rs:170-185 | connector/src/binancespot/market_data_stream.rs:170-185 \u2014 \u0060connector/src/binancefutures/market_data_stream.rs\u0060 and \u0060connector/src/binancespot/market_data_stream.rs\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 12 separate duplicated blocks between them, totalling at least 188 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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"350bb728fd8b98f3af5834ca37cc4262892ea9d89ded52e0c8e0c3e7b73c6809"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): connector/src/bybit/private_stream.rs:258-273 | connector/src/bybit/trade_stream.rs:76-91 \u2014 before extracting anything, compare \u0060connector/src/bybit/private_stream.rs\u0060 and \u0060connector/src/bybit/trade_stream.rs\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"connector/src/bybit/private_stream.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5455a105c5fd8ce793d1df3b3729271776f799aecb952a3c5dadd87151342ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs:263-278 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:419-434 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 172 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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be2b146bd7d14cb58eb67935cf0c598303674d1defdae706734e16c33fd1b3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): hftbacktest/src/backtest/proc/partialfillexchange.rs:457-472 | hftbacktest/src/backtest/proc/partialfillexchange.rs:585-600 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c31c5d71cb8077317c936b609980f493b37df8419ac925fbce8868cedabe5a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): connector/src/binancefutures/ordermanager.rs:183-197 | connector/src/binancefutures/ordermanager.rs:231-245 | connector/src/binancespot/ordermanager.rs:168-182 | connector/src/binancespot/ordermanager.rs:216-230 \u2014 \u0060connector/src/binancefutures/ordermanager.rs\u0060 and \u0060connector/src/binancespot/ordermanager.rs\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 9 separate duplicated blocks between them, totalling at least 183 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":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7708437facb36e0884e70d44090e34b1b5844f7426f2273f939f53917975f27c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): connector/src/binancefutures/market_data_stream.rs:219-233 | connector/src/binancespot/market_data_stream.rs:219-233 \u2014 \u0060connector/src/binancefutures/market_data_stream.rs\u0060 and \u0060connector/src/binancespot/market_data_stream.rs\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 12 separate duplicated blocks between them, totalling at least 188 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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6830ceccc2d818bb3e5b71cec22370838ac3807f026ffc358ddad497fedf041"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): connector/src/binancefutures/mod.rs:237-251 | connector/src/binancespot/mod.rs:240-254 \u2014 \u0060connector/src/binancefutures/mod.rs\u0060 and \u0060connector/src/binancespot/mod.rs\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 11 separate duplicated blocks between them, totalling at least 112 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":"connector/src/binancefutures/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88bb848f63efa6568d27419f768d753efa85101139dc586daf4ba1b0d6623ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): connector/src/binancefutures/rest.rs:86-100 | connector/src/binancespot/rest.rs:89-103 \u2014 \u0060connector/src/binancefutures/rest.rs\u0060 and \u0060connector/src/binancespot/rest.rs\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 7 separate duplicated blocks between them, totalling at least 92 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":"connector/src/binancefutures/rest.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fd72fbd5ea12645854f30ec9c5e60f2e17f6aaf4dbdfb95c4df13d79339a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): connector/src/binancefutures/rest.rs:110-124 | connector/src/binancespot/rest.rs:113-127 \u2014 \u0060connector/src/binancefutures/rest.rs\u0060 and \u0060connector/src/binancespot/rest.rs\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 7 separate duplicated blocks between them, totalling at least 92 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":"connector/src/binancefutures/rest.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"373cce6f9a5212920a9fb22bd522c9b9358c0f288a15caecddfed00ef2d4aad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): connector/src/binancefutures/rest.rs:134-148 | connector/src/binancespot/rest.rs:137-151 \u2014 \u0060connector/src/binancefutures/rest.rs\u0060 and \u0060connector/src/binancespot/rest.rs\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 7 separate duplicated blocks between them, totalling at least 92 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":"connector/src/binancefutures/rest.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24e99e6ef8f0e0cd585e213f59034886d5fb5d86e95ddcc30005caa6c0ad2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): connector/src/binancefutures/rest.rs:172-186 | connector/src/binancespot/rest.rs:204-218 \u2014 \u0060connector/src/binancefutures/rest.rs\u0060 and \u0060connector/src/binancespot/rest.rs\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 7 separate duplicated blocks between them, totalling at least 92 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":"connector/src/binancefutures/rest.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9012b9f96fc75efecc99f5ebf3b2e4764eb1777034336c111e055ad61479080a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): connector/src/binancefutures/msg/mod.rs:29-43 | connector/src/binancespot/msg/mod.rs:29-43 \u2014 before extracting anything, compare \u0060connector/src/binancefutures/msg/mod.rs\u0060 and \u0060connector/src/binancespot/msg/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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":"connector/src/binancefutures/msg/mod.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"26025d76a068b07dbf70ea825a646161db144fcf782345af42237c5067c79a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): hftbacktest/src/depth/fuse.rs:370-384 | hftbacktest/src/depth/fuse.rs:478-492 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6196443326146634aba521e80c77c4c36f0b9c3f80ad281b570d7fb2a709cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): hftbacktest/src/depth/hashmapmarketdepth.rs:397-409 | hftbacktest/src/depth/roivectormarketdepth.rs:517-531 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/roivectormarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 92 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":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2f5c963d6a28228430e58914d0597e0dce3f33ba442fadb72d514c6277db2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): hftbacktest/src/depth/hashmapmarketdepth.rs:424-436 | hftbacktest/src/depth/roivectormarketdepth.rs:549-563 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/roivectormarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 92 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":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc20974df038a28af9c6d606cee7b9863bcf2c1b212929167f2f7da47fdff176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): py-hftbacktest/src/lib.rs:516-529 | py-hftbacktest/src/lib.rs:572-586 \u2014 both copies are in the same file, so extract the block 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":"py-hftbacktest/src/lib.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce0512b7d53c250c97b1268db79fd23bdde0aad99c01596fa60c4cfe8ee30f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs:182-195 | hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs:232-245 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:324-337 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:381-394 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 172 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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b4ac00ea91f9b08d41808480c26a10d51f9ea87a3a5e03492cd970d80d0468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): connector/src/binancefutures/mod.rs:295-308 | connector/src/binancespot/mod.rs:298-311 \u2014 \u0060connector/src/binancefutures/mod.rs\u0060 and \u0060connector/src/binancespot/mod.rs\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 11 separate duplicated blocks between them, totalling at least 112 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":"connector/src/binancefutures/mod.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"043998f653166fcf7a322fa250a47934ce1fcaaece123c0c7f26e6b3ce0064b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): connector/src/binancefutures/rest.rs:63-76 | connector/src/binancespot/rest.rs:66-79 \u2014 \u0060connector/src/binancefutures/rest.rs\u0060 and \u0060connector/src/binancespot/rest.rs\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 7 separate duplicated blocks between them, totalling at least 92 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":"connector/src/binancefutures/rest.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"00900e67a240ec3702769dbb525146aa24f132600d1b29465c907f9be85c557a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): connector/src/binancefutures/rest.rs:227-240 | connector/src/binancefutures/rest.rs:314-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/binancefutures/rest.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43e878e972512a5f84d8334adb6a2e0e52e7e463cd95fe5f5bdb1869b393d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): connector/src/bybit/trade_stream.rs:177-190 | connector/src/bybit/trade_stream.rs:207-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/bybit/trade_stream.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba62d20b8b1546aa69e7d295e30415763daaf8246e4901763bde1a3e96e3d2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): connector/src/bybit/trade_stream.rs:192-205 | connector/src/bybit/trade_stream.rs:222-235 \u2014 both copies are in the same file, so extract the block 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":"connector/src/bybit/trade_stream.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"243ac87d7ecda46493da706dc30ba2f65d6c6323e3c39e48eedaf8cdf9f9a241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): connector/src/binancefutures/market_data_stream.rs:134-146 | connector/src/binancefutures/market_data_stream.rs:217-229 | connector/src/binancespot/market_data_stream.rs:134-146 | connector/src/binancespot/market_data_stream.rs:217-229 \u2014 \u0060connector/src/binancefutures/market_data_stream.rs\u0060 and \u0060connector/src/binancespot/market_data_stream.rs\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 12 separate duplicated blocks between them, totalling at least 188 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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f3de77d5c7024688e3c7241ca7fb27e6169fc64615414e649397ef60db738e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs:113-125 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:171-183 | hftbacktest/src/backtest/proc/partialfillexchange.rs:216-228 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 172 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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c50a6ff0429577937875b1d1d828ac1dc8762f2c33db602cd639ac8946a9cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): hftbacktest/src/depth/roivectormarketdepth.rs:182-194 | hftbacktest/src/depth/roivectormarketdepth.rs:526-538 | hftbacktest/src/depth/roivectormarketdepth.rs:679-691 \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":"hftbacktest/src/depth/roivectormarketdepth.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba34679921d3e3d018ce5f69dc1678a76dc84aca644f7e99b9b956d140300ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): hftbacktest/src/depth/roivectormarketdepth.rs:249-261 | hftbacktest/src/depth/roivectormarketdepth.rs:558-570 | hftbacktest/src/depth/roivectormarketdepth.rs:737-749 \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":"hftbacktest/src/depth/roivectormarketdepth.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7749bea9d2c8fd72b918d2b92e023624b1090cafd874d70fe88474e6235e815b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): connector/src/binancefutures/market_data_stream.rs:113-125 | connector/src/binancefutures/market_data_stream.rs:196-208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f644e8cb7aad2988489d89a623b30a78898deee3959e2061e759f50b080ecf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): connector/src/binancefutures/market_data_stream.rs:267-279 | connector/src/binancespot/market_data_stream.rs:267-279 \u2014 \u0060connector/src/binancefutures/market_data_stream.rs\u0060 and \u0060connector/src/binancespot/market_data_stream.rs\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 12 separate duplicated blocks between them, totalling at least 188 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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"7caacccfdae0297b98e61c2920775eb8fb58ccb01acaa21f06d4b112fdd90ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): connector/src/binancefutures/mod.rs:311-323 | connector/src/binancespot/mod.rs:314-326 \u2014 \u0060connector/src/binancefutures/mod.rs\u0060 and \u0060connector/src/binancespot/mod.rs\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 11 separate duplicated blocks between them, totalling at least 112 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":"connector/src/binancefutures/mod.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ee3a18bd9546c0355979f13ee640a682c372baa1f1ba1861a55d8cf2ceb3ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): connector/src/bybit/ordermanager.rs:65-77 | connector/src/bybit/ordermanager.rs:81-93 \u2014 both copies are in the same file, so extract the block 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":"connector/src/bybit/ordermanager.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe4165b99cf1fb53a36edebc7f70fe0fdbe558b78d87059af74f5e072318c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): connector/src/binancefutures/msg/mod.rs:66-78 | connector/src/binancespot/msg/mod.rs:66-78 \u2014 before extracting anything, compare \u0060connector/src/binancefutures/msg/mod.rs\u0060 and \u0060connector/src/binancespot/msg/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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":"connector/src/binancefutures/msg/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca240af149b55ebcfa5625ce849bee035dfd176936743de7fe54780a787b76a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): hftbacktest/src/backtest/models/queue.rs:822-834 | hftbacktest/src/backtest/models/queue.rs:921-933 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63ca0e2d0c46eaa030fb840e6f3744869fa8f2e13be324317987ffb1117e587"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:595-607 | hftbacktest/src/backtest/proc/partialfillexchange.rs:813-825 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"33391d42d3e2f40dab19fce93b3ee25de70bd73368d595ab6cd9c2ff21efcc1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): hftbacktest/src/backtest/proc/partialfillexchange.rs:508-519 | hftbacktest/src/backtest/proc/partialfillexchange.rs:639-651 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"6615f3ca3ebf4ad3f0c547836e9da9ff80b3ec8bf3185c5349cbf78b330e08b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): hftbacktest/src/depth/btreemarketdepth.rs:364-376 | hftbacktest/src/depth/hashmapmarketdepth.rs:530-542 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc690bc66f29dca7c10df34ba8ec07b736ec61e7f60c98f54e59264f809818ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): hftbacktest/src/backtest/proc/partialfillexchange.rs:441-452 | hftbacktest/src/backtest/proc/partialfillexchange.rs:506-517 | hftbacktest/src/backtest/proc/partialfillexchange.rs:569-580 | hftbacktest/src/backtest/proc/partialfillexchange.rs:637-648 \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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf86430d55a270f02477cf4987bd775d9663ae181d90f29ff3ce4d243c179bc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): connector/src/binancefutures/mod.rs:133-144 | connector/src/binancespot/mod.rs:136-147 \u2014 \u0060connector/src/binancefutures/mod.rs\u0060 and \u0060connector/src/binancespot/mod.rs\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 11 separate duplicated blocks between them, totalling at least 112 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":"connector/src/binancefutures/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be232fe5fd0077de917d3f057428718043362181ecc73fd1c841d9a3033bd04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): connector/src/binancefutures/user_data_stream.rs:244-255 | connector/src/binancespot/user_data_stream.rs:258-269 \u2014 \u0060connector/src/binancefutures/user_data_stream.rs\u0060 and \u0060connector/src/binancespot/user_data_stream.rs\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 6 separate duplicated blocks between them, totalling at least 79 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":"connector/src/binancefutures/user_data_stream.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d8b928d73a692ed2d8755b5145332eeaaf940a508c22cc4f571a4bfa7bea6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): connector/src/bybit/private_stream.rs:184-195 | connector/src/bybit/private_stream.rs:206-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":"connector/src/bybit/private_stream.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0b8218c3f5b5a42dfbe1bee8a17a40d0ba8f19e3b6d0d6b53afbaac7a28ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:265-276 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:301-312 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2c0308d25a4ec9fb668937696f7882d3977fa5b252b3ffcf57a5da8c5b57fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): hftbacktest/src/depth/btreemarketdepth.rs:118-128 | hftbacktest/src/depth/hashmapmarketdepth.rs:197-208 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1752dd2821a563766318e39fc2e1cf3dc1096b0746c03a50c303ca44026444ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): py-hftbacktest/src/live.rs:75-86 | py-hftbacktest/src/live.rs:318-329 \u2014 both copies are in the same file, so extract the block 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":"py-hftbacktest/src/live.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"123c0292cc80bcd43df14c559a392a0cedfb0fdc7d3c8742776106413ff8df84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): py-hftbacktest/src/live.rs:144-155 | py-hftbacktest/src/live.rs:387-398 \u2014 both copies are in the same file, so extract the block 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":"py-hftbacktest/src/live.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90540e74a7eaa4886330be9e8078a76c4a2e9ea10a12f3761eb8af253c60cc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): connector/src/binancefutures/market_data_stream.rs:309-319 | connector/src/binancespot/market_data_stream.rs:309-319 \u2014 \u0060connector/src/binancefutures/market_data_stream.rs\u0060 and \u0060connector/src/binancespot/market_data_stream.rs\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 12 separate duplicated blocks between them, totalling at least 188 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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c5ff06f921d07d35e3a2397ffc0ed3412a5058e45cff36a2c237f6355a08b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): connector/src/binancefutures/market_data_stream.rs:316-326 | connector/src/binancefutures/user_data_stream.rs:213-223 \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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0697bba21a33cdffa8f734ca98ad780fa9a395bc2ebf3459ec662d7c24d24e86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): connector/src/binancespot/market_data_stream.rs:316-326 | connector/src/binancespot/user_data_stream.rs:227-237 \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":"connector/src/binancespot/market_data_stream.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fc39628ac9b3a52d866c722bd0626089a15859f76496b10d9176d818b761a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): connector/src/bybit/public_stream.rs:85-95 | connector/src/bybit/public_stream.rs:124-134 \u2014 both copies are in the same file, so extract the block 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":"connector/src/bybit/public_stream.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8801018ceb3556312462bc6db696c55df282a51aad826094aa7295eb2cb58eaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hftbacktest/src/backtest/mod.rs:741-751 | hftbacktest/src/backtest/mod.rs:1107-1117 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/mod.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ae4a02c22e511b5ceb3426c317f7a8e91e97ead996b1c83a71e22f9a40d943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hftbacktest/src/backtest/models/queue.rs:517-527 | hftbacktest/src/backtest/models/queue.rs:564-574 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f05af487a2030ca1fdf06422557c54e66fbf16c97866c10f222c32f6cb3bfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hftbacktest/src/backtest/models/queue.rs:706-716 | hftbacktest/src/backtest/models/queue.rs:719-729 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7565c20439f997cdeaa5ac0231b30b3e4c42bf5ea72f12b7891ab769d825089"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hftbacktest/src/backtest/models/queue.rs:747-757 | hftbacktest/src/backtest/models/queue.rs:760-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fc21d8a7343e103196af8262efb0553f9f738afbacb859392f82d7815ee263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:127-137 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:152-162 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bb70e969acab8c5503b0beba33cf1328a2e3e3b30be817527d14f5997ae3a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hftbacktest/src/depth/btreemarketdepth.rs:51-61 | hftbacktest/src/depth/hashmapmarketdepth.rs:72-82 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e09d537e39520b93d07d42da1562c32dfc872c500edd73bd456f95b2adf856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): hftbacktest/src/depth/btreemarketdepth.rs:135-144 | hftbacktest/src/depth/hashmapmarketdepth.rs:218-228 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37d5828f51566f00775094b29125af071aa9630849acde1f96cad2e407aa358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): py-hftbacktest/src/live.rs:168-178 | py-hftbacktest/src/live.rs:411-421 \u2014 both copies are in the same file, so extract the block 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":"py-hftbacktest/src/live.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f58a5f66b299ba44fc3397d113bf010494d5642c60cf550960e99f1916fbdc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs:212-221 | hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs:262-271 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:361-370 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:418-427 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 172 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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a852f5ec475fe827bac6c47f31c454a59fcd072b842c24d5eb93ffb544968dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): hftbacktest/src/depth/btreemarketdepth.rs:258-267 | hftbacktest/src/depth/hashmapmarketdepth.rs:397-406 | hftbacktest/src/depth/roivectormarketdepth.rs:517-526 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"625980915e256e417f7cc72754ed705a5f9e12811e3ce5d424fb794a15d2d715"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): hftbacktest/src/depth/btreemarketdepth.rs:280-289 | hftbacktest/src/depth/hashmapmarketdepth.rs:424-433 | hftbacktest/src/depth/roivectormarketdepth.rs:549-558 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b890467e0c3101df71c87b4d744d976a09ce48e1b929626af8364932ac6894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): collector/src/binancefuturescm/http.rs:35-44 | collector/src/binancefuturesum/http.rs:35-44 \u2014 \u0060collector/src/binancefuturescm/http.rs\u0060 and \u0060collector/src/binancefuturesum/http.rs\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 5 separate duplicated blocks between them, totalling at least 124 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":"collector/src/binancefuturescm/http.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1a6ee53c1d3801ea8f33ca7d23eb5a06a05c0f8ce2acb68b5e1f90332a822f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): connector/src/binancefutures/market_data_stream.rs:188-197 | connector/src/binancespot/market_data_stream.rs:188-197 \u2014 \u0060connector/src/binancefutures/market_data_stream.rs\u0060 and \u0060connector/src/binancespot/market_data_stream.rs\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 12 separate duplicated blocks between them, totalling at least 188 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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"94314475a6f913ff3a2d7f147f502cceffcdfbcb66558f574350b50ec0315468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): connector/src/binancefutures/mod.rs:213-222 | connector/src/binancespot/mod.rs:216-225 \u2014 \u0060connector/src/binancefutures/mod.rs\u0060 and \u0060connector/src/binancespot/mod.rs\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 11 separate duplicated blocks between them, totalling at least 112 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":"connector/src/binancefutures/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2de530a2c550009e7bb249f9ad6c16040cc8f39d0e89bb7232e241d1b7f8df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): connector/src/bybit/public_stream.rs:68-77 | connector/src/bybit/public_stream.rs:107-116 \u2014 both copies are in the same file, so extract the block 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":"connector/src/bybit/public_stream.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"323c4f0916db0017c48422dbb8d1e6a40b5bd6e11ad5e9c52fa2ec51fc439214"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:341-350 | hftbacktest/src/backtest/proc/partialfillexchange.rs:473-482 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"260df71d1a431847f95567e952ab64d91f8b2181823e8a82e9271d4c8c179eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): hftbacktest/src/depth/btreemarketdepth.rs:300-309 | hftbacktest/src/depth/hashmapmarketdepth.rs:449-458 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"326a6c0579c37c57a5ddab9317ee19e13b48f780dfd6d7eb42c53d3068070cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): connector/src/binancefutures/ordermanager.rs:345-353 | connector/src/binancespot/ordermanager.rs:330-338 | connector/src/bybit/ordermanager.rs:229-237 \u2014 \u0060connector/src/binancefutures/ordermanager.rs\u0060 and \u0060connector/src/binancespot/ordermanager.rs\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 9 separate duplicated blocks between them, totalling at least 183 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":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f2dcde2d5183824d0562ce8363a703e9604dc61cc15c300704b1a5bdc02d9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): connector/src/binancefutures/user_data_stream.rs:208-216 | connector/src/binancespot/user_data_stream.rs:222-230 \u2014 \u0060connector/src/binancefutures/user_data_stream.rs\u0060 and \u0060connector/src/binancespot/user_data_stream.rs\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 6 separate duplicated blocks between them, totalling at least 79 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":"connector/src/binancefutures/user_data_stream.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ea59deac061f951b0f8d58a2a189ddb882b6f53dc52c6439e0accca5fcdac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hftbacktest/src/backtest/data/reader.rs:405-413 | hftbacktest/src/backtest/data/reader.rs:429-437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/data/reader.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8161f04b8a2f83444d2788c682bc50a135c2f924ec770c124e70ffc550354d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hftbacktest/src/depth/btreemarketdepth.rs:339-347 | hftbacktest/src/depth/hashmapmarketdepth.rs:496-504 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"9180116fb3c3d2267528c2cd49d7281c01edc9780a1a4819581c8e99371ac9b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hftbacktest/src/depth/btreemarketdepth.rs:393-401 | hftbacktest/src/depth/hashmapmarketdepth.rs:568-576 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d177ab7dbeb2786f2e3f4215c2e86d54669d3252ee268884098818a28546244b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): hftbacktest/src/depth/fuse.rs:310-317 | hftbacktest/src/depth/hashmapmarketdepth.rs:201-209 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/fuse.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a78918f7736d9227d4444fb3369dd85b5b9f9066ebd5874a3d7928b8563471"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): hftbacktest/src/depth/fuse.rs:323-330 | hftbacktest/src/depth/hashmapmarketdepth.rs:221-229 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/fuse.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cbb5d5f9cffdb12968fe155ba61866bfedd924b7007de1fd6c3e3975fa83ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hftbacktest/src/depth/fuse.rs:566-574 | hftbacktest/src/depth/hashmapmarketdepth.rs:315-323 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/fuse.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b188f45e04816283bb063ad81e8793aae1ea74f50987ef4e5af02820a71a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hftbacktest/src/live/ipc/iceoryx.rs:84-92 | hftbacktest/src/live/ipc/iceoryx.rs:136-144 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/live/ipc/iceoryx.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d5f72de9a8590e752e656af766367d6c2fd85addf74a82d103f7aa3e6f9a4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hftbacktest/src/live/ipc/iceoryx.rs:95-103 | hftbacktest/src/live/ipc/iceoryx.rs:125-133 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/live/ipc/iceoryx.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85535fea6fc41993a9cc7daaee967b51b2249545d8ebb08c4ae87002aefc470"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 7): connector/src/binancefutures/market_data_stream.rs:322-327 | connector/src/binancefutures/user_data_stream.rs:219-224 | connector/src/binancespot/market_data_stream.rs:322-327 | connector/src/binancespot/user_data_stream.rs:233-238 | connector/src/bybit/private_stream.rs:344-349 | connector/src/bybit/public_stream.rs:225-232 | connector/src/bybit/trade_stream.rs:142-147 \u2014 \u0060connector/src/binancefutures/market_data_stream.rs\u0060 and \u0060connector/src/binancespot/market_data_stream.rs\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 12 separate duplicated blocks between them, totalling at least 188 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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de281f6ccf05b41008c79ae4956b5566f65a56db82a19347f587abd28609da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): hftbacktest/src/backtest/proc/partialfillexchange.rs:441-448 | hftbacktest/src/backtest/proc/partialfillexchange.rs:457-464 | hftbacktest/src/backtest/proc/partialfillexchange.rs:506-513 | hftbacktest/src/backtest/proc/partialfillexchange.rs:569-576 | hftbacktest/src/backtest/proc/partialfillexchange.rs:585-592 | hftbacktest/src/backtest/proc/partialfillexchange.rs:637-644 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"4302916b650e34c5fd07ff4a2fd4af8a90a7c6409200698751ef0b11f9ed41ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:221-228 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:233-240 | hftbacktest/src/backtest/proc/partialfillexchange.rs:270-277 | hftbacktest/src/backtest/proc/partialfillexchange.rs:282-289 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f61a0601a33b6e595e95df6fccd9698b6ce2b3280dec832bae39b2656ed6202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): collector/src/binance/mod.rs:20-27 | collector/src/binancefuturescm/mod.rs:20-27 | collector/src/binancefuturesum/mod.rs:20-27 \u2014 \u0060collector/src/binance/mod.rs\u0060 and \u0060collector/src/binancefuturescm/mod.rs\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 53 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":"collector/src/binance/mod.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"febb532f09978df258dbbba9a0b0c7ee76a82f4b7f6f98ffb714b32811565a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): hftbacktest/src/depth/btreemarketdepth.rs:338-345 | hftbacktest/src/depth/hashmapmarketdepth.rs:495-502 | hftbacktest/src/depth/roivectormarketdepth.rs:641-648 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dba88217827997a25555f0319964dd94aee1183b1058136f65166e51896512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): collector/src/bybit/mod.rs:38-45 | collector/src/hyperliquid/mod.rs:73-80 \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":"collector/src/bybit/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2292ec1a62dbe12339c355569706f049d70126a23a901ff9235df2ccab9a77a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): connector/src/bybit/mod.rs:176-183 | connector/src/bybit/mod.rs:227-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":"connector/src/bybit/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb96d0506a59aea9787838af029e87bbf2f08c081af010f3873036bafa9e6ae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): connector/src/bybit/public_stream.rs:58-65 | connector/src/bybit/public_stream.rs:97-104 \u2014 both copies are in the same file, so extract the block 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":"connector/src/bybit/public_stream.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6a28fb1992a520cf79f274c90df75a77f8bfdccdb5c242b091504d4e8dcf60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hftbacktest/src/backtest/mod.rs:777-784 | hftbacktest/src/backtest/mod.rs:822-829 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/mod.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a47a82c0620a0525fb2360e3c3f57bc3a785f525f06d4799acc51bb419dc1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:251-258 | hftbacktest/src/backtest/proc/partialfillexchange.rs:300-307 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2ee82a0002313c1bed143a4cb93f7ceffb9bfa045ff43fdfeb8bbc38d1664d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:287-294 | hftbacktest/src/backtest/proc/partialfillexchange.rs:348-355 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"281f4290b157abab1acbf42ea59af51dddcb9b2dc21af2f160c0f3b5c4f0eaef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hftbacktest/src/depth/btreemarketdepth.rs:226-233 | hftbacktest/src/depth/hashmapmarketdepth.rs:319-326 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3799b4a57d385aeb8b0508e271b07c709e3a469454b5e24b7c9cc0de2e66aa45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hftbacktest/src/depth/hashmapmarketdepth.rs:406-413 | hftbacktest/src/depth/hashmapmarketdepth.rs:522-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"291f2da3269a510db814be4a65bb1389672dacee4521a877b8cb0533cdfe7c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hftbacktest/src/depth/hashmapmarketdepth.rs:433-440 | hftbacktest/src/depth/hashmapmarketdepth.rs:560-567 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"214e739c5b0f372252e6d339280fb996fe1eaa6bdbf9c442b7bc8084eeb97ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): connector/src/binancefutures/market_data_stream.rs:105-111 | connector/src/binancefutures/market_data_stream.rs:188-194 | connector/src/binancespot/market_data_stream.rs:105-111 | connector/src/binancespot/market_data_stream.rs:188-194 \u2014 \u0060connector/src/binancefutures/market_data_stream.rs\u0060 and \u0060connector/src/binancespot/market_data_stream.rs\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 12 separate duplicated blocks between them, totalling at least 188 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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bffba170477ad314db7a78ca3fc847dc2b884186108d36cf492511185e19987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): connector/src/binancefutures/rest.rs:176-182 | connector/src/binancefutures/rest.rs:255-261 | connector/src/binancespot/rest.rs:208-214 \u2014 \u0060connector/src/binancefutures/rest.rs\u0060 and \u0060connector/src/binancespot/rest.rs\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 7 separate duplicated blocks between them, totalling at least 92 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":"connector/src/binancefutures/rest.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c096c6d2b49fb0f13b1d42dc88488d75a15aa8cc06f4f3d68162696f3067cc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): connector/src/binancefutures/mod.rs:148-154 | connector/src/binancespot/mod.rs:151-157 \u2014 \u0060connector/src/binancefutures/mod.rs\u0060 and \u0060connector/src/binancespot/mod.rs\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 11 separate duplicated blocks between them, totalling at least 112 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":"connector/src/binancefutures/mod.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"109233285ffdb159b8018ea01f5b20ed454448c2a1d49a05d80845f038f58348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hftbacktest/src/depth/btreemarketdepth.rs:315-321 | hftbacktest/src/depth/hashmapmarketdepth.rs:468-474 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 152 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":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b06324e893ef935ea494740d9f89bd79da6774a210e939c151ad89d70e47030"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hftbacktest/src/types.rs:661-667 | hftbacktest/src/types.rs:685-691 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/types.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"725a0a5ff02f607b6802bf25f020f05c26b60978be7c46e291b8a4eab7cbb79c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): py-hftbacktest/src/live.rs:21-26 | py-hftbacktest/src/live.rs:78-83 | py-hftbacktest/src/live.rs:321-326 \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":"py-hftbacktest/src/live.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c8d12464484b39254b7caf39ca0763d945f9fe45eb724ca02b379e3f8fc225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): connector/src/binancefutures/mod.rs:112-117 | connector/src/binancespot/mod.rs:115-120 \u2014 \u0060connector/src/binancefutures/mod.rs\u0060 and \u0060connector/src/binancespot/mod.rs\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 11 separate duplicated blocks between them, totalling at least 112 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":"connector/src/binancefutures/mod.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbb2d0b16cb94e2fa2fa4f55a0e0bc72a0988208e846c340cf4333786cfb48a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): connector/src/bybit/public_stream.rs:167-172 | connector/src/bybit/trade_stream.rs:62-67 \u2014 before extracting anything, compare \u0060connector/src/bybit/public_stream.rs\u0060 and \u0060connector/src/bybit/trade_stream.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/bybit/public_stream.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f4587a8365fc3debe0fa25335612773516d646facbc64eb844126a56741dc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hftbacktest/src/depth/fuse.rs:597-602 | hftbacktest/src/depth/fuse.rs:617-622 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7551defb92eda4128202a785ddfc08aa6da15d6ddde1660dedaa59fa460905"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hftbacktest/src/live/ipc/iceoryx.rs:77-82 | hftbacktest/src/live/ipc/iceoryx.rs:118-123 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/live/ipc/iceoryx.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b51d62238388d358c45e89cd6ec24f1d9d733ea49d44912c5d0edba71256321"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hftbacktest/src/types.rs:648-653 | hftbacktest/src/types.rs:672-677 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/types.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee5b9419f40ac7ecb5872ebf661a66798b75692caa1c1881b3de9e6b96450ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:553-557 | hftbacktest/src/backtest/proc/nopartialfillexchange.rs:579-583 | hftbacktest/src/backtest/proc/partialfillexchange.rs:771-775 | hftbacktest/src/backtest/proc/partialfillexchange.rs:797-801 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe1a85a4b8a6730896c5515b1b006e3809b52f67447341b223d32a25dbe5e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): connector/src/binancefutures/mod.rs:65-69 | connector/src/binancespot/mod.rs:66-70 \u2014 \u0060connector/src/binancefutures/mod.rs\u0060 and \u0060connector/src/binancespot/mod.rs\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 11 separate duplicated blocks between them, totalling at least 112 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":"connector/src/binancefutures/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0acec56af4c4ae9629d4956f0751050df783f106ef664bad1ba52facc9190c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): connector/src/binancefutures/mod.rs:71-75 | connector/src/binancespot/mod.rs:72-76 \u2014 \u0060connector/src/binancefutures/mod.rs\u0060 and \u0060connector/src/binancespot/mod.rs\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 11 separate duplicated blocks between them, totalling at least 112 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":"connector/src/binancefutures/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbf66b922b72ebc9e914653f12a34bfacd4bd8aaa1b62271a59e41cf0686bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): connector/src/bybit/mod.rs:75-79 | connector/src/bybit/mod.rs:81-85 \u2014 both copies are in the same file, so extract the block 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":"connector/src/bybit/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"addcc4e6801eea494dcf7de14726def4f5d7f72ac7533637538019f039c44385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hftbacktest/src/backtest/models/queue.rs:502-506 | hftbacktest/src/backtest/models/queue.rs:549-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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aea76d9acdbb740d8119b7607736fbf5486b4741cdc5a69c5c5989426121fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:262-266 | hftbacktest/src/backtest/proc/partialfillexchange.rs:317-321 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e9053ff72187e32024a7997ddfb2ad3fcbd2cb8b5cdfd33b81e81d83eb5a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:298-302 | hftbacktest/src/backtest/proc/partialfillexchange.rs:365-369 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bee024dc4e0d31c14be26386993397119a8558dd1ee39b8721530586037591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hftbacktest/src/depth/fuse.rs:601-605 | hftbacktest/src/depth/hashmapmarketdepth.rs:346-350 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/fuse.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40b6b3d80707a9062163e7bae9ccd456ade1592d5042582062f09fb0ce9b376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hftbacktest/src/depth/fuse.rs:621-625 | hftbacktest/src/depth/hashmapmarketdepth.rs:367-371 \u2014 before extracting anything, compare \u0060hftbacktest/src/depth/fuse.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 as WHOLE FILES: this scan already matched 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"435b9b1c43ba3edf052bff2b5447c8bead8777c53cbd91235eb2a4d028d5cf10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): connector/src/binancefutures/market_data_stream.rs:52-63 | connector/src/binancespot/market_data_stream.rs:52-63 \u2014 \u0060connector/src/binancefutures/market_data_stream.rs\u0060 and \u0060connector/src/binancespot/market_data_stream.rs\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 12 separate duplicated blocks between them, totalling at least 188 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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb742af8030dcf3294897e8bed3a836a4e07845ed70a7762996d8c140157df60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): connector/src/binancefutures/mod.rs:228-234 | connector/src/binancespot/mod.rs:231-237 \u2014 \u0060connector/src/binancefutures/mod.rs\u0060 and \u0060connector/src/binancespot/mod.rs\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 11 separate duplicated blocks between them, totalling at least 112 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":"connector/src/binancefutures/mod.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2601a2541409824d4582d6f0a811e9fc9774be730a9492528e6cb0b81de881f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): connector/src/binancefutures/rest.rs:26-33 | connector/src/bybit/rest.rs:21-28 \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":"connector/src/binancefutures/rest.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ed6f650549b4b665261db468228709fbb31ed00e65c45aa040ddb4d6fc4987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): connector/src/binancefutures/rest.rs:39-49 | connector/src/binancespot/rest.rs:43-53 \u2014 \u0060connector/src/binancefutures/rest.rs\u0060 and \u0060connector/src/binancespot/rest.rs\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 7 separate duplicated blocks between them, totalling at least 92 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":"connector/src/binancefutures/rest.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e6ccd0a39236d22cf4eaaff21f6c782381d891bd75486c820088344b2afdf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): connector/src/binancefutures/msg/mod.rs:16-23 | connector/src/binancespot/msg/mod.rs:16-23 \u2014 before extracting anything, compare \u0060connector/src/binancefutures/msg/mod.rs\u0060 and \u0060connector/src/binancespot/msg/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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":"connector/src/binancefutures/msg/mod.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc4d25cd3ec9d84d0db6f5648aa9d0ef20e041d2fd507bca9dac5ebbb22f929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): connector/src/binancefutures/msg/mod.rs:48-60 | connector/src/binancespot/msg/mod.rs:48-60 \u2014 before extracting anything, compare \u0060connector/src/binancefutures/msg/mod.rs\u0060 and \u0060connector/src/binancespot/msg/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 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":"connector/src/binancefutures/msg/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fc65039a6cd1669b4582b8a29ee596598aca5bbd3c1ae57637f8888f0bdf0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hftbacktest/src/backtest/proc/l3_local.rs:64-74 | hftbacktest/src/backtest/proc/local.rs:64-74 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_local.rs\u0060 and \u0060hftbacktest/src/backtest/proc/local.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 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":"hftbacktest/src/backtest/proc/l3_local.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dac7be155e43286e2d1ff72000dd5937b689669e48d697316c23fd73af1ede6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hftbacktest/src/backtest/proc/l3_local.rs:175-181 | hftbacktest/src/backtest/proc/local.rs:236-242 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/l3_local.rs\u0060 and \u0060hftbacktest/src/backtest/proc/local.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 123 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":"hftbacktest/src/backtest/proc/l3_local.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6f836bbd1cdf863d9ee29a831e4d8fdd53dcdb6a9ea6e92e206813f8064c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): hftbacktest/src/backtest/proc/nopartialfillexchange.rs:101-112 | hftbacktest/src/backtest/proc/partialfillexchange.rs:115-126 \u2014 before extracting anything, compare \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 283 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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1655c6b049e81cfcf248c6c23eeb5bbc84e2a9388b5e762db894b211b737bdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): connector/src/binancefutures/ordermanager.rs:145-158 | connector/src/binancespot/ordermanager.rs:130-143 \u2014 \u0060connector/src/binancefutures/ordermanager.rs\u0060 and \u0060connector/src/binancespot/ordermanager.rs\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 9 separate duplicated blocks between them, totalling at least 183 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":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bed7c8f39e8cdc8a7b702a03435ef43b90e74c75c0ab16ff01685ef5142c2d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): connector/src/bybit/mod.rs:313-327 | connector/src/bybit/mod.rs:338-352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/bybit/mod.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee190a45856262e95d04ae22934f925b18230f263ebbeb2d7e9a0f10ebe9ae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): collector/src/bybit/http.rs:88-101 | collector/src/hyperliquid/http.rs:78-91 \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":"collector/src/bybit/http.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bf61afb8758bd9a59611e2d82d262627dc063a61e360e36a922bbfe7dc59bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): collector/src/binance/http.rs:22-32 | collector/src/binancefuturescm/http.rs:22-32 | collector/src/binancefuturesum/http.rs:22-32 \u2014 \u0060collector/src/binance/http.rs\u0060 and \u0060collector/src/binancefuturescm/http.rs\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 4 separate duplicated blocks between them, totalling at least 114 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":"collector/src/binance/http.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c06c09975a862306b73937aa43285164aeffbf5d615d23049570dc6ba0e47f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): connector/src/bybit/mod.rs:131-137 | connector/src/bybit/mod.rs:177-186 | connector/src/bybit/mod.rs:228-234 \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":"connector/src/bybit/mod.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2534fb4a99cb4a79bbc568329430951feafd54f9b16d0c871f58ab11de7693a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): connector/src/bybit/private_stream.rs:315-324 | connector/src/bybit/trade_stream.rs:122-131 \u2014 before extracting anything, compare \u0060connector/src/bybit/private_stream.rs\u0060 and \u0060connector/src/bybit/trade_stream.rs\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"connector/src/bybit/private_stream.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ea797f3b9eaebbed52f1284c4750876b4eedb27cb0d68bf8aa02be5055088b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hftbacktest/src/backtest/data/reader.rs:390-396 | hftbacktest/src/backtest/data/reader.rs:415-420 \u2014 both copies are in the same file, so extract the block 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":"hftbacktest/src/backtest/data/reader.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b4d214c8b41ef703d269a6d7e569c3c600a26b1c1d8b368429cbd662ff6ad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): connector/src/binancefutures/user_data_stream.rs:122-126 | connector/src/binancespot/user_data_stream.rs:120-124 \u2014 \u0060connector/src/binancefutures/user_data_stream.rs\u0060 and \u0060connector/src/binancespot/user_data_stream.rs\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 6 separate duplicated blocks between them, totalling at least 79 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":"connector/src/binancefutures/user_data_stream.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8abbfe62dbe10c6448e2d148ac3fd084d286a163e332d64b98778e966c04e05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): py-hftbacktest/hftbacktest/data/utils/binancefutures.py:28-89 | py-hftbacktest/hftbacktest/data/utils/bybit.py:379-427 \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":"py-hftbacktest/hftbacktest/data/utils/binancefutures.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e72f7410c3c579fa2e4dc4e8b18804797fbe6ec1d9dd536549850d859e5335"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201344 lines \u00D7 3): py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py:48-91 | py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py:170-212 | py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py:229-268 \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":"py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5870e8976483a731c6d6fbf0c5b19c4cbb48a6ef4cc4e8d92718854f96d64ec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201334 lines \u00D7 4): py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py:56-88 | py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py:177-209 | py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py:236-265 | py-hftbacktest/hftbacktest/data/utils/bybithistmktdata.py:106-139 \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 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":"py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad666096dc7fafc08987948cb7c4142c3b0952a3742e9930a36a6e58065e2736"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): py-hftbacktest/hftbacktest/data/utils/tardis.py:136-169 | py-hftbacktest/hftbacktest/data/utils/tardis.py:516-549 \u2014 both copies are in the same file, so extract the block 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":"py-hftbacktest/hftbacktest/data/utils/tardis.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cd6cb448cd0ad3141f297ecfa094a20a831e1493f9af8e8b806bceb13849dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): py-hftbacktest/hftbacktest/data/utils/tardis.py:180-208 | py-hftbacktest/hftbacktest/data/utils/tardis.py:585-613 \u2014 both copies are in the same file, so extract the block 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 \u0060py-hftbacktest/hftbacktest/data/utils/tardis.py:180\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":"py-hftbacktest/hftbacktest/data/utils/tardis.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d478f8c26748cee24fd47fa4e18a41d2a991104c73d09b526aaeb0f6df1cfff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 8): py-hftbacktest/hftbacktest/data/utils/binancefutures.py:281-297 | py-hftbacktest/hftbacktest/data/utils/binancehistmktdata.py:287-303 | py-hftbacktest/hftbacktest/data/utils/bybithistmktdata.py:161-175 | py-hftbacktest/hftbacktest/data/utils/databento.py:111-127 | py-hftbacktest/hftbacktest/data/utils/hyperliquid.py:165-181 | py-hftbacktest/hftbacktest/data/utils/mexc.py:181-197 | py-hftbacktest/hftbacktest/data/utils/tardis.py:215-231 | py-hftbacktest/hftbacktest/data/utils/tardis.py:624-640 \u2014 there are 8 copies across 7 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 8 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":"py-hftbacktest/hftbacktest/data/utils/binancefutures.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c11fa6dc3253f1543dbc44d4df6d60b115349eab348dd5f07ccb6265568019c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): py-hftbacktest/hftbacktest/data/utils/bybit.py:159-173 | py-hftbacktest/hftbacktest/data/utils/bybit.py:419-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. 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, \u0060py-hftbacktest/hftbacktest/data/utils/bybit.py:156\u0060 calls \u0060_Fuse\u0060 and \u0060py-hftbacktest/hftbacktest/data/utils/bybit.py:416\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":"py-hftbacktest/hftbacktest/data/utils/bybit.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2c2f247cadd7996545edb58e544a2c521db97d3630064ed952d93eac075af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): py-hftbacktest/hftbacktest/data/utils/bybit.py:223-239 | py-hftbacktest/hftbacktest/data/utils/bybit.py:452-468 \u2014 both copies are in the same file, so extract the block 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":"py-hftbacktest/hftbacktest/data/utils/bybit.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a93feec53f69b35a68f07ac96b3ca6386d904a9173614948133390b96487ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): hftbacktest/examples/4_latency.py:31-44 | py-hftbacktest/hftbacktest/data/utils/feed_order_latency.py:29-42 \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":"hftbacktest/examples/4_latency.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0c8f76be2d3f8f7bac0f5065d0e260b7ddbff1bf342827bdf87ed4cf2caf9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): py-hftbacktest/hftbacktest/data/utils/binancefutures.py:82-90 | py-hftbacktest/hftbacktest/data/utils/bybit.py:158-166 | py-hftbacktest/hftbacktest/data/utils/bybit.py:418-428 \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. 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, \u0060py-hftbacktest/hftbacktest/data/utils/bybit.py:156\u0060 calls \u0060_Fuse\u0060 and \u0060py-hftbacktest/hftbacktest/data/utils/binancefutures.py:80\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":"py-hftbacktest/hftbacktest/data/utils/binancefutures.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"915372a3f59ec4616556c501fbab663c0a614233db59261ea460f8bbf2adfa79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): py-hftbacktest/hftbacktest/data/utils/tardis.py:286-296 | py-hftbacktest/hftbacktest/data/utils/tardis.py:301-311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-hftbacktest/hftbacktest/data/utils/tardis.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12dad7229406bce15d18d38409cba88781f0e723f46febae9e2464c39558359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): py-hftbacktest/hftbacktest/data/utils/tardis.py:147-156 | py-hftbacktest/hftbacktest/data/utils/tardis.py:177-186 | py-hftbacktest/hftbacktest/data/utils/tardis.py:527-536 | py-hftbacktest/hftbacktest/data/utils/tardis.py:582-591 \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 \u0060py-hftbacktest/hftbacktest/data/utils/tardis.py:147\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":"py-hftbacktest/hftbacktest/data/utils/tardis.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf5974d85e4cdd50a7c34081f260ce6593bf3826a57364b95800a3f42bbb8bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): hftbacktest/examples/4_latency.py:48-56 | py-hftbacktest/hftbacktest/data/utils/feed_order_latency.py:74-81 \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 \u0060hftbacktest/examples/4_latency.py:48\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":"hftbacktest/examples/4_latency.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f5bfc38263dae4f06cfbafe65f6a3944ff2b52a061ae0fb501216933fb28d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): py-hftbacktest/hftbacktest/data/utils/hyperliquid.py:70-78 | py-hftbacktest/hftbacktest/data/utils/mexc.py:56-64 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060py-hftbacktest/hftbacktest/data/utils/hyperliquid.py:68\u0060 calls \u0060DiffOrderBookSnapshot\u0060 and \u0060py-hftbacktest/hftbacktest/data/utils/mexc.py:54\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":"py-hftbacktest/hftbacktest/data/utils/hyperliquid.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdcafbce17a8fd7874b85ae255666206a1b77a732456ad4cd5b3beef094c59e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 5): py-hftbacktest/hftbacktest/data/utils/tardis.py:145-152 | py-hftbacktest/hftbacktest/data/utils/tardis.py:175-182 | py-hftbacktest/hftbacktest/data/utils/tardis.py:525-532 | py-hftbacktest/hftbacktest/data/utils/tardis.py:556-562 | py-hftbacktest/hftbacktest/data/utils/tardis.py:580-587 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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":"py-hftbacktest/hftbacktest/data/utils/tardis.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e614e39f7e6deb20e89ce04e78e779d6b3df3d050c86871ffc00ef022ae2d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): py-hftbacktest/hftbacktest/data/utils/tardis.py:260-267 | py-hftbacktest/hftbacktest/data/utils/tardis.py:270-277 | py-hftbacktest/hftbacktest/data/utils/tardis.py:315-322 \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":"py-hftbacktest/hftbacktest/data/utils/tardis.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55a77a58c44ad710443c7de8c01fe9265d5283a0f8a1efce45a10d81a65531c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): examples/example_bybit.py:11-20 | examples/example_hyperliquid.py:10-19 | examples/example_mexc.py:10-19 \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":"examples/example_bybit.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bccd202e06004d112e63621dbf73db94661c0e482c6f0b266100b616df0f47"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RiskAdverseQueueModel (LCOM4 4): RiskAdverseQueueModel\u0027s methods fall into 4 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 4 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70ed1d2377331c6937c7c43f861c49d804ed911902861679c9083699c7a0f5d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ProbQueueModel (LCOM4 4): ProbQueueModel\u0027s methods fall into 4 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 4 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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfd5fa9318953384eeabf965abb58dab5cfdbc6f676c09e9ecac0c6317d028b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: collector/src/hyperliquid/http.rs: collector/src/hyperliquid/http.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in collector::hyperliquid::http::connect at line 20. 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 2025-09-24..2025-12-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272025-09-24 10:31:05 -05:00\u0027 --until=\u00272025-12-23 10:31:05 -05:00\u0027 --full-history --no-merges -- collector/src/hyperliquid/http.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"collector/src/hyperliquid/http.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe36c55aecdc8ffdabd8e4c50a2109bc757968d20b6283953c8effc6552f1295"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: check the Spot API rate limits. \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":"collector/src/binance/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86c144e14455f6e267b2f71f1d253c4fb4ce9541077edc1b2b1609efa2469b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: reset the connection. \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":"connector/src/binancefutures/user_data_stream.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"d282ee20e86f2536bc74a5e4f4629f0d517f6827f5230a05c7200d51e76e89a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: rate-limit throttling. \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":"connector/src/binancefutures/user_data_stream.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be06a762f8d86ecceb40e2d0ed45ea840e4311bb2c4eb4c9b10879af7001e0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: rate-limit throttling. \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":"connector/src/binancefutures/user_data_stream.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b136b05bbfcecae3da36adcf9d6b5b3276055382437791eedda290b11c4f3fa9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: rate-limit throttling. \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":"connector/src/binancespot/user_data_stream.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d93fe5b30e04fb09b5bdfd153de755a287b3b5ee9d05af24bfd92e9ec076ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: rate-limit throttling. \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":"connector/src/binancespot/user_data_stream.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"698ee471220dd965983e87f0ee2017e311461dc6ad81121927747be4d9d6428e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: rate-limit throttling. \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":"connector/src/bybit/private_stream.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c61b79ce74d53300e8a49e1751b5c4f8c9c9945e70224c20e239f4e2b0c5fcd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: rate-limit throttling. \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":"connector/src/bybit/private_stream.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c134ce841c335ed981a16ed340269ec4690e07ed5149f963b06fd573c6e48ac4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: something went wrong? \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":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc97edb4cdfe81e502a943ebc15e83320d84525f8a801614ffad9844146fc9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: something went wrong? \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":"connector/src/binancespot/ordermanager.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f83db4c5b47e40c19d8297a074a1d7818a49ab86da021703c70bc8c538836d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: check if the exchange timestamp exists in the REST response. \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":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"38128651cdfd97ead38efdeba431b039e4f9ab120d8880824de73ee4f787c91a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: check if the exchange timestamp exists in the REST response. \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":"connector/src/binancespot/ordermanager.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a438becf2916e439500ff3e51dd45245e8e3278cbf01ebc3a7a90aed8497190"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fixme: currently supports natural refresh only. \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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c8cf0748c36303d241d41ae1d67b95acdafbce7ef0e2ee5174f5bde2113e51"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fixme: currently supports natural refresh only. \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":"connector/src/binancespot/market_data_stream.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb1c3a43675c2e0d7ba86345c7dc27958e78b91fa86ecc10777a9f002e8bb24"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fixme: waits for pending messages without blocking. \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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cc2c3d54dbac3da6e765dd689f51cccd7dce3eb89548db942bbc07edf5e733"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fixme: waits for pending messages without blocking. \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":"connector/src/binancespot/market_data_stream.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"9563cf660cc9ab09b5e4c0edde460789c1ad60501f152ac329bf6b3be0614605"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //         todo!() \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":"connector/src/binancefutures/market_data_stream.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc04aa6b8a8c06d1c3065abcf19794272c99c7ae9738890a0732fc2c96ef3ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //         todo!() \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":"connector/src/binancespot/market_data_stream.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"169eae8e054de7b4071833fa656943ee48d381df73e4cba55d6fcd1947079a59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: there is no orderLinkId, it requires a separate orderId \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":"connector/src/bybit/private_stream.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa4f4467c478d22e6fd1b5453904bea8af5530174dbc9d2ae732dce432a81be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo \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":"connector/src/bybit/private_stream.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"79e446d31c38dc62088be70ba8dbfbcdfac5edbf64dfc6df09529b960ac4254e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fixme: there is no valid order_link_id. \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":"connector/src/bybit/ordermanager.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bf95ec7c50a7467edcbc27c2449f22a783651fb407e8bf733b4e146637489a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // // todo: fix the operation order. \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":"connector/src/bybit/mod.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d446338444bf86bb921a31a16772e95203152aa55071a5c0575833967f14221a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: L3PartialFillExchange is unsupported. This is verified within \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":"hftbacktest-derive/src/lib.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6699bf6d219f63e2119414ff508c8fa75600999e865416272c1fd0a10f6b538"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: implement logic for handling market feed events. \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":"hftbacktest/examples/custom_evhandling.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"eace8f17ef00dc82aab95aa305f9faf508b03ec88429d5f2c3d4618b2e1c253e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Implement logic for handling order response events. \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":"hftbacktest/examples/custom_evhandling.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"194497493511c0b4ff63ebf09fa83e8a3e1ef2cfe0a72e84796bc529754c6f12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo!: improve this to deliver detailed error information. \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":"hftbacktest/src/types.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef2bb7d686450aa30de52ec30b684c1aa4aae6ce14a818f2755ea396ace5006"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: currently, they are cumulative values, but they need to be values within the record \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":"hftbacktest/src/types.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6fd0ae5ca3a29afb0da8994622aec6da2fbdc55d1a978641cece654f658944"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Status::Replaced or Status::New? \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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d531fb1653b9f42558d5c5d77772f21d0eca62ec2b41a29191a2494f5f41745"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Status::Replaced or Status::New? \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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"8128efcc78f20a3aee8f58d3f52e06d430c4fb10312c5ec4764f88ca1624fba4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Status::Replaced or Status::New? \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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd8cd92f76dafb783912528ff8117dc84917cbdbb15e403b2f2791a505135bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Status::Replaced or Status::New? \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":"hftbacktest/src/backtest/models/queue.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dcc7b6d692360f6036727891dd6f1ee187e5fb94809dcbdb8b82cdec98a982"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Status::Replaced or Status::New? \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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0a735f884b3b68a50bd8bc82836d86a3b7e24ed1bdaacaff2e80dd1f91107b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Status::Replaced or Status::New? \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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6622049b8f3ad4fd18036259ccbcb4663c37f1e26c9dcd0e82f1b1119f6fda3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Status::Replaced or Status::New? \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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f56fc98c0be9bf57a771aac30da4ec0b996b2d0e868743ae8b65a8146470768"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Status::Replaced or Status::New? \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":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fa20006ecc0b6e8b0604422dc083b054dc3f685413403c5318fd86a2e7c662"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: Status::Replaced or Status::New? \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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d88118df32e1768ca1d27a9ea21916030e0364309b67cff11cc80b70cb856b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: set the proper upper bound. \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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"548b23df356b88f0dbaa978741118afb9719cae624c1f63ee8ab70d432fa3853"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: set the proper lower bound. \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":"hftbacktest/src/backtest/proc/partialfillexchange.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5f26e613f26d17036fb298153b7ce7bbd66ecbdaa2f319001593c31f2a74e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: handle properly if no side is provided. \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":"hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de18623dc4dd4022ab58c0031f6ad0cf2749ee7f73aa0e85070ed3e8e88462e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: it\u0027s not a problem now, but it would be better to have valid timestamps. \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":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12934fec3f1bd3bcd1c27f253b6f8284a162c434616320ef382725a0d8c6068"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: it\u0027s not a problem now, but it would be better to have valid timestamps. \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":"hftbacktest/src/depth/hashmapmarketdepth.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e307cf376948960cd4ea418dca7cd6e638a619dcfc14759e63a8d9f27b505c0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: it\u0027s not a problem now, but it would be better to have valid timestamps. \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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b01dcc1e8a3c1ed6e898ab8b48942971930ac0ec148b7f7de73fa3d97e39fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: it\u0027s not a problem now, but it would be better to have valid timestamps. \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":"hftbacktest/src/depth/fuse.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ce865781dc7ccb4b773b594f27838c78fe2b45ffb6049c7d6437384b44d69d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fixme: timeout should be specified by the argument. \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":"hftbacktest/src/live/bot.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6426de33d1189f23eb5527091e653349cda75a06d22a89f7a92e33f7ad5320b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // fixme: timeout should be specified by the argument. \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":"hftbacktest/src/live/bot.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead7a28adce02f814b1fb228e45f2729fc8a1c6737f914037febe717b6f986a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: implement the missing fields. Trade values need to be changed to a rolling manner, \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":"hftbacktest/src/live/bot.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0de71e21f02aef913627305c4b913a91224fba683f72417e1a95211ba181cb0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: this needs to retrieve Iox2Event without waiting. \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":"hftbacktest/src/live/ipc/iceoryx.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"948dc9bfd7dcbb69772abc192e825eff9c16f8e5c22cd5818624e7d878dc7b0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: it may cause incorrect usage. \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":"hftbacktest/src/live/ipc/iceoryx.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e3b128198a7f4941c8975dd83e1c99201eed7ea5d70f2a6cfc7de741ab5725"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: fix WAIT_ORDER_RESPONSE flags. \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":"py-hftbacktest/hftbacktest/types.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9435b17ffccbb10ed3dd18d4c929327b5fdad8473922b9501679ecd2508d315d"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no installation or build instructions: Getting Started steps clone the repo and build Connector but do not show how to install from crates.io or run a single instance without Cargo. Add an Install section for both cargo add hftbacktest and the development version git clone, plus a short Run/Start command example."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"537a4499d1ed95a6ed33ef51ebd99bd4b12633c8dd15fae2aec4aed70b268f0c"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no usage examples: The Getting Started guide shows how to run multiple Connector instances but does not explain what each instance represents or how to configure them. Add a Usage section describing the required configuration and an example of running one or more bots on the same exchange."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5972f8d3c5858e923a8e33492e09ab9f2fa0e3cc8f8a70d63cffa0f90c5b1392"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no architecture or design documentation: The document is a debugging guide but no architecture or model-design documentation exists among the 23 architecture/Docs markdown files. Add an Architecture section describing the backtest models, latency types, and queue models referenced in this doc."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/debugging_backtesting_and_live_discrepancies.rst"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c03fefccef7eef828ce6ee00ad91effa95eaf831ad2a11228d9466af9c7d353"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no architecture or design documentation: The reference module listing is a reference doc, not architecture/design documentation. Add an architecture section describing the data-flow model and why each referenced class exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/reference/data_validation.rst"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ef4e90c6ee59759b3c6e2e048d62287519c514e95c2a3bd38d4f95ef53a02f"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant operations for setting cache entries. \u0060insert\u0060 and \u0060set\u0060 appear to perform the same function (storing data under a key), creating confusion about which to use or if they have different side effects (e.g., overwrite vs. ignore existing).: Remove \u0060insert\u0060 and keep \u0060set\u0060, or vice versa, to provide a single canonical method for storing data in the cache. (signatures: Cache.insert(key: String, data: Data) | Cache.set(key: str, data: Data))"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d49bf86a9cf486d7c35af3b8196739d3cdad222e5a990b7fef3851efaf2daa1e"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent order submission API. \u0060submit_buy_order\u0060 and \u0060submit_sell_order\u0060 are convenience methods that duplicate the functionality of \u0060submit_order\u0060 when an \u0060OrderRequest\u0060 with a \u0060Side\u0060 is provided. This forces users to choose between a verbose specific method or a generic one, and creates API surface bloat.: Remove \u0060submit_buy_order\u0060 and \u0060submit_sell_order\u0060, relying solely on \u0060submit_order\u0060 with the \u0060Side\u0060 field in \u0060OrderRequest\u0060 to determine direction. (signatures: Bot.submit_buy_order(...) | Bot.submit_sell_order(...) | Bot.submit_order(asset_no: usize, order: OrderRequest, wait: bool))"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a7ff577a5af7d5a4015bd996e28aae7676fcd5139bae503deabffa5bdc7a6558"}},{"ruleId":"D22","level":"warning","message":{"text":"Conflicting accessors for the same property. \u0060descr\u0060 is exposed as both a property returning a typed \u0060DType\u0060 and a method returning a \u0060String\u0060. This is inconsistent with Rust conventions (properties are fields/getters, methods are actions) and creates ambiguity on how to access the description.: Keep the property \u0060descr: DType\u0060 for typed access and remove the method \u0060descr(): String\u0060, or rename the method to \u0060descr_str()\u0060 if string representation is needed. (signatures: NpyHeader.descr(): String | NpyHeader.descr: DType)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6f0f0693316069c8f3b365d9a4dcba4d346f2d039202a9b26cfad728994be146"}},{"ruleId":"D22","level":"warning","message":{"text":"Ambiguous naming for time progression. \u0060elapse\u0060 and \u0060elapse_bt\u0060 (likely \u0027backtest\u0027) suggest similar functionality (advancing time), but the distinction is unclear from the names alone. It is not immediately obvious if \u0060elapse_bt\u0060 is a specialized version or if one is deprecated.: Rename \u0060elapse_bt\u0060 to \u0060elapse_backtest\u0060 or \u0060elapse_simulation\u0060 for clarity, or unify them if they serve the exact same purpose. (signatures: Bot.elapse(duration: i64) | Bot.elapse_bt(duration: i64))"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aa2265db24a919dd66a2bb3fa3522aec34488e21ae6241f3991d4e7b48dfc894"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ddc49ef52c93f5d89390c80bf8f0444bb97743496eeea781d1b7fcf904a3ea48"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"565cb0a25235d1502010c8d34a025c6ae5aeb826c7d5e305b97bb45399050c67"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9517cc4ae56162be6ef5c2593f4757b2854c319ee602e4c89f34f65769f92a5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fdd80ff4efa055538dc59aafc5e380459b7d05030fbc7ee936f19fa678b3e896"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"924c2d13ca7fd2b4129dbf95429d150bd11c7ff8602200beae15ca402d38177c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"402527aca5275e98dcce96caed3ed411a3e1dbfa73fbfdb5c774b35dc14313be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759a321db5526941df0b9b1dfa052eb6b42832f3933c7187e01cd533c3b42a88"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8d43e8f931c33d5d6162749e6b1e6267534aaa747a838d080d92c2bb9208055"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13d30ad0dffe63e8e1ce28cab774cddfa7b4d8de0bb42a2d0191c596cd47bf7e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b1a3c4ee5cf76d6bcb67d33b58764c364f19679eda3d6025688dbb18cd943cf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51694dcadcb1484003c3b621ae18134d747d5c49405cfc2349fcebe88f653f0d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c06051938303e391f30117e18cef052254cb7f1e6f04305495c5e2eaa060d9a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f57f912740c29eaf2098da84f6ffdd807ed4c8c3968347cd288b9f14ffcb10c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7054a1432ea3ae87bfb105ddc2ba4900c7c8868e7a1ea01b3a8664104298bfa1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e09b0ad1aaa9aa91f806b0785c8dfda082ae22c9dd75b2b7653adaba9f967b8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20640f19c361b83b4a14f85587f4ef9dee39779d1ce357e34f75930921bd3a90"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac9b6fbad98761e1147e7b4dfa57763e4b3814fb377e1f8f8f77d49052fb2a02"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"12f79472958a1009630827617fa480296d3794a563688f556de4c88d3f797421"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac6d77443e9aa171422196483c010badcc747cbf14a548f62602e37c86f81a59"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe972d911505d3befbf7f4da86f548222c27f9a2de3a709dd79ed4749d19aa5e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1ef740d39790ecdec811a3be539c5681ae47acc506a6e3698abc95d91136df8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33573ade1e30cec3da562f8dd02bdc463b91e6659ede811595f537ae41b4a62b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23c7a8a3357d2c9c035924d204d7611430cf3f88937b4abe61bf8b24a477ba96"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f83cec2a80ca61fccb489a1fd5ab6d2a989f079716721c008b94dcf216e70f50"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07e880bb5f5e277ddbf62e039ad71075743c4e9a9e5029e609a530a585377e47"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae40e0a183df80d5dc91dadf0f98b8fb53348980981ea420dd8271b894c7bd62"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab8d83539c5ebe567cb6deae98d392d6617f9ea4001a34a9a21fb3f393c0be8f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"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":"a07ea385f3c33eb66d794cc1a532171603bb59f2427fc2089054115b28998296"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4e050aa39e933ef59b07c491a4a9afc925c66058d3a8c05703890ec59737508"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"4394d790f49da93879752dc7ab63517bc06e5fc85e1045e898aea9fdde84c080"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"8c2bf456731ae768ee2d7c1c8542f5c5c7057d674b7f341fe5dd5fa4300a30f8"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 19 of 83 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 83 of the 108 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: connector/src/bybit/msg.rs, connector/src/bybit/private_stream.rs, connector/src/binancespot/ordermanager.rs, connector/src/bybit/trade_stream.rs, connector/src/binancefutures/msg/stream.rs, connector/src/binancefutures/msg/rest.rs, hftbacktest/src/utils/aligned.rs, py-hftbacktest/hftbacktest/data/utils/difforderbooksnapshot.py (and 11 more). 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":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: rest.rs \u2194 bot.rs: \u0060connector/src/binancefutures/rest.rs\u0060 (context connector) and \u0060hftbacktest/src/live/bot.rs\u0060 (context hftbacktest) sit in DIFFERENT parts of the tree yet change together 69% of the time (9 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006068d580d6\u0060 refactor: prepare to merge with the master branch.; \u0060374236e8\u0060 refactor: formatting (at that commit the files were still \u0060rust/src/connector/binancefutures/rest.rs\u0060 and \u0060rust/src/live/bot.rs\u0060); \u0060b09d705b\u0060 dev: the quantity at the front of the queue is introduced as a defaul\u2026 (at that commit the files were still \u0060rust/src/connector/binancefutures/rest.rs\u0060 and \u0060rust/src/live/bot.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/binancefutures/rest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed82dfb89b32524bbd538d79512cdc5af93a6d7e301ebdd05fc2ceb1b8e57fce"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 bot.rs: \u0060connector/src/binancefutures/mod.rs\u0060 (context connector) and \u0060hftbacktest/src/live/bot.rs\u0060 (context hftbacktest) sit in DIFFERENT parts of the tree yet change together 50% of the time (14 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u00606ff831a7\u0060 refactor(rust): rename ipc structs.; \u0060fdcaf2c7\u0060 fix(rust): fix the order and position initial snapshot as a batch fee\u2026; \u006068d580d6\u0060 refactor: prepare to merge with the master branch. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/binancefutures/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fdd516a24b00c7b239d4536f006d5827a7b7518e3b39028d2519bc2900274e"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: ordermanager.rs \u2194 bot.rs: \u0060connector/src/binancefutures/ordermanager.rs\u0060 (context connector) and \u0060hftbacktest/src/live/bot.rs\u0060 (context hftbacktest) sit in DIFFERENT parts of the tree yet change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060fdcaf2c7\u0060 fix(rust): fix the order and position initial snapshot as a batch fee\u2026; \u006068d580d6\u0060 refactor: prepare to merge with the master branch.; \u0060374236e8\u0060 refactor: formatting (at that commit the files were still \u0060rust/src/connector/binancefutures/ordermanager.rs\u0060 and \u0060rust/src/live/bot.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/binancefutures/ordermanager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf11d9dec2a21353eb03d884cf8a859324ef8bbf69831b30126fb877cea23ab9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: connector.rs \u2194 bot.rs: \u0060connector/src/connector.rs\u0060 (context connector) and \u0060hftbacktest/src/live/bot.rs\u0060 (context hftbacktest) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00606ff831a7\u0060 refactor(rust): rename ipc structs.; \u0060a6671ed7\u0060 refactor: bybit connector. (WIP) (at that commit the files were still \u0060rust/src/connector/mod.rs\u0060 and \u0060rust/src/live/bot.rs\u0060); \u00601ea67d5c\u0060 feat: add \u0060Recorder\u0060 and working on batch order. (at that commit the files were still \u0060rust/src/connector/mod.rs\u0060 and \u0060rust/src/live/bot.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/connector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1b284168beb1678e77b360edcbdda61b985dcd94cf031edffac0661bc693a8"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 bot.rs: \u0060connector/src/bybit/mod.rs\u0060 (context connector) and \u0060hftbacktest/src/live/bot.rs\u0060 (context hftbacktest) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u00606ff831a7\u0060 refactor(rust): rename ipc structs.; \u0060fdcaf2c7\u0060 fix(rust): fix the order and position initial snapshot as a batch fee\u2026; \u006068d580d6\u0060 refactor: prepare to merge with the master branch. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"connector/src/bybit/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd94da99a06296ba08fbf8896960cc70766c90232c1f2aa7137fd2730a5b7ce"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: btreemarketdepth.rs \u2194 hashmapmarketdepth.rs: \u0060hftbacktest/src/depth/btreemarketdepth.rs\u0060 and \u0060hftbacktest/src/depth/hashmapmarketdepth.rs\u0060 change together 83% of the time (10 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00601b33a781\u0060 fix: fix L3 backtesting.; \u0060f6097e18\u0060 feat(rust): add functionality to retrieve the depth snapshot.; \u0060e6ac0f8a\u0060 feat(rust): add unstable version of \u0060FusedHashMapMarketDepth\u0060 to fuse\u2026 (at that commit the files were still \u0060rust/src/depth/btreemarketdepth.rs\u0060 and \u0060rust/src/depth/hashmapmarketdepth.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/depth/btreemarketdepth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d618c27a52ddc22071f3ec2f68e348e322ad2ffce3cca6f66e6701384db906"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: nopartialfillexchange.rs \u2194 partialfillexchange.rs: \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 and \u0060hftbacktest/src/backtest/proc/partialfillexchange.rs\u0060 change together 79% of the time (22 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 22 shared commits counted here, the most recent 3 are \u00605f3ec40b\u0060 fix: update the order status to \u0060Status::New\u0060 when the order is modif\u2026; \u0060363bf65d\u0060 fix: fix the issue where a modified order reverts back to the origina\u2026; \u006033acf184\u0060 fix(rs): fix the problem where leaves_qty does not get updated in the\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/nopartialfillexchange.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8112d6e77ee14d5e4e415c42e4e4662a4d05fdfc08f528d2b352371328de521a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: binancefutures.py \u2194 tardis.py: \u0060py-hftbacktest/hftbacktest/data/utils/binancefutures.py\u0060 and \u0060py-hftbacktest/hftbacktest/data/utils/tardis.py\u0060 change together 61% of the time (11 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u006038e15412\u0060 fix(py): fix data utils according to the hftbacktest2 changes.; \u006021ecd471\u0060 perf(py): reduce the memory usage in the data conversion utils. (at that commit the files were still \u0060hftbacktest/data/utils/binancefutures.py\u0060 and \u0060hftbacktest/data/utils/tardis.py\u0060); \u006049b39242\u0060 fix: fix incorrect event flag handling in the data utils. (at that commit the files were still \u0060hftbacktest/data/utils/binancefutures.py\u0060 and \u0060hftbacktest/data/utils/tardis.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"py-hftbacktest/hftbacktest/data/utils/binancefutures.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adc98a43fc2059a9ba4b204b3deb5b6258adcae109b18858ea099ab6c499011"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: l3_local.rs \u2194 l3_nopartialfillexchange.rs: \u0060hftbacktest/src/backtest/proc/l3_local.rs\u0060 and \u0060hftbacktest/src/backtest/proc/l3_nopartialfillexchange.rs\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00600ee237aa\u0060 Update L3 processors to use new Processor trait; \u006005e66e40\u0060 refactor(rust): refactor L3 implementation.; \u00601b33a781\u0060 fix: fix L3 backtesting. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/l3_local.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74001722783903961f669cc2fc0536f0aade45bb50f3be6f1bf72aee88d0dcb"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: local.rs \u2194 nopartialfillexchange.rs: \u0060hftbacktest/src/backtest/proc/local.rs\u0060 and \u0060hftbacktest/src/backtest/proc/nopartialfillexchange.rs\u0060 change together 52% of the time (14 of the 27 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u0060dc9611b0\u0060 Processor::time_of -\u003E time_seen; \u0060a180ae5c\u0060 Consolidate event reading/processing code; \u006090bb7b68\u0060 fix: fix the rejection response. \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hftbacktest/src/backtest/proc/local.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4908c6467e5bcb79748836ff4d31cd219be52cc5c38eb7f4e69aceaf51225bbe"}},{"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":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"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":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P10","level":"note","message":{"text":"Large public API surface: 107/122 types (88%) declared in the published library are public. For a library, every public type is a stability contract \u2014 keep implementation types off the surface and expose only the intended API."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ed2ba843444ae377c17142f58f714e281e4bd3f183ab100ee1fbef389875d3e6"}},{"ruleId":"P4","level":"warning","message":{"text":"No deployment automation: No release automation was found in CI \u2014 neither a deploy stage (Helm/Kubernetes/compose manifests, an orchestrated rollout) nor a publish job that ships the built artifact. Releases appear to be run by hand, which is slower, less repeatable and harder to reverse."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7a7f38718309412c2d2c2c0663260a3d160de9a5a60f3915755be16386d3f1e8"}},{"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"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"CWE-1104","shortDescription":{"text":"CWE-1104"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"CWE-1329","shortDescription":{"text":"CWE-1329"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":36,"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."]}]}