{"$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":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"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":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"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":"crossbeam_channel::select::run_select (cyclomatic 35): crossbeam_channel::select::run_select has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crossbeam-channel/src/select.rs holds 2 of the 7 functions over the threshold \u2014 including the worst \u2014 and 34 of the 48 points over it (71%), 3.1\u00D7 the next-largest file (crossbeam-deque/src/deque.rs at 11). 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":"crossbeam-channel/src/select.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b8a5b15cafcf37b87734668e10e399a281f7c66d5a1d4b659bc787d79b28af"}},{"ruleId":"D1","level":"warning","message":{"text":"crossbeam_channel::select::run_ready (cyclomatic 29): crossbeam_channel::select::run_ready has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crossbeam-channel/src/select.rs holds 2 of the 7 functions over the threshold \u2014 including the worst \u2014 and 34 of the 48 points over it (71%), 3.1\u00D7 the next-largest file (crossbeam-deque/src/deque.rs at 11). 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":"crossbeam-channel/src/select.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81795c07783bfc48ba6c928c165f402c29106c1c8878aab07eba1d8a6c3f504"}},{"ruleId":"D1","level":"warning","message":{"text":"Stealer::steal_batch_with_limit (cyclomatic 20): Stealer::steal_batch_with_limit 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"1567c5d9a9c7ae836e2b09dfde278282a960516470ad9a648b3dc24a47b618bc"}},{"ruleId":"D1","level":"warning","message":{"text":"Stealer::steal_batch_with_limit_and_pop (cyclomatic 19): Stealer::steal_batch_with_limit_and_pop has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"72595bf5ffb8ab7411a04ba86d8022ea2c6a8a469eae86cefef7e6b9ee1fc776"}},{"ruleId":"D1","level":"warning","message":{"text":"SkipList::insert_internal (cyclomatic 18): SkipList::insert_internal 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":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57d9902af345af8cd51bead0dea4077085050fd57baa4b931a5ae6f22f3672d"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector::steal_batch_with_limit (cyclomatic 16): Injector::steal_batch_with_limit has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (Injector::steal_batch_with_limit_and_pop) 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bb001324d74362c1ca7254d9fa998e242886824eb12fae90f1112d8c115740"}},{"ruleId":"D1","level":"warning","message":{"text":"Injector::steal_batch_with_limit_and_pop (cyclomatic 16): Injector::steal_batch_with_limit_and_pop has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (Injector::steal_batch_with_limit) 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c747214ec17abc725b1edda79d0a6531395ceb3b3e2c38e451f3219013797f"}},{"ruleId":"D2","level":"warning","message":{"text":"crossbeam_channel::select::run_select (cognitive 73): crossbeam_channel::select::run_select has cognitive complexity 73 (threshold 15). Drivers by points: if/else 15 (43 pts), loops 8 (18 pts), match/switch 5 (11 pts), boolean chains 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/select.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffca5edfd6da15ed7e85e6f598e1f3200c4ea714a9c5e620aa897091ee7a954"}},{"ruleId":"D2","level":"warning","message":{"text":"crossbeam_channel::select::run_ready (cognitive 58): crossbeam_channel::select::run_ready has cognitive complexity 58 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 7 (16 pts), match/switch 5 (11 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/select.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb008b3e5fd157833a749ac7a99453b3be23b38a70a8bf79c14bd46bc0a185b"}},{"ruleId":"D2","level":"warning","message":{"text":"SkipList::insert_internal (cognitive 41): SkipList::insert_internal has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 3 (4 pts) (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":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b521b713343ced46b52d9d458cea5af1157ab8858977fb449da78d92dc1c65"}},{"ruleId":"D2","level":"warning","message":{"text":"Stealer::steal_batch_with_limit (cognitive 40): Stealer::steal_batch_with_limit has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 4 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-deque/src/deque.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd87478e6b0ff9db433d41bdee7441f0ea8bae7bf50d6810c6840e36dcb5ba5"}},{"ruleId":"D2","level":"warning","message":{"text":"Stealer::steal_batch_with_limit_and_pop (cognitive 35): Stealer::steal_batch_with_limit_and_pop has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 4 (11 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8354da0f95f9b2aaf8d756d11978190cb667ad60a87ea0482021b13e3401c4a"}},{"ruleId":"D2","level":"warning","message":{"text":"SkipList::search_bound (cognitive 32): SkipList::search_bound has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4a1f63fe5a17a1ea859772cba4241aa9807ed04afe2058a8c32f7c6d96e4be"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector::steal_batch_with_limit (cognitive 29): Injector::steal_batch_with_limit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 4 (7 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Injector::steal_batch_with_limit_and_pop) 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca011816770ce0b8809146b975af3e99bfe0a8a548b64ffa3c665e3389a6c0e"}},{"ruleId":"D2","level":"warning","message":{"text":"Injector::steal_batch_with_limit_and_pop (cognitive 29): Injector::steal_batch_with_limit_and_pop has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 4 (7 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Injector::steal_batch_with_limit) 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6350675655e782f5020066a62c7fc72743088c9955a7899562082c92380572"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::start_recv (cognitive 27): Channel::start_recv has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc676cd77d2bd6c52b212e1f3b685f860c9e727550d72c2948f21de3cd7364ad"}},{"ruleId":"D2","level":"warning","message":{"text":"SegQueue::pop (cognitive 26): SegQueue::pop has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 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":"crossbeam-queue/src/seg_queue.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed94e68022e74616b12db01d514cc47979edeb5a8ff778a2f78fafb6764a1fcb"}},{"ruleId":"D2","level":"warning","message":{"text":"SkipList::search_position (cognitive 26): SkipList::search_position has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (8 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e0726c10d2b2124d9c5217b67f6b621a404d6bd9bdade609d2b3161eb1f99f"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::pop (cognitive 23): Worker::pop has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, match/switch 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"91795c52c91aba17b33cafcd9071c6b3305c43765fc9babe1d99657559a4ecee"}},{"ruleId":"D2","level":"warning","message":{"text":"RefRange::next (cognitive 21): RefRange::next has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (RefRange::next_back) 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":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"24afd0574c41d64992c17be57d2608b6105fafac44a06921448b1d2fe195a189"}},{"ruleId":"D2","level":"warning","message":{"text":"RefRange::next_back (cognitive 21): RefRange::next_back has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (RefRange::next) 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":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":2200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d264ab3e2aa6233825b057c06b6f18505d85211c2cdaa99fa2a5593339bc5d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::start_recv (cognitive 20): Channel::start_recv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 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":"crossbeam-channel/src/flavors/array.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5ee63047d7ca227624863ef61228d801b29ba6c302a3fa274df672bee6b1bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::send (cognitive 20): Channel::send has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Channel::recv) 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":"crossbeam-channel/src/flavors/array.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f50a0b7f7b0d14abbe63e51169981b2f7654b694265e9e7a0fbc5346822070"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::recv (cognitive 20): Channel::recv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Channel::send) 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":"crossbeam-channel/src/flavors/array.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d94cd36eaee3e2adbec7ad8b51d64c4d536c49421814bb0aa0a35328b0a418"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::recv (cognitive 20): Channel::recv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"88363cb566fcac684c3c502faec4148e3267a322280555273865df8394cb56da"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::start_send (cognitive 19): Channel::start_send has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e890ebe0bd02bdfc842295de3c4b5c46d12c401d2f7bca46c7745b6ede126248"}},{"ruleId":"D2","level":"warning","message":{"text":"Inner::park (cognitive 18): Inner::park has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-utils/src/sync/parker.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"42161c346d9c2e7d4dfc390b33036b02926c3a953ff2cfc08eb1ac4068662e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"Channel::start_send (cognitive 17): Channel::start_send has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/flavors/array.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bc58180f80392a7e4f3f8e25721b8a6b93896229e9405ce8591e81be98a54c"}},{"ruleId":"D2","level":"warning","message":{"text":"SegQueue::push (cognitive 17): SegQueue::push has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-queue/src/seg_queue.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5392870050f49403d6f355244d033e27dc6f0d7d943dc919253c41bcc2919a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AtomicCell: TooManyMethods \u2014 110 methods. The bar is 30 methods; this is 80 over it, 3.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-utils/src/atomic/atomic_cell.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bfcd09a936cbe3474a132b7e4ccc24683fc65490a6d8fc66547dfef745399d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/base.rs: FileTooLong \u2014 1226 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 726 over it, 2.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f7dcc0b65fa435c2f2234eac34f06fe44730c26299e2c2d684d584e790dae8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/deque.rs: FileTooLong \u2014 854 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 354 over it, 1.71\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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1508b658b8178b8a073517ac2bca3dc67493286c1253e114b81c1b4ec9dd9e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SkipList: ClassTooLong \u2014 492 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), 29 methods, 8 blocks, lines 468-1477. The bar is 400 significant lines; this is 92 over it, 1.23\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":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f6615a5d78fc7b00bc17927bd3850e9a90a751eeec99b4e86c58a942261300"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 40 shared lines): crossbeam-deque/src/deque.rs:1485-1561 | crossbeam-deque/src/deque.rs:1622-1767 | crossbeam-deque/src/deque.rs:1829-1979 \u2014 These 3 members are variants of one another: a block of 40 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"29efae011d2717b887f651ff574ee2d2e133d5c7df362c0f22e92d99126a843f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (79 shared lines): crossbeam-deque/src/deque.rs:767-946 | crossbeam-deque/src/deque.rs:1010-1199 \u2014 These two members are variants of one another: 79 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"066290e634f4a66b1fde72f1dea69d945965fc34e65f90d18729c3907853f15c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crossbeam-channel/src/flavors/list.rs:232-312 | crossbeam-channel/src/flavors/list.rs:334-416 | crossbeam-deque/src/deque.rs:1409-1467 | crossbeam-queue/src/seg_queue.rs:227-305 | crossbeam-queue/src/seg_queue.rs:377-462 \u2014 These 5 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 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecec50e1dd7d7dac388e962654de3c3cea094d5dda908c441ca7244b25e3cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crossbeam-channel/src/flavors/array.rs:161-230 | crossbeam-channel/src/flavors/array.rs:251-321 | crossbeam-channel/src/flavors/array.rs:549-593 | crossbeam-queue/src/array_queue.rs:334-396 \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":"crossbeam-channel/src/flavors/array.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c27563a14788cdd1ae19322bb541952d3cc5ae65035f406255ea45f50fec6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (60\u201361 lines \u00D7 2): crossbeam-deque/src/deque.rs:1623-1683 | crossbeam-deque/src/deque.rs:1830-1889 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a84be294fd686c9ab5d9ff782080e9d4339c0d024eb13f00b282f82298f8e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201344 lines \u00D7 2): crossbeam-channel/src/flavors/list.rs:251-294 | crossbeam-queue/src/seg_queue.rs:240-282 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-queue/src/seg_queue.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 239 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edfa11d118fc51548fda66a4496840e3fcb35c7830b284e43ab75c99134053c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crossbeam-deque/src/deque.rs:1724-1763 | crossbeam-deque/src/deque.rs:1936-1975 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"504944e755a0de0a3596a1f2654b26067b4adf89bf3d959315bda0d3269e9c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 3): crossbeam-channel/src/flavors/list.rs:532-564 | crossbeam-deque/src/deque.rs:2016-2048 | crossbeam-queue/src/seg_queue.rs:577-609 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-deque/src/deque.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"689d63ce2c37689e7a0819ff8b2b7f67b067a7cdff9c1376eadbbcb0bcf41b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crossbeam-skiplist/src/base.rs:863-893 | crossbeam-skiplist/src/base.rs:952-982 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3687b802dce788021c7405bc166d24666ab5594a9b2ab3b6f909b563d85f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crossbeam-deque/src/deque.rs:917-942 | crossbeam-deque/src/deque.rs:1170-1195 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee3cb60c2785dde0cf60adb10f5d53441c9f614b99a21269689788cd98eda01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crossbeam-deque/src/deque.rs:880-902 | crossbeam-deque/src/deque.rs:1138-1160 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bed7e9ada0529bdf355f05f12a8d94c7e369d4598bbb91871e7275ae40c6e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crossbeam-channel/src/flavors/array.rs:427-448 | crossbeam-channel/src/flavors/list.rs:491-512 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/array.rs\u0060 and \u0060crossbeam-channel/src/flavors/list.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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":"crossbeam-channel/src/flavors/array.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc1e46384367f047266c7bb070916017e8ba8b5fa79c9e73fad957aa5c0ba97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crossbeam-deque/src/deque.rs:778-798 | crossbeam-deque/src/deque.rs:1020-1040 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff3c334ed661839522b701fb0903270cd0bf11831decb3d61ab303f8670732c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crossbeam-channel/src/flavors/array.rs:184-203 | crossbeam-channel/src/flavors/array.rs:267-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/flavors/array.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d46e7d8aff29afb7a94063391a7fa8d84069c98cfdcc1125c98e462d508737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crossbeam-deque/src/deque.rs:1486-1504 | crossbeam-deque/src/deque.rs:1624-1642 | crossbeam-deque/src/deque.rs:1831-1849 \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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be0c9723683f490bf6a4c3c53147955fbbea5b1102473ae684a0c3a0552a729"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crossbeam-channel/src/select.rs:181-199 | crossbeam-channel/src/select.rs:332-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/select.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a000570c55d102d08621ca6e946a67233e55be245ce675df7454736be8c86d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crossbeam-deque/src/deque.rs:1436-1454 | crossbeam-queue/src/seg_queue.rs:274-292 \u2014 before extracting anything, compare \u0060crossbeam-deque/src/deque.rs\u0060 and \u0060crossbeam-queue/src/seg_queue.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 174 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d9b1b664498c19c714ad7e40af9c338821c3378bd3a20b56691a78b5be772a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crossbeam-channel/src/flavors/list.rs:378-395 | crossbeam-queue/src/seg_queue.rs:413-430 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-queue/src/seg_queue.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 239 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ba6c6e4bf8e36bd54b0f34abea5b9a30c8f9da5f39e06703727e295b8f742f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crossbeam-channel/src/flavors/list.rs:335-351 | crossbeam-queue/src/seg_queue.rs:378-394 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-queue/src/seg_queue.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 239 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7249ababb70d7498d5af5113f1d37ff6c50849683defcf3b2bb2efcbcd255d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crossbeam-channel/src/flavors/list.rs:707-722 | crossbeam-queue/src/seg_queue.rs:631-646 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-queue/src/seg_queue.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 239 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"3301aefb62e7ccb8f12cf0b27a7f46479f20b074187955d7fd22be0b3627d05b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crossbeam-channel/src/channel.rs:1592-1606 | crossbeam-utils/src/atomic/atomic_cell.rs:1153-1167 \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":"crossbeam-channel/src/channel.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef484d1e926fb7646e63270482ab511b899011c37381c0ffc3a16bc6a8950928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crossbeam-epoch/src/sync/queue.rs:126-140 | crossbeam-epoch/src/sync/queue.rs:158-172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-epoch/src/sync/queue.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"de27b3206d0ff7e2778c69674893e27f09c5847ae5655b8aae53dabb0baa6455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): crossbeam-channel/src/flavors/list.rs:137-150 | crossbeam-deque/src/deque.rs:1309-1322 | crossbeam-queue/src/seg_queue.rs:122-134 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-deque/src/deque.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"740f5d78658864e0f8904613712700bd7c5a360ef5f66d4ff315053e7ba0f9f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crossbeam-channel/src/flavors/list.rs:688-701 | crossbeam-deque/src/deque.rs:2053-2066 | crossbeam-queue/src/seg_queue.rs:614-627 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-deque/src/deque.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d28fd7cd536c148c1eca412d362d1b28bb037cbd6ffeef28fe2ce9b3ab4fb17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crossbeam-channel/src/flavors/array.rs:451-464 | crossbeam-channel/src/flavors/list.rs:515-528 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/array.rs\u0060 and \u0060crossbeam-channel/src/flavors/list.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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":"crossbeam-channel/src/flavors/array.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aca93acc361f9cfbe2fc36ff45bb6ecf5c3cc630692f9cbc5aa051a365f85b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crossbeam-deque/src/deque.rs:1687-1700 | crossbeam-deque/src/deque.rs:1893-1906 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f401a364b875c08d34ceca382dde4bba7d614cd4c8fa0b448af42e7d240fe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crossbeam-skiplist/src/base.rs:2163-2176 | crossbeam-skiplist/src/base.rs:2179-2192 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"334077a6cbf682b28dea65f4ae14408bde12646e4670b0395fcb47e05f88b4f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crossbeam-skiplist/src/base.rs:2211-2224 | crossbeam-skiplist/src/base.rs:2227-2240 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7673ed2e55e47b7f17cd83a251b5736cc603cf834a21fee4fe1516bb5acefce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crossbeam-channel/src/flavors/list.rs:246-258 | crossbeam-deque/src/deque.rs:1417-1429 | crossbeam-queue/src/seg_queue.rs:235-247 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-deque/src/deque.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffb3d045e10846e9107acc2f0f39e8a6345eec31d1aca0e4b62a42f3dac8917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crossbeam-channel/src/flavors/list.rs:283-295 | crossbeam-deque/src/deque.rs:1433-1445 | crossbeam-queue/src/seg_queue.rs:271-283 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-deque/src/deque.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"50588581d3c73100d5f8fd0ab4906fc7896512858a6ed442a93af38c26d5fc2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crossbeam-deque/src/deque.rs:1508-1519 | crossbeam-deque/src/deque.rs:1647-1659 | crossbeam-deque/src/deque.rs:1854-1865 \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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a16ec8dd7b736cb739cec3850c12fb412503c79a88b90c2c53fe64841d0e42f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crossbeam-channel/src/flavors/list.rs:301-312 | crossbeam-channel/src/flavors/list.rs:405-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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f820b957682ffaa6e74fc273f3908afedd021a45bca4e06aa097ec8d78ed10f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crossbeam-epoch/src/atomic.rs:475-486 | crossbeam-epoch/src/atomic.rs:559-570 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-epoch/src/atomic.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"160bf268523061e467acfb9a15fe7eb520a804fca914e570dfe80ab025d68abd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 2): crossbeam-queue/src/array_queue.rs:152-163 | crossbeam-queue/src/array_queue.rs:255-261 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-queue/src/array_queue.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"51299a4777b1653b11a588a8b19b49fac6e7ae53cad7a116ddba34975b9f4adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crossbeam-utils/src/atomic/atomic_cell.rs:450-461 | crossbeam-utils/src/atomic/atomic_cell.rs:759-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":"crossbeam-utils/src/atomic/atomic_cell.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb26d72c36cf0377a29cf963efb24cd60c952912b9ac472efef4a4c5984238a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crossbeam-utils/src/atomic/atomic_cell.rs:487-498 | crossbeam-utils/src/atomic/atomic_cell.rs:802-813 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-utils/src/atomic/atomic_cell.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8871514756ea43b5a139afcc9cb4be7e56b648a050ed80b697bffda93f1687fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crossbeam-utils/src/atomic/atomic_cell.rs:524-535 | crossbeam-utils/src/atomic/atomic_cell.rs:842-853 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-utils/src/atomic/atomic_cell.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2b670dd9daa8c3ed14aa6a8df05afa5a4150a61da139f80eb559980ad33cba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crossbeam-utils/src/atomic/atomic_cell.rs:561-572 | crossbeam-utils/src/atomic/atomic_cell.rs:882-893 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-utils/src/atomic/atomic_cell.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e20635ab1abe829fd65b20c1e18d4b86a3f5bcff33e26b70850092c331f680"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crossbeam-channel/src/flavors/list.rs:339-349 | crossbeam-deque/src/deque.rs:1415-1425 | crossbeam-queue/src/seg_queue.rs:233-243 | crossbeam-queue/src/seg_queue.rs:382-392 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-deque/src/deque.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"43077da0f4de443deef04a77975c59abc8728aba3cd2743629a4cb9dd2c6d1ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crossbeam-deque/src/deque.rs:1538-1548 | crossbeam-deque/src/deque.rs:1904-1914 | crossbeam-queue/src/seg_queue.rs:432-442 \u2014 before extracting anything, compare \u0060crossbeam-deque/src/deque.rs\u0060 and \u0060crossbeam-queue/src/seg_queue.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 174 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"f060af03aaadc3bb379a467a617a54192048860c565f07bebeccbe560d43871e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crossbeam-deque/src/deque.rs:250-260 | crossbeam-deque/src/deque.rs:278-288 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30b35235dd0d3a0c9a10464a398fdca1550ec56029689a35039e06b14d1f2ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crossbeam-deque/src/deque.rs:1712-1721 | crossbeam-deque/src/deque.rs:1923-1933 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c63e2afb9ed215454283129f38c7cc5226b3baf3440372ddc5bfd8902a8627"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crossbeam-deque/src/deque.rs:1536-1544 | crossbeam-deque/src/deque.rs:1696-1704 | crossbeam-deque/src/deque.rs:1902-1910 | crossbeam-queue/src/seg_queue.rs:430-438 \u2014 before extracting anything, compare \u0060crossbeam-deque/src/deque.rs\u0060 and \u0060crossbeam-queue/src/seg_queue.rs\u0060 as WHOLE FILES: this scan already matched 13 separate duplicated blocks between them, totalling at least 174 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"60351cfa76eae64003d0f986d51e0a737bafc7cb08a8a31faee37f87d12be489"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crossbeam-channel/src/flavors/array.rs:258-266 | crossbeam-channel/src/flavors/array.rs:562-570 | crossbeam-queue/src/array_queue.rs:341-349 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/flavors/array.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6b559096b53d476fe817e13201a1c110e1aeb0a5e7b58de57c6f7ab3f9b057"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crossbeam-channel/src/flavors/list.rs:207-215 | crossbeam-queue/src/seg_queue.rs:202-210 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-queue/src/seg_queue.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 239 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e109e7373148a8e1ad114f0d788a7141f85516cec8ac786c9988f7ef516b848d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crossbeam-deque/src/deque.rs:802-810 | crossbeam-deque/src/deque.rs:1044-1052 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b632e81a2fddc3862559cc2c1fbc31ddb83658d160ed0287011c6cf228cc86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crossbeam-skiplist/src/base.rs:1968-1975 | crossbeam-skiplist/src/base.rs:2249-2256 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f82706325bd4048c6f4cd2d9e540b55bb76d71375c0821b028a580f835b577"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crossbeam-channel/src/counter.rs:71-77 | crossbeam-channel/src/counter.rs:130-136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/counter.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"998f41944141b981a83c58dc23326d3c428784bc293f9520ac5c3ec9f16df015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crossbeam-channel/src/flavors/array.rs:175-180 | crossbeam-channel/src/flavors/array.rs:258-263 | crossbeam-channel/src/flavors/array.rs:562-567 | crossbeam-queue/src/array_queue.rs:341-346 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/flavors/array.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75408e012f2a39014266dad8c18942122efe904cb027a05541e0e08c19e7e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crossbeam-utils/src/sync/sharded_lock.rs:363-368 | crossbeam-utils/src/sync/sharded_lock.rs:533-538 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-utils/src/sync/sharded_lock.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ee0d542ded7de6f44940d0dfdd4591ecb5de740b8979843b8a44810806fd1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crossbeam-skiplist/src/base.rs:1823-1827 | crossbeam-skiplist/src/base.rs:1850-1854 \u2014 both copies are in the same file, so extract the block 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":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90d69225c7a95169ad34733e0329bf2657dd50bbbc84ee10ea0e968fa9171be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crossbeam-channel/src/flavors/array.rs:405-413 | crossbeam-channel/src/flavors/list.rs:468-476 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/array.rs\u0060 and \u0060crossbeam-channel/src/flavors/list.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 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":"crossbeam-channel/src/flavors/array.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6951c0464252dc0611b28bdc6d1bcb5c1114414a6d88a7e1f104167692e665f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crossbeam-channel/src/flavors/list.rs:73-78 | crossbeam-deque/src/deque.rs:1245-1250 | crossbeam-queue/src/seg_queue.rs:58-63 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-deque/src/deque.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"432aa4c01f17770d8b01ccf42a2b6e609e8aa983d110ecc136ee15c71adb34de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crossbeam-channel/src/flavors/list.rs:103-118 | crossbeam-deque/src/deque.rs:1275-1290 | crossbeam-queue/src/seg_queue.rs:88-103 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-deque/src/deque.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2927488e6a5fde4e80dc892df5d8218d514dfe8c3b11343dea9e463d48aeba06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crossbeam-channel/src/flavors/list.rs:121-130 | crossbeam-deque/src/deque.rs:1293-1302 | crossbeam-queue/src/seg_queue.rs:106-115 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-deque/src/deque.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb9a7e991343e6cde77c4eb783993149e83279248e8e70e9505b17dbefa26f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crossbeam-channel/src/flavors/list.rs:674-678 | crossbeam-deque/src/deque.rs:1994-1998 | crossbeam-queue/src/seg_queue.rs:554-558 \u2014 before extracting anything, compare \u0060crossbeam-channel/src/flavors/list.rs\u0060 and \u0060crossbeam-deque/src/deque.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 135 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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"37954effe40a833ff7ce7c5ca967251ef39b3179ff534ec083a64b4cb2d6e96d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crossbeam-skiplist/src/base.rs:1562-1567 | crossbeam-skiplist/src/map.rs:689-694 \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":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"43be57c5b595a894d34a7e4ce655bf3a206f7dd4784e4529fdf07c617a823a99"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: crossbeam-utils: crossbeam-utils: abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e7db55f5ea474068358d6e8189466f84a5818df62332971388cacc07588a494"}},{"ruleId":"D9","level":"note","message":{"text":"Inverted test pyramid: Only 7 % of tests are unit tests (47 unit vs 606 integration, 0 BDD); a broader unit base gives faster, more localised feedback."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3fc0c6fc621cd18b83a2d2c03ea6976b61fb4769f62dc21043f0af4cad912d10"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 20 significant file(s) lose their only recent owner: crossbeam-utils/src/atomic/atomic_cell.rs, crossbeam-epoch/src/internal.rs, crossbeam-utils/src/sync/sharded_lock.rs, crossbeam-utils/src/thread.rs, crossbeam-epoch/src/sync/list.rs, crossbeam-channel/src/flavors/zero.rs, crossbeam-epoch/src/sync/queue.rs, crossbeam-utils/src/sync/parker.rs (\u002B12 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"26ef66dc265726d9c2cf26d3e841b0cf0589d2928d97d19ae4173ec1b08db1a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO support more subplots \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":"crossbeam-channel/benchmarks/plot.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9121119b6f73adfad12f979c04da54ddc546a010e4845730115064be1966a320"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //                     // TODO(stjepang): Implement this optimization. \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":"crossbeam-channel/src/select_macro.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a853cabcbcd043bdd66e74c26fbd8ef6373abf789f9cfcb2be161786a52630"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //                     // TODO(stjepang): Implement this optimization. \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":"crossbeam-channel/src/select_macro.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"3971ec852feaab718cbc954063b069203daec304651ceb41807bc54cee8f59bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //                     // TODO(stjepang): Implement this optimization. \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":"crossbeam-channel/src/select_macro.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"434bf20cdf1656e58d2ff4dbcda77820b5b57d134fc1125fadc1456a69d53249"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //             // TODO(stjepang): Implement this optimization. \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":"crossbeam-channel/src/select_macro.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"915a4fed9a38074ccbfef8c17df7166bbde36c7a26221e00ff826f89faf63d80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //             // TODO(stjepang): Implement this optimization. \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":"crossbeam-channel/src/select_macro.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"24393a2f573290b90809bb7290e56f127aba0c9d84ebbefcecc0d0d3b77a6fbb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //             // TODO(stjepang): Implement this optimization. \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":"crossbeam-channel/src/select_macro.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"be37d066039e08224a424b96934f4cc5ef5eff15019ce72a1352c7bb7c2c4b54"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Unsafe but stable version of \u0060Vec::recycle\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/select.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42a87f175c0531e1969ed2e138aa08dc129a73de8a1833488c29f5859da24c6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This is equivalent to transmute_copy by value, but available in const \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/src/channel.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2c24c704661f67574f32de59691ebd5966661e5cf8a45a5ce022681e55d976"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This is equivalent to transmute_copy by value, but available in const \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-utils/src/atomic/atomic_cell.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"720d5b82c37cd585f808f9a776466579a8d78ee223999a1f7a23f1af2126f16b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: On platforms where AtomicU64 is unavailable, we may want to use AtomicCell instead of \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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4279221a7b7b4c798ccf47ea1334a10eeab1cee21cee71c8e8781122a391c0b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: On platforms where AtomicU64 is unavailable, we may want to use AtomicCell instead of \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":"crossbeam-channel/src/flavors/array.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb2e36dcea6fd3e999cdfade6d388222cf60aaf25f5f9e7e3c0e6673455d56a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: On platforms where AtomicU64 is unavailable, we may want to use AtomicCell instead of \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":"crossbeam-epoch/src/epoch.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d873b2c5dd4c941c49422b1068966d0e2532e546b5b91dd0967aa2f652e13646"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: On platforms where AtomicU64 is unavailable, we may want to use AtomicCell instead of \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":"crossbeam-queue/src/seg_queue.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e61bbfa20b6fa31874b5cb4b692dcd20f508e05add0ff5b5768ff3647c0592"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: On platforms where AtomicU64 is unavailable, we may want to use AtomicCell instead of \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":"crossbeam-queue/src/array_queue.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef69eebf191316244b9f4ca2864735d1891aafc6f5ec75c6633d937eda1f423"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stjepang): Once we bump the minimum required Rust version to 1.28 or newer, re-apply the \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":"crossbeam-channel/src/flavors/list.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3a666e30f2e17b20629b06db9a9adac4497e2eb69f97f744e5cee4d7e881f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: many assertions failed due to Miri is slow \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":"crossbeam-channel/tests/tick.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcea195a9e5a3424e3d7a78ccea39ee93623f0fa057b1b167b4d0d384d0a08ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: many assertions failed due to Miri is slow \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":"crossbeam-channel/tests/after.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"954578d8f5563f2a5069b72707181db5214b97c541bd2bb40ca7b3db2b84b2b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: assertions failed due to tsan is slow \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":"crossbeam-channel/tests/tick.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ef9df3f9dc00c1401b925fb7b198d9a593bb6273b39282375b983ab2eaa503"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: assertions failed due to tsan is slow \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":"crossbeam-channel/tests/tick.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cdf22412da33c55ac6e0a2acc0c3fc86e76e3a5e9a48d8acde2257577deeaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: flaky: https://github.com/crossbeam-rs/crossbeam/issues/1094"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-channel/tests/select_macro.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02f120b63cf6dfbfa4821b51ace0bd8bb11289eddd8c345e72ac4a124f0fdad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should panic instead of hang \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":"crossbeam-channel/tests/select.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c997c273fad54bede6c70519b3882390e172b5e222cb21ce0720bfd75c14a43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should panic instead of hang \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":"crossbeam-channel/tests/select.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af7a6be9ae4b169c4d59d50098f94928f3ae0bfebc993a9e5c855e539583cca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should error instead hang \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":"crossbeam-channel/tests/select.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1746dceec16ddea6f260ba5c500fd50163e734c3efe43174d7780dbcecca5cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should not hang \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":"crossbeam-channel/tests/select.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"5062fb7336970ad3a3a22306f8f589f649d8520269518c2072dfad25e53e05e2"}},{"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":"crossbeam-channel/tests/golang.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"092fa98a928df2a20e0cd21f4282decc7f93e14078718f9267b26e91deb99d89"}},{"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":"crossbeam-channel/tests/golang.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"12224d730e63ef3cfd68ef154d9ec518d9b0d458fdb7b56bf9c69f0fde14e4ac"}},{"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":"crossbeam-channel/tests/golang.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6ac40c3339d91de852b66f155b6c17035b3b1083d4213f6ce3b57e403e40c5"}},{"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":"crossbeam-channel/tests/golang.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d92b17beac538690b1e004e7570cc291df36d5ed98058d638a367155b739c46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: On platforms where AtomicU64/AtomicI64 is unavailable, we may want to use AtomicCell instead of \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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ba4a181c33caa90d6730aabc1a754bedd368aede87ac28338b6286186e1265"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we use \u0060MAX_BATCH \u002B 1\u0060 as the hard limit for Injecter as the performance is slightly \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":"crossbeam-deque/src/deque.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12b947da5c31f0d8eb740183fd647023ee43ec300a10cac44f586864489d821"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: loom does not support compiler_fence at the moment. \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":"crossbeam-epoch/src/lib.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b560d4620e84ef076398010073cff98baa1d7535030854417a35b812d384a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: loom does not support compiler_fence at the moment. \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":"crossbeam-utils/src/lib.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee857cb213f0b0d75259f74f5d323b42c4386e98169679c246f0edd87a68943"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stjepang): \u0060Local\u0060s are stored in a linked list because linked lists are fairly \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":"crossbeam-epoch/src/internal.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d500d191e3f0f8829757c522b9a8024b7acad1187782fa1cc54d44a4c5fc7cb2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: https://github.com/crossbeam-rs/crossbeam/issues/869"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-epoch/src/internal.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa794fd9333e8b22fd5c6c791be160d9df84ecdf7e527837c9bf6610482513f"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(stjepang): On x86 architectures there are two different ways of executing \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-epoch/src/internal.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"030be459033a7984abfe63f8341123e8a618f6cbebbbcfacd42f19f27939913e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: loom does not currently provide the equivalent of Lazy: \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":"crossbeam-epoch/src/default.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e4168495b7862f75cfcff910587a221b165a0d17cd9566e6d6386f50331698b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: assertions failed due to \u0060cfg(crossbeam_sanitize)\u0060 reduce \u0060internal::MAX_OBJECTS\u0060: https://github.com/crossbeam-rs/crossbeam/issues/662"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-epoch/src/collector.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4a3d8558f1f5e53238933458c1e2012e9c80802db348650641a5715a607815"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is exactly \u003Chttps://doc.rust-lang.org/nightly/std/primitive.pointer.html#method.map_addr-1\u003E,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-epoch/src/atomic.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48308f8a61fa3df7dc1a55387c4f6a54c72fbe12bd6cbd8f0f0831d0cfb1fef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Amanieu): can we use release ordering here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd3bf6166b06ea3a022d1fcdfef9d6cbb48abe90c354eb0500c75a3932984eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Amanieu): can we use release ordering here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"73876654e9e36034d8d239648f90489321289fcd75d7ac7cddba47174d60c1f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Amanieu): can we use release ordering here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08b1c1179d77f5b0e99cb6e071f90f4bc7482ab0b4d64cb5359f592baca974a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Amanieu): can we use release ordering here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ae63f1f7323c8bb40a3fae3f7cc1910cf31f2c6aa21490eeff23397f71f7bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Amanieu): can we use release ordering here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"108cd916714fe578b94490738ad9a2098590fc24cacf8f50d77c673756963d7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(stjepang): Embed a custom \u0060epoch::Collector\u0060 inside \u0060SkipList\u003CK, V\u003E\u0060. Instead of adding \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":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef5c10668051666bfe0ba6abfea8ac8d9422badc96134aeb30d8c43dd484af5"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack but it allows us to return references that are not bound to \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffed1d90df7d055a7f92d2bda937f2cca3e72b16f7c91eefdc352d8d61b2e4ec"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // hack but it allows us to return references that are not bound to \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1836c67fb34376798ef4a4a05ee28add53a27d4ed40af3e0a8b6611dfbc398cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Amanieu): can we use relaxed ordering here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f8f90e33c759bc0be6a685c70dc49bf69316b9f7a3e5d242d098f2e1bec9fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Amanieu): can we use relaxed ordering here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2822a6da7a37b0b82d9240a1ca20f2a6f66da354318d44dd6307b4f51845d75"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Amanieu): can we use relaxed ordering here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-skiplist/src/base.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a31f03ed34d12b5427c5978d107d43ebd178b61bb4693200dcaa3d6dab69c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The latest loom supports fences, so fallback using seqlock may be available. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crossbeam-utils/src/atomic/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f87262eed5d7d2da4593b56b67408208623857b98e36c9ab3ab98d497789f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use target_has_atomic_load_store once stabilized. \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":"crossbeam-utils/src/atomic/consume.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c18849e9c76d8d41b804852e711f8064278ccab59e889a1470347db5af8696"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: core::sync::atomic::AtomicU128 is unstable \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":"crossbeam-utils/src/atomic/atomic_cell.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"427f46bb51aeeef3bf9b5e6f021b1baf2a12d2be3833ec8ee8dceddbdb319351"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent naming for blocking vs non-blocking operations. \u0060try_send\u0060 is non-blocking, while \u0060send\u0060 is blocking. However, the timeout variants are named \u0060send_timeout\u0060 and \u0060send_deadline\u0060 rather than \u0060send_with_timeout\u0060 or similar, creating a slight lexical inconsistency between the base blocking call (\u0060send\u0060) and its timed variants. More critically, \u0060Receiver\u0060 uses \u0060recv\u0060 (blocking) and \u0060try_recv\u0060 (non-blocking), which is consistent with \u0060Sender\u0060, but the timeout methods on \u0060Receiver\u0060 are \u0060recv_timeout\u0060/\u0060recv_deadline\u0060. While consistent within the channel module, the mix of \u0060send\u0060/\u0060recv\u0060 (blocking) and \u0060try_send\u0060/\u0060try_recv\u0060 (non-blocking) is standard, but the lack of a unified \u0060send_with_timeout\u0060 pattern makes the API surface feel slightly fragmented between \u0027try\u0027 and \u0027timeout\u0027 naming conventions.: Consider unifying the timeout/dedline naming convention. Either use \u0060send_timeout\u0060/\u0060recv_timeout\u0060 for all timed operations (current state) or introduce \u0060send_with_timeout\u0060/\u0060recv_with_timeout\u0060 to clearly distinguish them from the base \u0060send\u0060/\u0060recv\u0060. The current mix is acceptable but \u0060try_\u0060 vs \u0060_timeout\u0060 is a minor cognitive load. (signatures: Sender.try_send(msg: T): Result | Sender.send(msg: T): Result | Sender.send_timeout(msg: T, timeout: Duration): Result | Sender.send_deadline(msg: T, deadline: Instant): Result)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7ea106808d89ec872a5d1325d18d8106c91e34c7d5b23dcfd7e20e686ce71468"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent verb usage for state management operations. \u0060register\u0060/\u0060unregister\u0060 and \u0060watch\u0060/\u0060unwatch\u0060 are used for managing operations, but \u0060try_select\u0060 and \u0060accept\u0060 are used for execution/consumption. The distinction between \u0060register\u0060 and \u0060watch\u0060 is not immediately obvious from the names alone without deep documentation, as both seem to associate an operation with the handle. Similarly, \u0060accept\u0060 consumes a token, but \u0060unregister\u0060 removes an operation. The verbs \u0060register\u0060, \u0060watch\u0060, \u0060accept\u0060, \u0060unregister\u0060, \u0060unwatch\u0060 create a slightly confusing set of actions for what is essentially a lifecycle of an async operation.: Clarify the distinction between \u0060register\u0060 and \u0060watch\u0060. If they serve different purposes (e.g., one for polling, one for async notification), the names should reflect that (e.g., \u0060poll_register\u0060 vs \u0060async_watch\u0060). If they are synonyms, unify them. (signatures: SelectHandle.try_select(token: Token): bool | SelectHandle.register(oper: Operation, cx: Context): bool | SelectHandle.unregister(oper: Operation) | SelectHandle.accept(token: Token, cx: Context): bool | SelectHandle.watch(oper: Operation, cx: Context): bool | SelectHandle.unwatch(oper: Operation))"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f7e49b695d63cf4e389bde4b12e941387132607cd987046782d45d527d3347c"}},{"ruleId":"D22","level":"warning","message":{"text":"Inconsistent return types for equivalent operations in SkipList vs SkipMap. \u0060SkipList.get_or_insert\u0060 returns \u0060RefEntry\u0060 (which requires a guard to release), while \u0060SkipMap.get_or_insert\u0060 returns \u0060Entry\u0060 (which does not require a guard for release, as implied by the lack of guard parameter in \u0060Entry.remove()\u0060 in SkipMap). This inconsistency forces users to handle lifetimes and guards differently for seemingly identical logical operations depending on whether they use the base \u0060SkipList\u0060 or the typed \u0060SkipMap\u0060.: Unify the return types. Either both should return \u0060RefEntry\u0060 (requiring guard management) or both should return \u0060Entry\u0060 (if the map handles guard management internally). The current split creates a confusing API surface where the same logical operation has different ownership/release semantics. (signatures: SkipList.get_or_insert(key: K, value: V, guard: Guard): RefEntry | SkipList.get_or_insert_with(key: K, value: F, guard: Guard): RefEntry | SkipMap.get_or_insert(key: K, value: V): Entry | SkipMap.get_or_insert_with(key: K, value_fn: F): Entry)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0bb5a7734628e42fc3fb648b89b80e1e4c56b05fddf960b884cbf6eef89e8f68"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 14 of 57 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; 57 of the 73 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: crossbeam-utils/src/backoff.rs, crossbeam-utils/src/atomic/seq_lock_wide.rs, crossbeam-channel/benchmarks/crossbeam-channel.rs, crossbeam-channel/src/context.rs, crossbeam-channel/benchmarks/go.go, crossbeam-channel/benchmarks/flume.rs, crossbeam-channel/benchmarks/plot.py, crossbeam-channel/benchmarks/mpsc.rs (and 6 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":"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":"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P1","level":"note","message":{"text":"CI build step not evidenced: A CI pipeline exists but no build step was matched \u2014 changes may merge without the build ever running. A build step may be invoked directly as a command, or declared as a task that a runner named in the pipeline resolves."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"251015acef1a259fcc13b7c60660cc8917ccb3ae8056cb5165ae03312dd586e8"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-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-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-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-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-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":3,"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."]}]}