{"$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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"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"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"SVD::try_new_unordered (cyclomatic 32): SVD::try_new_unordered has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/svd.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8e2334b175df989bb5a0190f5e91f603fdead4c547d7871cea1886973174fd"}},{"ruleId":"D1","level":"warning","message":{"text":"LBLT::new (cyclomatic 24): LBLT::new has cyclomatic complexity 24 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/lblt.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34c472ad86484ac9ead611d1abfb29e9a35246f912279a10c9ddccc55f659d6"}},{"ruleId":"D1","level":"warning","message":{"text":"Schur::do_decompose (cyclomatic 24): Schur::do_decompose has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/schur.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"603c6a2888faec4ddc690194474fd86a2746b32bb08f1e2d485f86a79bda860e"}},{"ruleId":"D1","level":"warning","message":{"text":"nalgebra_sparse::cs::validate_and_optionally_sort_cs_data (cyclomatic 21): nalgebra_sparse::cs::validate_and_optionally_sort_cs_data has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/cs.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaef06b671b78d16467ed87436edfa2c0c7caa29049c0fcb318f29545b953f4a"}},{"ruleId":"D1","level":"warning","message":{"text":"nalgebra_sparse::io::matrix_market::load_coo_from_matrix_market_str (cyclomatic 20): nalgebra_sparse::io::matrix_market::load_coo_from_matrix_market_str 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":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"315a5b421e0bd788f719a0a6b057f159436d960761517d70de81c801e0a1aec8"}},{"ruleId":"D1","level":"warning","message":{"text":"LBLT::solve_mut (cyclomatic 18): LBLT::solve_mut has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/lblt.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4f1d2929dc2015bd289621f453a2e02eb1ba0f945a0841e79cdc9e2c4c2d57"}},{"ruleId":"D1","level":"warning","message":{"text":"SymmetricEigen::do_decompose (cyclomatic 17): SymmetricEigen::do_decompose has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/symmetric_eigen.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f06a13c85eb7bf456980f840b23c6e926c090789407d12f003b84a6f364aa18"}},{"ruleId":"D1","level":"warning","message":{"text":"Matrix::dotx (cyclomatic 16): Matrix::dotx has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/blas.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef3524ebf643474bbf36ea775b1384436c29dc6b1f610686601292edbe1475c"}},{"ruleId":"D2","level":"warning","message":{"text":"SVD::try_new_unordered (cognitive 87): SVD::try_new_unordered has cognitive complexity 87 (threshold 15). Drivers by points: if/else 28 (72 pts), boolean chains 6, loops 3 (5 pts), match/switch 1 (4 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/svd.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3eab52057f183f857a1d624d5f6b285c64072ffea5d8623d4174567e57a408"}},{"ruleId":"D2","level":"warning","message":{"text":"LBLT::new (cognitive 75): LBLT::new has cognitive complexity 75 (threshold 15). Drivers by points: loops 11 (38 pts), if/else 16 (37 pts) (nesting depth added 48). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/lblt.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea610289a885760acd314fd72ead789641deee60bc60d85875bd32f3dc83c74"}},{"ruleId":"D2","level":"warning","message":{"text":"Schur::do_decompose (cognitive 63): Schur::do_decompose has cognitive complexity 63 (threshold 15). Drivers by points: if/else 25 (57 pts), loops 2 (4 pts), boolean chains 2 (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":"src/linalg/schur.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd062f06f14de2a36fcb7bdf48f9f096a60627d8d5197e758f2398f1213cada"}},{"ruleId":"D2","level":"warning","message":{"text":"nalgebra_sparse::cs::validate_and_optionally_sort_cs_data (cognitive 46): nalgebra_sparse::cs::validate_and_optionally_sort_cs_data has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/cs.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3345eda35d0cded5bfb143e2c12fa24db286fa53ee17972960c7d58b1b5efa"}},{"ruleId":"D2","level":"warning","message":{"text":"SymmetricEigen::do_decompose (cognitive 46): SymmetricEigen::do_decompose has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/symmetric_eigen.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c38b3238d7f4a1d952c4ceb21e115afb963d4d9d9024d6cca52757e1564f03"}},{"ruleId":"D2","level":"warning","message":{"text":"LBLT::solve_mut (cognitive 45): LBLT::solve_mut has cognitive complexity 45 (threshold 15). Drivers by points: loops 13 (35 pts), if/else 7 (10 pts) (nesting depth added 25). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/lblt.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c9d7db6c96ebc3b52d0502cde3d78244a041fa40849252510f8d1187ceb2ba"}},{"ruleId":"D2","level":"warning","message":{"text":"nalgebra_sparse::ops::serial::cs::spmm_cs_dense (cognitive 34): nalgebra_sparse::ops::serial::cs::spmm_cs_dense has cognitive complexity 34 (threshold 15). Drivers by points: loops 7 (24 pts), match/switch 3 (10 pts) (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/serial/cs.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9119837f49459cbfe23f163fd419e1c0eaab0d3aa63e4cf42603aa641d237525"}},{"ruleId":"D2","level":"warning","message":{"text":"Eigen::get_complex_elements (cognitive 31): Eigen::get_complex_elements has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (12 pts), match/switch 3 (5 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/eigen.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c74be3f4f4dceab49739699a06ea9007c6ed0994966654b3f9e803d8c3f902e"}},{"ruleId":"D2","level":"warning","message":{"text":"nalgebra_sparse::ops::serial::cs::spadd_cs_prealloc (cognitive 27): nalgebra_sparse::ops::serial::cs::spadd_cs_prealloc has cognitive complexity 27 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/serial/cs.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a760ffc9b6ba477af45ef0c8c847508953a9d3a961ade699a1dc1d82a9381bb0"}},{"ruleId":"D2","level":"warning","message":{"text":"nalgebra_macros::stack_impl::stack_impl (cognitive 26): nalgebra_macros::stack_impl::stack_impl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 6 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-macros/src/stack_impl.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ebef2ed3c938a836eefa42be9d4542c38ad3a4decad135116c691e51278822"}},{"ruleId":"D2","level":"warning","message":{"text":"CscCholesky::decompose_left_looking (cognitive 26): CscCholesky::decompose_left_looking has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 5 (12 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/factorization/cholesky.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5dc893e29e56c216bb654da8d189c3bb758e836414ed43ad43a1f5509ab8d9"}},{"ruleId":"D2","level":"warning","message":{"text":"CsCholesky::decompose_left_looking (cognitive 26): CsCholesky::decompose_left_looking has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 5 (12 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sparse/cs_matrix_cholesky.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e795231d7efc07e941e519bcc349d089a99820ffd5ccde8d729227636395395"}},{"ruleId":"D2","level":"warning","message":{"text":"Matrix::partial_cmp (cognitive 24): Matrix::partial_cmp has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"20346e97f455e110656ba80555067a6412ed65c3261fae0c96a93dcb8d47f4d5"}},{"ruleId":"D2","level":"warning","message":{"text":"CsMatrix::tr_solve_lower_triangular_mut (cognitive 23): CsMatrix::tr_solve_lower_triangular_mut has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (10 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sparse/cs_matrix_solve.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2594cc3503ded59f59246a351965a4e38051870aec4cd2d2aa40e6f8acd00a9"}},{"ruleId":"D2","level":"warning","message":{"text":"nalgebra_sparse::io::matrix_market::load_coo_from_matrix_market_str (cognitive 21): nalgebra_sparse::io::matrix_market::load_coo_from_matrix_market_str has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b71aac9aa951f69cf060689ae5c82d9ef3e1870d5e0f1460c3eafc1188ce48e"}},{"ruleId":"D2","level":"warning","message":{"text":"CsMatrix::solve_lower_triangular_mut (cognitive 21): CsMatrix::solve_lower_triangular_mut has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 4 (9 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sparse/cs_matrix_solve.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b675f7e1bf634fee6d1b0e5ed3a59322e89f98ea166442b0129f36d939aabfa4"}},{"ruleId":"D2","level":"warning","message":{"text":"SparsityPattern::try_from_offsets_and_indices (cognitive 18): SparsityPattern::try_from_offsets_and_indices has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/pattern.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab683b8f2279fdaf3bb4a1f04695b4b941507f2f534639ae5780209fa502d54"}},{"ruleId":"D2","level":"warning","message":{"text":"LBLT::l_permuted (cognitive 18): LBLT::l_permuted has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 2 (3 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/lblt.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9be65d6d7fc562d7fc0e9b1a8eb0f1229ab0c26af697cd4c503aa1eff5767ff"}},{"ruleId":"D2","level":"warning","message":{"text":"SVD::delimit_subproblem (cognitive 18): SVD::delimit_subproblem has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/svd.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed47fb96b584ec430389bc18866b0086d2c5ca45b597d5d59d65ad453b1938d"}},{"ruleId":"D2","level":"warning","message":{"text":"nalgebra::base::blas_uninit::gemm_uninit (cognitive 18): nalgebra::base::blas_uninit::gemm_uninit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/blas_uninit.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f180f0fde87590c9d1b2499d4dca1aa23c13e051a40178f02df1a0eb00f70012"}},{"ruleId":"D2","level":"warning","message":{"text":"nalgebra_sparse::ops::serial::csc::spsolve_csc_lower_triangular_no_transpose (cognitive 17): nalgebra_sparse::ops::serial::csc::spsolve_csc_lower_triangular_no_transpose has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (nalgebra_sparse::ops::serial::csc::spsolve_csc_lower_triangular_transpose) 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":"nalgebra-sparse/src/ops/serial/csc.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bc59dcbfaf06fcd2d0bc532d55b4fc31cc39831b45469ea3f4dd9ae1805ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"nalgebra_sparse::ops::serial::csc::spsolve_csc_lower_triangular_transpose (cognitive 17): nalgebra_sparse::ops::serial::csc::spsolve_csc_lower_triangular_transpose has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (nalgebra_sparse::ops::serial::csc::spsolve_csc_lower_triangular_no_transpose) 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":"nalgebra-sparse/src/ops/serial/csc.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d6b40d079d2255991722252d75fbc4f8be624e10f1114c5eba3209d7f22625"}},{"ruleId":"D2","level":"warning","message":{"text":"Matrix::dotx (cognitive 17): Matrix::dotx has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, loops 3 (5 pts), if/else 3 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/blas.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"115ccec57daa6519bf8814ff3426d6db4b11446a359ea95fda097e826d3c71fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Eigen::new (cognitive 17): Eigen::new has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 2 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/eigen.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8609f18ec56dde9d663eb07f26eabdb4cba73e61215b6999260e1d673be25f7"}},{"ruleId":"D2","level":"warning","message":{"text":"SVD::solve (cognitive 17): SVD::solve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (7 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/svd.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c0a9c7443b9054bddc61b34074636d901cc78e4ba7db2a80ba82bb241f2722"}},{"ruleId":"D2","level":"warning","message":{"text":"CsMatrix::solve_lower_triangular_cs (cognitive 17): CsMatrix::solve_lower_triangular_cs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 6 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sparse/cs_matrix_solve.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd77980e60333dbe0ce240496c8a3be856e4a7e15ea9512093cc352aa0e06403"}},{"ruleId":"D2","level":"warning","message":{"text":"Vector::convolve_full (cognitive 16): Vector::convolve_full has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/convolution.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5c56331e481ee83b6d2d253e0c098a3b67c45a34799055b31a0730d31e5c11"}},{"ruleId":"D2","level":"warning","message":{"text":"CsCholesky::decompose_up_looking (cognitive 16): CsCholesky::decompose_up_looking has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sparse/cs_matrix_cholesky.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf4afad7a7c60c54b4e18eba409e2ef95f83485f79856e3a976aa54d5947835"}},{"ruleId":"D2","level":"warning","message":{"text":"nalgebra::linalg::balancing::balance_parlett_reinsch (cognitive 16): nalgebra::linalg::balancing::balance_parlett_reinsch has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/balancing.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f655e377d334a5d8f7a089a1e3d0be9abd87a7912b13c4c17c8a840355d3814"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Matrix: TooManyMethods \u2014 242 methods, declared across 15 files: base/matrix.rs (66), base/edition.rs (44), linalg/decomposition.rs (20), base/norm.rs (19), \u002B11 more file(s). The bar is 30 methods; this is 212 over it, 8.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. Most of these members implement matrix.Matrix (242 of 242 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b29bbe0977bcfad221401f8085cd311792c7768902ee748b5fcee7f3252ff22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: base/matrix.rs: FileTooLong \u2014 1240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: Matrix (32 blocks, 178-2356). The bar is 500 significant lines; this is 740 over it, 2.48\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9b2c8289dbf42c0070512b8d06159cb05a88585d8613b70c88104deb0e1de5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: nalgebra_glm::gtc::packing: TooManyFunctions \u2014 70 free functions. The bar is 30 free functions; this is 40 over it, 2.33\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":"nalgebra-glm/src/gtc/packing.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ed0afb1553ae072b540ddfb35bbdf42485f82e9e8fcae53de77c12cc7dd615"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Matrix: ClassTooLong \u2014 923 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), 242 methods, 32 blocks, lines 178-2356. The bar is 400 significant lines; this is 523 over it, 2.31\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":"src/base/matrix.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"056927e7e6bc7d40041bd71c4e1e7837e01093904cb1f15a323d4434bd94527f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Quaternion: TooManyMethods \u2014 57 methods, declared across 2 files: geometry/quaternion.rs (49), geometry/quaternion_construction.rs (8). The bar is 30 methods; this is 27 over it, 1.90\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"src/geometry/quaternion.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9024ddecd7185bc750e070239be10f23d13395fbcdd0759190a29c0a281bb162"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: geometry/dual_quaternion_ops.rs: FileTooLong \u2014 929 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 429 over it, 1.86\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":"src/geometry/dual_quaternion_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e8ccb5ffb731297831ad82bd6114ab38604a43fb91283a3974625b07e7efdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: io/matrix_market.rs: FileTooLong \u2014 824 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 324 over it, 1.65\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":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ba53ec8d33e68a0b89cc27b3e0e0d873e5ef355cb3c2f6b91ca18ff6666111"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SVD.try_new_unordered: MethodTooLong \u2014 try_new_unordered runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/svd.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd51e835721715ef7a8d62f6d0d7e33c1cd1cb2ba80b7f5b24295f58eb5c7bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: nalgebra_sparse::io::matrix_market::load_coo_from_matrix_market_str: FunctionTooLong \u2014 nalgebra_sparse::io::matrix_market::load_coo_from_matrix_market_str runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32589d9fd64c8cad191b941da86f042cedbe4cfdfd602f910512671357dd070"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: base/matrix_view.rs: FileTooLong \u2014 725 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 225 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8083c787e8b9040a97c90f015f02da22ee9ecb52437bbaae646cabc8e507c1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Schur.do_decompose: MethodTooLong \u2014 do_decompose runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/schur.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c73169ae3e7b8fbf80c4e292202dd0bc24e37f9874d42a5c313e88ad0fd145"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: nalgebra_glm::gtc::type_ptr: TooManyFunctions \u2014 40 free functions. The bar is 30 free functions; this is 10 over it, 1.33\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":"nalgebra-glm/src/gtc/type_ptr.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"55533e8f4ba5e5c9c3a346223c8d7cdbda85a7a0031c34cadaa1c1e154f93848"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: nalgebra_glm::gtx::euler_angles: TooManyFunctions \u2014 40 free functions. The bar is 30 free functions; this is 10 over it, 1.33\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":"nalgebra-glm/src/gtx/euler_angles.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f8fe7f7059b059ab8db700b70599e35c7bc79caa37b5211a5f7e9fe7fc803a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: base/edition.rs: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: Matrix (12 blocks, 18-1308). The bar is 500 significant lines; this is 121 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/edition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3321a7f29fd0ff24035264824f0fd5c001a40df797a9f36bc331d66548c1c085"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: geometry/quaternion.rs: FileTooLong \u2014 621 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 121 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/quaternion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6017a2047eafa5bb7c347603830a1517b15034766c705f6bf4e88def4529c94"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CscMatrix: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csc.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52a78c2d35439a26abcbf6b494185616b551dee641c4879b3287a42e7631836"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CsrMatrix: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csr.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4639af0bb7f9fbc021c776b03ce69b6ecfce288d3214e76bb025a6f75c4d7c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: M6x6: TooManyFields \u2014 36 stored fields. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/coordinates.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"beedadbef78801f6ce06509e4c226e3215994f1cf039204a34d1aefb9b9694ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: nalgebra::linalg::inverse::do_inverse4: FunctionTooLong \u2014 nalgebra::linalg::inverse::do_inverse4 runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/inverse.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"751b9342e4bbf614dd8c9456963ece630e5b739a7c7545957f09bf6aa3c514d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: base/blas.rs: FileTooLong \u2014 575 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 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/blas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f2c999a8dc77c401132f04d7aecc6e4cc273a8e5ac271bc0c240f2eec8d6e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: linalg/svd.rs: FileTooLong \u2014 556 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 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/svd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5aec6ac9e1dbdae355c64abd5a93d174a3d2f6590a6117d485cee84f48c7f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SymmetricEigen.do_decompose: MethodTooLong \u2014 do_decompose runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/symmetric_eigen.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6f9ec1875c0c7394a5ff7c81f991102d922737ca94910bd1133c9e5b684ecf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: nalgebra_glm::gtc::bitfield: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtc/bitfield.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dab5d2b5e7caa283394a8f7f76622fe7112b5a4bf37bc09a854e95020b3c34"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: nalgebra::base::blas_uninit::gemm_uninit: FunctionTooLong \u2014 nalgebra::base::blas_uninit::gemm_uninit runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/blas_uninit.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"265c22e23384eae56456a289cf176f8657271e7064d80c381b121a4d357e1cef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: nalgebra_macros::stack_impl::stack_impl: FunctionTooLong \u2014 nalgebra_macros::stack_impl::stack_impl runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-macros/src/stack_impl.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e80d8be3f42a9d65aeeef3e691311a665e67f71750a77c779be95f1ca60571"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: base/ops.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbf924dfcccf41878a3ddbf01ee329555216d4f0a434b52d7b0f3bc8b256677"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: nalgebra_glm::ext::matrix_clip_space: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d5e3b8b8564f3ddbf8a07bf614fc91be5c8788eec1e51992e30cdace4c393e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Matrix.dotx: MethodTooLong \u2014 dotx runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/blas.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8cdfb1ea86ca3c713670a2737d1a5f22eb794c245978b306d4fdf21b085eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): nalgebra-glm/src/ext/matrix_clip_space.rs:216-228 | nalgebra-glm/src/ext/matrix_clip_space.rs:248-261 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d949549ef41fc77c06de6da438d7a9e2b4075f53fb52267de80535f55705fe05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): nalgebra-glm/src/ext/matrix_clip_space.rs:107-119 | nalgebra-glm/src/ext/matrix_clip_space.rs:139-152 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8757b640f256a9172ced1f7942b25470a5523ae0a6543a66860763ad101dce3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/base/matrix.rs:846-869 | src/base/matrix.rs:890-919 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"66892650502f1ae7ebb6b2bbf6cbecb4ecb4625952e53dce296a00b20ba947d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): nalgebra-glm/src/ext/matrix_clip_space.rs:554-577 | nalgebra-glm/src/ext/matrix_clip_space.rs:590-613 | nalgebra-glm/src/ext/matrix_clip_space.rs:656-680 | nalgebra-glm/src/ext/matrix_clip_space.rs:693-717 | nalgebra-glm/src/ext/matrix_clip_space.rs:794-808 \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":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b77f6c5ff94998fb66129262d524985075f8a1bd3796191c12e4050663ff3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): nalgebra-glm/src/ext/matrix_clip_space.rs:329-347 | nalgebra-glm/src/ext/matrix_clip_space.rs:365-383 | nalgebra-glm/src/ext/matrix_clip_space.rs:429-447 | nalgebra-glm/src/ext/matrix_clip_space.rs:465-483 \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":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee444c89b1b375db5a8ebcc4b052ed92e8bfe47aa1d07ac8faeff073f67d658c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): nalgebra-lapack/src/qr_util.rs:46-56 | nalgebra-lapack/src/qr_util.rs:81-91 | nalgebra-lapack/src/qr_util.rs:115-125 | nalgebra-lapack/src/qr_util.rs:149-159 \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":"nalgebra-lapack/src/qr_util.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8367627608bbb8cbfd7e3482935033a605569c6035fb52711b1bc840a1a8d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): nalgebra-lapack/src/generalized_eigenvalues.rs:79-150 | nalgebra-lapack/src/qz.rs:77-159 \u2014 These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/generalized_eigenvalues.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83348279180bb169acaf4f44deac93ca469ff4d6bf714ef7fc78c495d24d912"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): nalgebra-sparse/src/ops/serial/csc.rs:199-244 | nalgebra-sparse/src/ops/serial/csc.rs:257-303 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/serial/csc.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"832f422b91b1857ec513a218f366622ac05fea6174538cfef777a557fc92042e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/linalg/svd.rs:480-510 | src/linalg/svd.rs:520-550 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/svd.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db5ecf8f91ff22c53a5fdd9bd32db6c5cdfa1a03e55d0ea3ac016bf2c338a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/linalg/exp.rs:322-346 | src/linalg/exp.rs:348-377 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/exp.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4055ffdbd6230fe4a7c2c1c824aeeecbb539b92b3e10268b69fcc48d985289"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/linalg/cholesky.rs:49-76 | src/linalg/cholesky.rs:221-272 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/cholesky.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc270070c9a518b9b109acce972444bff5befdcdbf8e538a58f9d6e81d20286"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): src/base/edition.rs:366-409 | src/base/edition.rs:417-458 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/edition.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e3dd3f2e529d67962ab18594237db7679c2569549fab680973012c00c88197"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/linalg/full_piv_lu.rs:56-91 | src/linalg/lu.rs:93-122 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/full_piv_lu.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b53ea8de186cf6ac797598e035aa5b969bcf2cdcff861594821e54c75bc426"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/geometry/orthographic.rs:221-237 | src/geometry/perspective.rs:138-153 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/orthographic.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"904ab0660095e1e29f985e017270280e9ebf616cc4f4e53f1eb167a722f8f781"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): nalgebra-sparse/src/io/matrix_market.rs:1131-1158 | nalgebra-sparse/src/io/matrix_market.rs:1164-1208 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"810f3eb68aba59e43fd3eed9e1a09ccc42a4b5935ddcc06da7ec3958117950a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/linalg/col_piv_qr.rs:257-282 | src/linalg/qr.rs:231-256 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/col_piv_qr.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"28875005dd2be5f1bf481b738e6ea68b618d057b58d05d73c0e04712c2bbaeff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/linalg/givens.rs:118-137 | src/linalg/givens.rs:145-164 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/givens.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"093c9489d4a1388dc1023f57bd40cc236fd1fd9fc141f62bca4b8d6923d8c911"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): nalgebra-sparse/src/convert/serial.rs:101-125 | nalgebra-sparse/src/convert/serial.rs:178-199 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/convert/serial.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"28004c1ce84f71d3d22d7ded5b7284ee014c6441db43b26d0750d9c3f20c8a4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): nalgebra-sparse/src/io/matrix_market.rs:1290-1304 | nalgebra-sparse/src/io/matrix_market.rs:1358-1381 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2650ebd46477f6915298ef2fb3f924369032afe0eee67ed4824509a6df66bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): nalgebra-sparse/src/factorization/cholesky.rs:351-377 | src/sparse/cs_matrix_cholesky.rs:227-251 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/factorization/cholesky.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb02e88b5c4a5bcf4158055b1f8b23af7d4b3491a84f6594be491276dcdfaed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/linalg/givens.rs:61-72 | src/linalg/givens.rs:78-89 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/givens.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ecda80705184d959a7bd34f6c3095720b99d661d643b42dd9365715b7a869f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): nalgebra-lapack/src/svd.rs:148-167 | nalgebra-lapack/src/svd.rs:174-199 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/svd.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c0e6296f8667d60b295311114c7d8b18fe78d706c7802570123ba2d910091d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): nalgebra-sparse/src/factorization/cholesky.rs:301-324 | src/sparse/cs_matrix_cholesky.rs:260-281 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/factorization/cholesky.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c4610b48acd2e23f14169d45a34fcf1397b7b3357645d6925b1d29d0055ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/linalg/lu.rs:341-357 | src/linalg/lu.rs:370-389 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/lu.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1622351709fa04fa06a83620b83e49255ab30318fcc9e30d41fac8408ab78dfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): nalgebra-glm/src/ext/matrix_projection.rs:167-179 | nalgebra-glm/src/ext/matrix_projection.rs:204-216 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_projection.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"982d1af13d7177cf411b7e13cda80e712c6d893f8c8fcafecd5f76c656b4ac14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): src/base/default_allocator.rs:211-229 | src/base/default_allocator.rs:244-262 | src/base/default_allocator.rs:277-295 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/default_allocator.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4dc8390fc8950dac0c3f23d5c0c2ac8dd822457cdc7a6613b2932c0c32bf6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): nalgebra-sparse/src/csc.rs:589-619 | nalgebra-sparse/src/csr.rs:590-620 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csc.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1000d05167b3aa2475f452282ab298a84d3ad0e40d8e8786b771701bd3fdae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): src/linalg/col_piv_qr.rs:132-150 | src/linalg/householder.rs:133-150 | src/linalg/qr.rs:111-129 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/col_piv_qr.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e84cc9e922cb9346d1d2b54829bb850abf36cf248b7af39d6249044c232ae9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): nalgebra-lapack/src/colpiv_qr/permutation.rs:95-123 | nalgebra-lapack/src/colpiv_qr/permutation.rs:136-162 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/colpiv_qr/permutation.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fa29c7a72750b1846aad88ed7a6eed52c96ab988b126e2ea66a38545aa615a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/linalg/col_piv_qr.rs:184-194 | src/linalg/qr.rs:161-171 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/col_piv_qr.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28c58eec0335e231babe4d6fac0718e2e615b83efbee5366391846937505797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): nalgebra-lapack/src/cholesky.rs:123-147 | nalgebra-lapack/src/lu.rs:184-217 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/cholesky.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebda74ce001080da75b1f37b64bfc21cbfba6713dfff4e6a02300e78c02a6da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): src/geometry/orthographic.rs:472-478 | src/geometry/perspective.rs:238-246 | src/geometry/perspective.rs:251-260 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/orthographic.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"545812484366db3b05862a0405172d78fc9407c4fcd4b6a7d830bf5f57d8e06d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/base/matrix.rs:1723-1735 | src/geometry/point.rs:206-221 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"041c6ebfd0177546b32154355cc302a32733c9ea332997725d57542a3dbcef0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): src/linalg/exp.rs:223-244 | src/linalg/exp.rs:246-267 | src/linalg/exp.rs:269-290 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/exp.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff33114f183e0dec2cb2dfc3ae4361cb1221506739f6d4f74cc8050cb6c6df0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/base/matrix.rs:1017-1035 | src/base/matrix.rs:1057-1081 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e7eef3b683a58f4786d05e7bce854c7abaeb0a37318ae05c03055f65092c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/geometry/perspective.rs:214-220 | src/geometry/perspective.rs:225-230 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/perspective.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5638fcca22787264df26955c164d894efd956985f64883d26356146a7dd30d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): nalgebra-lapack/src/generalized_eigenvalues.rs:229-241 | nalgebra-lapack/src/qz.rs:182-197 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/generalized_eigenvalues.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"992207b6218189c2d41d4b4e491af0365ed1b72a18984a0fbd9d99fffc310b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): nalgebra-glm/src/ext/matrix_clip_space.rs:744-755 | nalgebra-glm/src/ext/matrix_clip_space.rs:769-780 | nalgebra-glm/src/ext/matrix_clip_space.rs:822-832 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"36392870317168675ab0c31daa103108b1f06e3e0d120060387c8576dba4e333"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/base/iter.rs:451-461 | src/base/iter.rs:557-567 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/iter.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73afa83aca658c33c27d6d903fba161bfd5d168c4ad097000287f9e4f21cd28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): src/base/matrix.rs:729-745 | src/base/matrix.rs:816-832 | src/base/matrix.rs:961-983 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"883039258561a3153b64fc27c68b082eb51cb593b601d23cd5f7b3969d385e96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): nalgebra-sparse/src/cs.rs:320-338 | nalgebra-sparse/src/cs.rs:364-384 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/cs.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"25351edf6b8455c6711bac1b79c372a017b74cbb903e01f48aa031b195ef2599"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/linalg/hessenberg.rs:113-124 | src/linalg/hessenberg.rs:132-143 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/hessenberg.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"427d07c1132ce016d787b8880a252a9d052e7261a21b24b2bcf82f25cb51e00b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/geometry/orthographic.rs:685-692 | src/geometry/orthographic.rs:711-718 | src/geometry/orthographic.rs:737-744 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/orthographic.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dd2eb3f8830386b67aa0bafe40128e81464900a56d0a378b079fab97ddc7de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): nalgebra-sparse/src/io/matrix_market.rs:1218-1231 | nalgebra-sparse/src/io/matrix_market.rs:1237-1257 | nalgebra-sparse/src/io/matrix_market.rs:1265-1282 | nalgebra-sparse/src/io/matrix_market.rs:1310-1327 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1975f64497d46c2259d41482bbda4f9377f09080f8b93d3e55221080f2e443a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): nalgebra-sparse/src/ops/serial/csc.rs:85-97 | nalgebra-sparse/src/ops/serial/csc.rs:113-125 | nalgebra-sparse/src/ops/serial/csr.rs:79-88 | nalgebra-sparse/src/ops/serial/csr.rs:104-113 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/serial/csc.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"951f0395ec5db3057a98684d966de42c522905099addc653273b926494039d60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/geometry/reflection.rs:57-66 | src/geometry/reflection.rs:74-83 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/reflection.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"740c21298e7cbe62e703b68b9d744a36e94acba06036ac306a49372937de1ea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/base/matrix.rs:669-688 | src/base/matrix.rs:1291-1305 | src/base/matrix.rs:1405-1424 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"33da057796a74fe1a5e8f7570934fd4092d546c597997e377c1bbeac244ad654"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): nalgebra-macros/src/matrix_vector_impl.rs:158-176 | nalgebra-macros/src/matrix_vector_impl.rs:189-201 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-macros/src/matrix_vector_impl.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c85cde7d2790bb479685ebae1af39735ea512313d7a16ec83291df7867e1606"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/base/iter.rs:403-418 | src/base/iter.rs:492-509 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/iter.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"892157100c9cab717cc1fba823cd4d63f927c45ac226e658098665cf21a12486"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): src/geometry/dual_quaternion.rs:340-344 | src/geometry/dual_quaternion.rs:359-363 | src/geometry/dual_quaternion.rs:373-377 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/dual_quaternion.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbb13f6a76aa155368cbbe3df2b9e2b770e70d340c7a83d248e631a658a98a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): src/geometry/quaternion.rs:969-973 | src/geometry/quaternion.rs:988-992 | src/geometry/quaternion.rs:1002-1006 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/quaternion.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5366e0ad800e287854e54fdaf770d49998a7e6dc61f2e9ce63d16ab8c93eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/geometry/orthographic.rs:540-546 | src/geometry/perspective.rs:269-276 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/orthographic.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c52aab2e716956cdbb3659df81f7bfb8e2d7dc51c3901a670baa4216e284da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): src/linalg/col_piv_qr.rs:100-108 | src/linalg/col_piv_qr.rs:117-125 | src/linalg/qr.rs:84-89 | src/linalg/qr.rs:98-104 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/col_piv_qr.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff88e002e8d967d174ba2d4bccc15f79bfb20183fac95565491dd7ee2704a718"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): nalgebra-macros/src/lib.rs:151-162 | nalgebra-macros/src/matrix_vector_impl.rs:178-187 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-macros/src/lib.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bbdf15e9bea4ace2f7b9b0e0ebb96d549eef88f26a264413d3c4299772f4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/linalg/full_piv_lu.rs:193-214 | src/linalg/lu.rs:246-260 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/full_piv_lu.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2632e13e48da883e22dd531b02639620682e736a92c71802cf6a622bd87ff244"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/geometry/quaternion.rs:740-744 | src/geometry/quaternion.rs:780-784 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/quaternion.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc865245a05e9650098f1fa287a1eaba2ff06cfea5fb40d8f89ef5525ccae544"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): nalgebra-glm/src/ext/matrix_relationnal.rs:38-46 | nalgebra-glm/src/ext/matrix_relationnal.rs:82-90 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_relationnal.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cb278d020244c24f1b87138f0890daabdce0b73ced002fe0117559cc313e82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/linalg/col_piv_qr.rs:324-337 | src/linalg/lu.rs:301-314 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/col_piv_qr.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e35a232c7c94ae66d27f57f92ed5de45542568b1a53d7644fa443472660b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/geometry/reflection.rs:94-103 | src/geometry/reflection.rs:115-124 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/reflection.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"619dccfbe296ab732d920b440a8cf373b36ed0b9915dc5ec09c1eb9c1622afb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): nalgebra-lapack/src/symmetric_eigen.rs:153-161 | src/linalg/symmetric_eigen.rs:306-314 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/symmetric_eigen.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2007017a93d5852b54db14a6168d55ba784137ebfbe4090502633429c7ff3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): nalgebra-lapack/src/qr_util.rs:354-369 | nalgebra-lapack/src/qr_util.rs:385-400 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/qr_util.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c5706f01e2aeb589439e8ecd32315cb20bcb7b50007a863f4ca0a82dca14e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/base/iter.rs:425-434 | src/base/iter.rs:522-531 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/iter.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd2a8487a5e7d052eb7c625054c473469979e00557e8e13224ccb92827ba4a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): nalgebra-sparse/src/csc.rs:651-659 | nalgebra-sparse/src/csc.rs:673-681 | nalgebra-sparse/src/csr.rs:652-660 | nalgebra-sparse/src/csr.rs:674-682 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csc.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f3c85b7f93f0cb81ea539a9da6b54bb3805db2c5f270b6ef1cfa645cc5fa56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/linalg/exp.rs:126-134 | src/linalg/exp.rs:136-144 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/exp.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb23e99ff12d6bce7e3da35816053721205ee52880505ced3a2be584b2a1a52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): nalgebra-sparse/src/convert/serial.rs:57-69 | nalgebra-sparse/src/convert/serial.rs:131-143 | nalgebra-sparse/src/convert/serial.rs:205-217 | nalgebra-sparse/src/convert/serial.rs:223-235 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/convert/serial.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26ece6ab55e8096c70e1984643737d42fb382b6dedf2f84c079483c6f1eef3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): nalgebra-sparse/src/coo/coo_serde.rs:54-64 | nalgebra-sparse/src/csc/csc_serde.rs:54-64 | nalgebra-sparse/src/csr/csr_serde.rs:54-64 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/coo/coo_serde.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5c04dec9dde41c9fdf5d26dbe2e0dc4d52588906ab780dc7272f69d7153075"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): nalgebra-sparse/src/cs.rs:138-145 | nalgebra-sparse/src/cs.rs:160-169 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/cs.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d851a45640fd312b10dd3893089f16e899b72f87b67eb532606ab857a7fccb65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): nalgebra-lapack/src/colpiv_qr.rs:176-184 | nalgebra-lapack/src/qr.rs:140-155 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/colpiv_qr.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f77c96be2d0070436a9b489c2ea7f7bf145394fb1a114073a514c1a12ac85e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): nalgebra-lapack/src/lu.rs:116-124 | src/linalg/full_piv_lu.rs:104-110 | src/linalg/lu.rs:135-141 | src/linalg/lu.rs:152-158 | src/linalg/lu.rs:165-171 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/lu.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9e9660fd50cf286c5a15745d76192b9baf0cf36da884f8a8e641196999fb16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/base/edition.rs:278-289 | src/base/edition.rs:294-304 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/edition.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88f51b28df52ea670118f1a97891dd620ea1195b3e6ba0e0a608f291b40e94f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): src/linalg/col_piv_qr.rs:288-303 | src/linalg/full_piv_lu.rs:220-234 | src/linalg/lu.rs:266-279 | src/linalg/qr.rs:262-277 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/col_piv_qr.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f5b1a52132581a86b3e99fd51fd9a5a39d2455303448afcb66f6d76e4c706b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/linalg/svd.rs:80-83 | src/linalg/svd.rs:85-88 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/svd.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50650d07c9b90cdacefc5348f6fd499ea1f8e39cb91469825decab02353a798"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/geometry/quaternion.rs:758-765 | src/geometry/quaternion.rs:798-805 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/quaternion.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"16565fcdc0d760adbbb1e90a17c97dbfc652328adb6fa94ba9be6a17d985f56d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/linalg/exp.rs:164-176 | src/linalg/exp.rs:178-190 | src/linalg/exp.rs:192-204 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/exp.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2888ff5255df3665001696248f71fcd7f8d8d3f14edc5ccd0294281491fd4fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): nalgebra-glm/src/gtc/type_ptr.rs:83-90 | nalgebra-glm/src/gtx/transform2.rs:54-61 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtc/type_ptr.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"564f8d3d1d6e0c303ed9ee831fe4326683800b3345ce5b5a772409d12d2f29f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): nalgebra-sparse/src/coo/coo_serde.rs:35-44 | nalgebra-sparse/src/csc/csc_serde.rs:35-44 | nalgebra-sparse/src/csr/csr_serde.rs:35-44 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/coo/coo_serde.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad118e3917f17358ea1ea633c6854bdbd15f6a6c857668b2a0618bd76c53909"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/geometry/rotation.rs:273-281 | src/geometry/translation.rs:161-166 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/rotation.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad7b8b63617707517ef73977950de80efc11d4e66afafaf2fb6588a07727218"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): nalgebra-glm/src/gtc/type_ptr.rs:108-115 | nalgebra-glm/src/gtx/transform2.rs:78-84 | nalgebra-glm/src/gtx/transform2.rs:96-102 | nalgebra-glm/src/gtx/transform2.rs:105-111 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtc/type_ptr.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0a405fe63a10d4815d733a5f826538656d738060d12b42999390c2772a46c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): nalgebra-sparse/src/cs.rs:119-130 | nalgebra-sparse/src/cs.rs:148-156 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/cs.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ca1479cc944729f528ca9aec41af7cb751a4617aa10f0e06790daf87194dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): nalgebra-sparse/src/io/matrix_market.rs:407-418 | nalgebra-sparse/src/io/matrix_market.rs:424-435 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"590c88014d40959a579200b3151c8f10870c0ab7124d9c09504c0a4f4c9bc282"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/base/edition.rs:118-126 | src/base/edition.rs:134-141 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/edition.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71ca781a91d89607def9130a2e431ffd0dd8ed73a262f8c1bbc33d41ba0176d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): nalgebra-sparse/src/csc.rs:230-241 | nalgebra-sparse/src/csr.rs:231-242 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csc.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd703f83b8b471275cdb94a9fdcea4a80a5e4e79fae9f9b576901990ddb2d54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/debug/random_orthogonal.rs:51-54 | src/debug/random_sdp.rs:54-57 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/debug/random_orthogonal.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbd0c6b720f5222ef9854fe283dfc79fd03d18003239e357dc231bf36cb481c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): src/geometry/isometry.rs:585-592 | src/geometry/rotation.rs:569-575 | src/geometry/scale.rs:388-394 | src/geometry/similarity.rs:428-435 | src/geometry/translation.rs:299-305 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/isometry.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5283fdc7ad176e0667e6ea64c888de589b38ff516463be7898ba135bbc7785"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/linalg/col_piv_qr.rs:307-320 | src/linalg/qr.rs:281-294 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/col_piv_qr.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d421efa70129c713352b2f63a8b8b52d19ead2c25aac150b59129e35946f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/linalg/full_piv_lu.rs:118-121 | src/linalg/lu.rs:179-182 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/full_piv_lu.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e452e3c9ff0172f48161f762aac2203140fbe508d50d51a32163df7c0acd7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): nalgebra-sparse/src/ops/serial/csc.rs:61-64 | nalgebra-sparse/src/ops/serial/csr.rs:56-59 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/serial/csc.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b91305972f5847e2f85f611a26579bc10bb13a04952ba8c39a44f2acaf2d8e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): nalgebra-sparse/src/csc.rs:198-221 | nalgebra-sparse/src/csr.rs:199-222 \u2014 before extracting anything, compare \u0060nalgebra-sparse/src/csc.rs\u0060 and \u0060nalgebra-sparse/src/csr.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csc.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9147d522a9f3629ce8ece909fbc95e9921ab980f4e908649f439325928883e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201318 lines \u00D7 2): src/base/blas_uninit.rs:150-160 | src/base/blas_uninit.rs:252-269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/base/blas_uninit.rs:150\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/blas_uninit.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"88274c4ae13af50ba19c0ea5a025cbaa164ad75f05fd664d640bbe1c11f8c8df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): nalgebra-glm/src/ext/matrix_clip_space.rs:555-571 | nalgebra-glm/src/ext/matrix_clip_space.rs:591-607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54a5ecebc2e337df55bd2adafacfd7093ea91f0414456187b055bb432669f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/linalg/col_piv_qr.rs:260-276 | src/linalg/qr.rs:234-250 \u2014 before extracting anything, compare \u0060src/linalg/col_piv_qr.rs\u0060 and \u0060src/linalg/qr.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/linalg/col_piv_qr.rs:260\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/col_piv_qr.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e3551427a6d77e56d064f009cb42db86c0ec887d35c8dafb4c0fac6fad042a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/base/default_allocator.rs:215-229 | src/base/default_allocator.rs:248-262 | src/base/default_allocator.rs:281-295 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/base/default_allocator.rs:215\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060buf\u0060 to \u0060\u003CSelf as Allocator\u003CRFrom, CFrom\u003E\u003E::Buffer\u003CT\u003E\u0060 in one and \u0060ArrayStorage\u003CT, RFROM, CFROM\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/default_allocator.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a657fec203c83c65dc71e5091d48640090dfe62e6e276265665d88323115b148"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): nalgebra-lapack/src/colpiv_qr/permutation.rs:97-111 | nalgebra-lapack/src/colpiv_qr/permutation.rs:138-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-lapack/src/colpiv_qr/permutation.rs:97\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/colpiv_qr/permutation.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebd7c9da2a4270c716afe71c840445711770973d61582e0d57c919cd2f75c7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): nalgebra-macros/src/stack_impl.rs:39-52 | nalgebra-macros/src/stack_impl.rs:78-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-macros/src/stack_impl.rs:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-macros/src/stack_impl.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d792a350a6d24e067210089bae801f07b4993e46403fc3f5f719542556a7d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/base/default_allocator.rs:109-122 | src/base/default_allocator.rs:161-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/default_allocator.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed496cfdb1e74fc456db0548482781b9add07e67ac6fa091ef1b56a3e9a76eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): src/base/matrix.rs:850-861 | src/base/matrix.rs:899-910 | src/base/matrix.rs:966-976 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/base/matrix.rs:850\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb56daeea1bdbedbe1a525d34583f38786e623e2ebbb3c96f0fc856e0863233"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): nalgebra-lapack/src/eigen.rs:271-282 | nalgebra-lapack/src/eigen.rs:296-307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-lapack/src/eigen.rs:271\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/eigen.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb752d5c5d7a8ca6bf94ef140acb2f53eb129f35068a5dcac66d46d2fff9487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): nalgebra-sparse/src/io/matrix_market.rs:1143-1155 | nalgebra-sparse/src/io/matrix_market.rs:1174-1186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060nalgebra-sparse/src/io/matrix_market.rs:1142\u0060 calls \u0060next\u0060, \u0060unwrap\u0060, \u0060as_str\u0060 and \u0060nalgebra-sparse/src/io/matrix_market.rs:1173\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"398d87481903b951b3c9db56cae78c55951a1e8d812d0234d6302c0bd7006774"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): nalgebra-sparse/src/ops/serial/csc.rs:207-218 | nalgebra-sparse/src/ops/serial/csc.rs:268-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-sparse/src/ops/serial/csc.rs:207\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/serial/csc.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a8509b60a207c58ccda28fa3e8ec746b56201638c93edb685fdfe238c273ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/base/matrix.rs:1020-1030 | src/base/matrix.rs:1064-1075 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/base/matrix.rs:1020\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/base/matrix.rs:1062\u0060 calls \u0060shape\u0060 and \u0060src/base/matrix.rs:1020\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1dca9432ca053364dc9f27c11ab9666a232d90b7bad1a2d5a10552123faee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/base/matrix.rs:2090-2110 | src/base/matrix.rs:2112-2133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/base/matrix.rs:2112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e943b3eacd370187be097a8a35b8c86682b75df6205c7afa0f167738b3de5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): nalgebra-glm/src/ext/matrix_clip_space.rs:330-341 | nalgebra-glm/src/ext/matrix_clip_space.rs:366-377 | nalgebra-glm/src/ext/matrix_clip_space.rs:430-441 | nalgebra-glm/src/ext/matrix_clip_space.rs:466-477 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"df54de7fa97df303a4cea3baef30082872248d93eeabc9ab84a0e6339224d570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): nalgebra-glm/src/ext/matrix_clip_space.rs:657-667 | nalgebra-glm/src/ext/matrix_clip_space.rs:694-704 \u2014 both copies are in the same file, so extract the block 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":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"209ba0718422b34593b89f4186440cc25a917f684ad7a95ba416d8c2e09e53dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): nalgebra-glm/src/ext/matrix_clip_space.rs:604-613 | nalgebra-glm/src/ext/matrix_clip_space.rs:708-717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-glm/src/ext/matrix_clip_space.rs:604\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"557520ad0410a1ceb7b75d0ca84979be9961ebdbb8b5fa528d4e5ae192a4cc5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): nalgebra-lapack/src/generalized_eigenvalues.rs:88-99 | nalgebra-lapack/src/qz.rs:86-97 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-lapack/src/generalized_eigenvalues.rs:88\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/generalized_eigenvalues.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"160bf20c125bdeb0a8da0ae0c84cf656fcd911acffb5cf5facad8f956e0caa0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): nalgebra-sparse/src/factorization/cholesky.rs:310-319 | src/sparse/cs_matrix_cholesky.rs:269-278 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-sparse/src/factorization/cholesky.rs:310\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060nalgebra-sparse/src/factorization/cholesky.rs:321\u0060 calls \u0060sort_unstable\u0060 and \u0060src/sparse/cs_matrix_cholesky.rs:280\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/factorization/cholesky.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4df5d1525edc29e500327096e9d726b5da2f891d08e0073f9f6f3f9cd8b6f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/linalg/cholesky.rs:50-60 | src/linalg/cholesky.rs:222-232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/linalg/cholesky.rs:50\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/cholesky.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2702deed8983108f7499fcb6b2f6dbac474a05422ed7a1834e1857381b34c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): nalgebra-sparse/src/csc.rs:652-659 | nalgebra-sparse/src/csr.rs:653-660 \u2014 before extracting anything, compare \u0060nalgebra-sparse/src/csc.rs\u0060 and \u0060nalgebra-sparse/src/csr.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csc.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6887bd93b66c009235b94a63712d8895ebad503584b0ea5be7ccfed6541af02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): nalgebra-sparse/src/csc.rs:674-681 | nalgebra-sparse/src/csr.rs:675-682 \u2014 before extracting anything, compare \u0060nalgebra-sparse/src/csc.rs\u0060 and \u0060nalgebra-sparse/src/csr.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csc.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce2fc340f9a818ea4bcd4a9268b96877b01ad406c171b1fe8276c63e8e59706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/base/matrix.rs:730-737 | src/base/matrix.rs:817-824 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/base/matrix.rs:730\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"0205281a157ede5aab8c1b886bfdc353695a9187515c47b1ec2e89e8a7afbc9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): nalgebra-glm/src/ext/matrix_clip_space.rs:704-710 | nalgebra-glm/src/ext/matrix_clip_space.rs:795-801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32db0fca1e8b2d066b113a84a5bd5e03cdbf49e1a7e1265b89c6fef79af285f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): nalgebra-lapack/src/generalized_eigenvalues.rs:230-236 | nalgebra-lapack/src/qz.rs:183-190 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-lapack/src/generalized_eigenvalues.rs:230\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/generalized_eigenvalues.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"36930e5ba87b94de97a897cd2fa479c1e00e535b59e9517800ca10e80c3d3b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): nalgebra-glm/src/ext/matrix_clip_space.rs:669-674 | nalgebra-glm/src/ext/matrix_clip_space.rs:706-711 | nalgebra-glm/src/ext/matrix_clip_space.rs:797-802 \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":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce59f80d142430f3d056530d89168b747f3f0f9a2e1429f7b941a3ee7b639d24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/linalg/svd3.rs:26-31 | src/linalg/svd3.rs:33-38 | src/linalg/svd3.rs:40-45 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/linalg/svd3.rs:26\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/svd3.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42f62b455b27333952e22137d23ee3b4dbfa62e6705ab9b76bc0c9f62e5857d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): nalgebra-lapack/src/qr_util.rs:47-52 | nalgebra-lapack/src/qr_util.rs:82-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/qr_util.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ab0bdaa75fec3881822807ef689a500b231514d56eb8775e99ea5ec970c06a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): nalgebra-lapack/src/qr_util.rs:116-121 | nalgebra-lapack/src/qr_util.rs:150-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/qr_util.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8891937116bc6d28c05fa773a91175994328a35bde2dd317eb85f5b6cb66aa23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/base/unit.rs:353-358 | src/base/unit.rs:383-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/base/unit.rs:353\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/unit.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"508699837f665c5c8856db0090df711b48b268e43f20b3c959c3275a11b9baef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/linalg/col_piv_qr.rs:143-150 | src/linalg/qr.rs:122-129 \u2014 before extracting anything, compare \u0060src/linalg/col_piv_qr.rs\u0060 and \u0060src/linalg/qr.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/linalg/col_piv_qr.rs:143\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/linalg/col_piv_qr.rs:154\u0060 calls \u0060p\u0060 and \u0060src/linalg/qr.rs:132\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/col_piv_qr.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c810edd2f2cfba4d0fb40b756be7c0cd4feed2fffcafa6db6369be9fa7820f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/sparse/cs_matrix_cholesky.rs:94-99 | src/sparse/cs_matrix_cholesky.rs:164-169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/sparse/cs_matrix_cholesky.rs:94\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sparse/cs_matrix_cholesky.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1794e1adc2a26f4abeaec5d67dde9073d2547edb2de9c383d1db779739181c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): nalgebra-lapack/src/qr_util.rs:48-52 | nalgebra-lapack/src/qr_util.rs:83-87 | nalgebra-lapack/src/qr_util.rs:117-121 | nalgebra-lapack/src/qr_util.rs:151-155 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-lapack/src/qr_util.rs:48\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/qr_util.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ea7f0b40a6f56be0d94623e247787da33e3dd744181cc2009b64fc8932e156"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): nalgebra-glm/src/ext/matrix_clip_space.rs:745-749 | nalgebra-glm/src/ext/matrix_clip_space.rs:770-774 | nalgebra-glm/src/ext/matrix_clip_space.rs:823-827 \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":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d0d8d9cdd7eaedf0030baa780c09bc226c2dda15c55a30ed8a8cf1330c47f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): nalgebra-glm/src/gtx/transform2.rs:79-84 | nalgebra-glm/src/gtx/transform2.rs:97-102 | nalgebra-glm/src/gtx/transform2.rs:106-111 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtx/transform2.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"44537fd6e5da616d41587fe77ca9e1ffce00601248b106cee595f6372bc4282e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 4): nalgebra-glm/src/ext/matrix_clip_space.rs:108-111 | nalgebra-glm/src/ext/matrix_clip_space.rs:140-144 | nalgebra-glm/src/ext/matrix_clip_space.rs:217-220 | nalgebra-glm/src/ext/matrix_clip_space.rs:249-253 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"470028fd6eb6863cb4690208cd154cf18fbd86530beefe3b01c4cae9ed47e81f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/linalg/full_piv_lu.rs:105-110 | src/linalg/lu.rs:136-141 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/full_piv_lu.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"53301dc63fdd8b59a74359b1adbb94ef621af8500234178684b2bc1b8ea99de1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/linalg/lblt.rs:395-399 | src/linalg/lblt.rs:405-409 \u2014 both copies are in the same file, so extract the block 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":"src/linalg/lblt.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60caa66745c0d7a3ae7f13e101ec25c7c2d9329d5c8816d1750eeedd3919e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): src/linalg/svd.rs:383-385 | src/linalg/svd.rs:434-438 | src/linalg/symmetric_eigen.rs:290-294 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/linalg/svd.rs:383\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/svd.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bbf210b0f795994ad8135df18796f1616f9e3b752071060a7d8bbb791b44b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): nalgebra-sparse/src/ops/serial/csc.rs:144-161 | nalgebra-sparse/src/ops/serial/csr.rs:132-149 \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":"nalgebra-sparse/src/ops/serial/csc.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46931bab1571337f436563c60e530d543cc2774c26d2644e4f193d4e1bbf372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (135 lines \u00D7 3): nalgebra-glm/src/gtc/bitfield.rs:5-139 | nalgebra-glm/src/gtc/packing.rs:5-298 | nalgebra-glm/src/gtx/euler_angles.rs:5-163 \u2014 before extracting anything, compare \u0060nalgebra-glm/src/gtc/bitfield.rs\u0060 and \u0060nalgebra-glm/src/gtc/packing.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 1470 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":"nalgebra-glm/src/gtc/bitfield.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68ecfaf7b2f0c307e8c00dea68df875748094338084f0a4800ad91825b67456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 7): nalgebra-glm/src/gtc/bitfield.rs:5-139 | nalgebra-glm/src/gtc/packing.rs:5-298 | nalgebra-glm/src/gtc/reciprocal.rs:1-47 | nalgebra-glm/src/gtc/round.rs:6-108 | nalgebra-glm/src/gtx/euler_angles.rs:5-163 | nalgebra-glm/src/integer.rs:6-111 | nalgebra-glm/src/packing.rs:5-51 \u2014 before extracting anything, compare \u0060nalgebra-glm/src/gtc/bitfield.rs\u0060 and \u0060nalgebra-glm/src/gtc/packing.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 1470 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":"nalgebra-glm/src/gtc/bitfield.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"865eba0547eaf35824a5b86b09073a777d57de9dd6688e6d8ef51a89de2ce30d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (103 lines \u00D7 4): nalgebra-glm/src/gtc/bitfield.rs:5-139 | nalgebra-glm/src/gtc/packing.rs:5-298 | nalgebra-glm/src/gtc/round.rs:6-108 | nalgebra-glm/src/gtx/euler_angles.rs:5-163 \u2014 before extracting anything, compare \u0060nalgebra-glm/src/gtc/bitfield.rs\u0060 and \u0060nalgebra-glm/src/gtc/packing.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 1470 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":"nalgebra-glm/src/gtc/bitfield.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49ce2f414c1e35b9e74fca3957be3238778a1da738bb3ab40ed14351ecf4ce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 8): nalgebra-glm/src/gtc/bitfield.rs:5-139 | nalgebra-glm/src/gtc/packing.rs:5-298 | nalgebra-glm/src/gtc/reciprocal.rs:1-47 | nalgebra-glm/src/gtc/round.rs:6-108 | nalgebra-glm/src/gtc/ulp.rs:5-27 | nalgebra-glm/src/gtx/euler_angles.rs:5-163 | nalgebra-glm/src/integer.rs:6-111 | nalgebra-glm/src/packing.rs:5-51 \u2014 before extracting anything, compare \u0060nalgebra-glm/src/gtc/bitfield.rs\u0060 and \u0060nalgebra-glm/src/gtc/packing.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 1470 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":"nalgebra-glm/src/gtc/bitfield.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3d1729ad5413ab9f31533ffa9103627ec310bf78f4088199f8bedf4faa6401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (159 lines \u00D7 2): nalgebra-glm/src/gtc/packing.rs:5-298 | nalgebra-glm/src/gtx/euler_angles.rs:5-163 \u2014 before extracting anything, compare \u0060nalgebra-glm/src/gtc/packing.rs\u0060 and \u0060nalgebra-glm/src/gtx/euler_angles.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 1764 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":"nalgebra-glm/src/gtc/packing.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b1d3bf2d11b716f6deb7f4d0ce7f73d99dfe2c9e5ce316a304536238756266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (103 lines \u00D7 5): nalgebra-glm/src/gtc/bitfield.rs:5-139 | nalgebra-glm/src/gtc/packing.rs:5-298 | nalgebra-glm/src/gtc/round.rs:6-108 | nalgebra-glm/src/gtx/euler_angles.rs:5-163 | nalgebra-glm/src/integer.rs:6-111 \u2014 before extracting anything, compare \u0060nalgebra-glm/src/gtc/bitfield.rs\u0060 and \u0060nalgebra-glm/src/gtc/packing.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 1470 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":"nalgebra-glm/src/gtc/bitfield.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7ab069bd12450ee76d10abd76503afbb8b573a3ca79620591200f72eacae4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): nalgebra-lapack/src/cholesky.rs:109-116 | src/linalg/col_piv_qr.rs:213-221 | src/linalg/full_piv_lu.rs:176-183 | src/linalg/lblt.rs:311-319 | src/linalg/lu.rs:229-236 | src/linalg/qr.rs:190-198 \u2014 before extracting anything, compare \u0060src/linalg/col_piv_qr.rs\u0060 and \u0060src/linalg/qr.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 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":"nalgebra-lapack/src/cholesky.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"947a1e62f240d29e796d3870806f9c70fd188fd70bb15caea5dd74258a8fecdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): nalgebra-sparse/src/csc.rs:524-532 | nalgebra-sparse/src/csr.rs:527-533 \u2014 before extracting anything, compare \u0060nalgebra-sparse/src/csc.rs\u0060 and \u0060nalgebra-sparse/src/csr.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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":"nalgebra-sparse/src/csc.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a336f1081faf5401ee50e2521d79ac02cb5b20f12d4284ea62bd9f775d309796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): nalgebra-sparse/src/csc.rs:168-177 | nalgebra-sparse/src/csr.rs:169-178 \u2014 before extracting anything, compare \u0060nalgebra-sparse/src/csc.rs\u0060 and \u0060nalgebra-sparse/src/csr.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-sparse/src/csc.rs:168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csc.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5f7494ab30250eef792e332cdb3bf8cf24ec1a3f1f4ac1c672da6824906ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): nalgebra-sparse/src/csc.rs:343-349 | nalgebra-sparse/src/csr.rs:346-352 \u2014 before extracting anything, compare \u0060nalgebra-sparse/src/csc.rs\u0060 and \u0060nalgebra-sparse/src/csr.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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":"nalgebra-sparse/src/csc.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7554c8f58835943ac9120040864c925bb69e18aa86aaee01c5f0be40330e3eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): nalgebra-sparse/src/csc.rs:395-400 | nalgebra-sparse/src/csr.rs:398-403 \u2014 before extracting anything, compare \u0060nalgebra-sparse/src/csc.rs\u0060 and \u0060nalgebra-sparse/src/csr.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 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":"nalgebra-sparse/src/csc.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"983792f6f7e6ad4d29d831551e991e06c53db3486374f9577de1909c80183505"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): nalgebra-sparse/src/io/matrix_market.rs:1312-1323 | nalgebra-sparse/src/io/matrix_market.rs:1335-1347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9312b3ac9bd531feeedad986b7f8a0669cf03777b481a15e73bf023e57a72de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/base/matrix.rs:671-682 | src/base/matrix.rs:1407-1418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/base/matrix.rs:671\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba91e5b4149c473bd6d500d86f22a5993eea274b38581167c81f94504ba24fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): nalgebra-sparse/src/io/matrix_market.rs:1314-1324 | nalgebra-sparse/src/io/matrix_market.rs:1366-1376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-sparse/src/io/matrix_market.rs:1314\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"919ce6daa28d06d82a8529d9955aa06aad5a2a35fa9601ce58824b2008d84ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): nalgebra-macros/src/stack_impl.rs:119-126 | nalgebra-macros/src/stack_impl.rs:131-138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-macros/src/stack_impl.rs:119\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-macros/src/stack_impl.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b72f58313e686cb477657468f60c2b646f105d14b0dacbb193db137e511b2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): nalgebra-macros/src/stack_impl.rs:68-75 | nalgebra-macros/src/stack_impl.rs:105-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-macros/src/stack_impl.rs:68\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-macros/src/stack_impl.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bce2f4e21fcdcfed7b40911fbdbc84f861477196268ad2692978adbb4a3474"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): nalgebra-sparse/src/io/matrix_market.rs:1222-1228 | nalgebra-sparse/src/io/matrix_market.rs:1294-1299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-sparse/src/io/matrix_market.rs:1222\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5880633e8af6526a522b8123c88ae6c68664878f3e787353f929e32e89c218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): nalgebra-sparse/src/io/matrix_market.rs:1135-1140 | nalgebra-sparse/src/io/matrix_market.rs:1168-1173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-sparse/src/io/matrix_market.rs:1135\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060nalgebra-sparse/src/io/matrix_market.rs:1144\u0060 calls \u0060next\u0060, \u0060unwrap\u0060, \u0060as_str\u0060 and \u0060nalgebra-sparse/src/io/matrix_market.rs:1178\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24e1644baaa3601c85b304afc63bc49c221d89814eaa12a1c31ea74e6e38139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): nalgebra-glm/src/ext/matrix_projection.rs:168-172 | nalgebra-glm/src/ext/matrix_projection.rs:205-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060nalgebra-glm/src/ext/matrix_projection.rs:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_projection.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a47146160b74b19d34a6083b1b7941ce99f56deb4c882c9be450cbc4bf5af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/linalg/col_piv_qr.rs:189-194 | src/linalg/qr.rs:166-171 \u2014 before extracting anything, compare \u0060src/linalg/col_piv_qr.rs\u0060 and \u0060src/linalg/qr.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/linalg/col_piv_qr.rs:189\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/col_piv_qr.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbaca03329e7ad3536110ef39ebf6e1877f8b3197a2714ae3195be41966b846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/linalg/inverse.rs:158-162 | src/linalg/inverse.rs:172-176 \u2014 both copies are in the same file, so extract the block 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":"src/linalg/inverse.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f970adb0ec2f4a01849fd40032cfe7b60b5628cb008410b83ec476aaafd61c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/linalg/inverse.rs:234-238 | src/linalg/inverse.rs:250-254 \u2014 both copies are in the same file, so extract the block 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":"src/linalg/inverse.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec6548b94ddbd200671db04ab6475c83830045647e9936774ca7d4694ec70a2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: nalgebra-glm: nalgebra-glm: abstractness 1.00, instability 1.00, distance 1.00 \u2014 zone of uselessness \u2014 abstract and unstable, so it\u0027s likely unused."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ed6fa750220727808e44a9a841a51a11cf1ad14d1ecc8e76d665c8552ec1ec9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Vector (LCOM4 6): Vector\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-macros/src/matrix_vector_impl.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fe660a8edfe200c268dbb891857a69486488caabba63e83a1563af9e337111"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DualQuaternion (LCOM4 4): DualQuaternion\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/dual_quaternion.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c87b3f479b7b81d862ca5350fb84b01c9fb770cf44be475141f9875c3730c4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: full eigendecomposition is not implemented yet because of its complexity when some \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":"tests/linalg/eigen.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3f6ad75cf9128416f2af634ce64dd6cc76fe4192928c9102d4896f0270b91b"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX test Transform \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":"tests/core/conversion.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a587c2a89b7c4e14a9dae2c844b4542d66de30b953ef7d1e976b74327d990b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: What\u0027s a more idiomatic/better way to convert a static matrix to a dynamic one? \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":"tests/core/conversion.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"664321fdf779121bdb5a84c8047b656de14e234d6e92e6ea424a35cef4a70cc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The \u0060into_owned()\u0060 is a result of \u0060PartialEq\u0060 not being implemented for different \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":"tests/core/conversion.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f75497201e12429bb319035ffc044be7de8aa3af6be744267173f57ac86376"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: move this to alga ? \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":"tests/core/matrix.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"7387fba09e77edae5a406cdbe6beb87bc19ec73cbbbb2bda4f252048ca4a27f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - implement those comparisons \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":"tests/core/matrix.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3e1881ba8a3e67fc5071b82e47e260abf3adc7de1a9140bdec33651da61299"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace the * by the latest version. \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":"src/lib.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46ade088a96c43ff78d9e94aefb4dc7fc53bae439ca42ef57b605d6b45d9dc0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: deny this globally once bytecheck stops generating unused results. \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":"src/lib.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87773b1f2d8e45b957533dd166db672bbc634eecb094df4fddc6ff7179a588f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX:\u00A0this is very naive and could probably be optimized for specific types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9a4ae6d18645f696d588e51f7f81d77d52bbaf60f78f54372537d094bfefcb"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: also, we might just want to use divisions, but assuming \u0060val\u0060 is usually not far from \u0060min\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":"src/lib.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d001bf65b8642fb37bbaaf52da769b91fc96638579f7f3c488a9cbe311c19a53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this structure exists for now only because impl trait \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":"src/sparse/cs_matrix.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd7c174d66f05f4cf806528b20657774704745b193b4a688ecf5d9c6dce560d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: store only the nonzero pattern instead. \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":"src/sparse/cs_matrix_cholesky.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b359ce2387b42112fe7576256e12c6467364096c1121c0331d1e5792af8575"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid all those allocations. \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":"src/sparse/cs_matrix_cholesky.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"de60f178ad1089a0b8b9afc9d3735bd09fd4c2e4bef0bfaa627570cddf2ab014"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid all those allocations. \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":"nalgebra-sparse/src/factorization/cholesky.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6c9a7b854593047e29bfef5d8e3bcc61451cdc3890ae1c767faa15bc7fdd79"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: avoid this transpose. \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":"src/sparse/cs_matrix_cholesky.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc8f66fe945d662c8bc5360bd8c895c1cd124770d5e8105e64b574bb2dd597e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid all those allocations? \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":"src/sparse/cs_matrix_cholesky.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2cc68ee411a9c51bc3282026193a3aa562ef8906649a363abd0471d53fcea1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid heap allocation for fixed-size matrices. \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":"src/proptest/mod.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bf603dcf958a892d303fcf40e2b5163a2754eb1b57d3f3958082402cc42cc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Custom implementation of value tree for better shrinking behavior. \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":"src/proptest/mod.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"3792abcb4fe71cdf08ff81e13123c53060944163161167b0096baf59343353d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: perhaps we should pack the axes into different vectors so that axes for \u0060v_t\u0060 are \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":"src/linalg/bidiagonal.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cc8faee9b2def2478c26408bddb062bd1ef171ac34a7b2b6279f9c5410ed1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize by calling a reallocator. \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":"src/linalg/bidiagonal.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"37206cb0977859ecd612b35e3c0a4b3479aabe47afca283410372caf0db5e58a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: code duplication with householder::assemble_q. \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":"src/linalg/bidiagonal.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d75852fa7fc488a868670391ffbc16c5235a9ba8a68cceec2d4d87751ddc186"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //     // TODO: duplicate code from the \u0060solve\u0060 module. \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":"src/linalg/bidiagonal.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"521acd9dd07b4e851d0b2dd7a4b57fecd41d2a428341431b6615fd33e1e995f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //         // TODO: is there a less naive method ? \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":"src/linalg/bidiagonal.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9ffbc0de60bd118e4cc99eced2c365fd762178df32d86b428b08b0193c39bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: would it be worth it to avoid the zero-initialization? \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":"src/linalg/cholesky.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0301e45045efc4d2ddf9f204d6514b257114c20a939a6474319c5e162777ed89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: would it be worth it to avoid this zero initialization? \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":"src/linalg/cholesky.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"5760bd98ac2008b1d5ed9cd4837262e09efb6f503cecfe0c39c5eebca90f86e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: sometimes, the axis might have a zero magnitude. \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":"src/linalg/col_piv_qr.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89cadb1ed9b91d80a4d036e3783a0933ac47f0d40f03eadcc63818a21ef56ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: sometimes, the axis might have a zero magnitude. \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":"src/linalg/qr.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f5c51ef13b509ac579fb50ece8ef7c09403f42cd2a54d04c6a72c390474f76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: duplicate code from the \u0060solve\u0060 module. \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":"src/linalg/col_piv_qr.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca82b3101f045e8d01ab5457fd1c701ac93587c90e07cf99256dc00c233f6ccc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: duplicate code from the \u0060solve\u0060 module. \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":"src/linalg/qr.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"bceb7aa5c7ac1e6f098b75a2b2408bc20ee942c90163eb6e42f412ff15f128e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is there a less naive method ? \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":"src/linalg/col_piv_qr.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8a098bcafc72d09f93e23a67759d19bff67b7714adb877074eb587cede5e51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is there a less naive method ? \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":"src/linalg/qr.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0b6499ed5bbcaa5d0af6210783a7ccfa3dfba67b40b134dd6fcc8837aa31ab"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: for debug \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":"src/linalg/eigen.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"af84fd2dcfdd946af30b1cff46917471c49f2fe6fe674aa94a1d83ecdd9c5100"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a better place for this array? \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":"src/linalg/exp.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaee8724100c6f480d856b6957f65afda8c66dc378cbf74bcdf8a1cb80e870e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can we optimize that to iterate on one column at a time ? \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":"src/linalg/givens.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"580fcce479835052693204ff5d1d19c899cc89a50d7a67d9c7fd692eb9ec6411"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add a h that moves out of self. \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":"src/linalg/hessenberg.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2848bb7c8ab1bd756abc354aef767e2bbd38094a375c38fe3289d6a036107ee1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: not sure why we don\u0027t have a - sign 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":"src/linalg/householder.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bb2f5bc0ab07de729a2ac49e550707427101efcd919344b937f9bd85b71904"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should not be needed. However, the exp uses \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":"src/linalg/mod.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca44afc6b602fe41b2e0ee45404d1ea9193aa238170aeeae0ffa76bcceef6f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Not complete enough for publishing. \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":"src/linalg/mod.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade2b693b6e800658d5aa925131900fa2f4e3cec48a95755f1ba2d36342c476e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: using a uninitialized matrix would save some computation, but \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":"src/linalg/permutation_sequence.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"21489ab3b3578be9f5b5956aa7224a628bdfd870f893598c1d7f270f86a0217b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do we need a static constraint on the number of rows of rhs? \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":"src/linalg/qr.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"647eeb1e07ba936f720c37fb2d9c289be224a50a0d5be88391cc4555a06aadd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could we work without unpacking? Using only the internal representation 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":"src/linalg/schur.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fec1fc498e3553a3de6b8953beb790a8bb55d41a6e0cd796ae7f0b35f1cb148"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: we have to build the matrix manually because \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":"src/linalg/schur.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a77de488400e9837be1253251c6a5702aec4670ec871d6b5e15f24f4ef047fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can we avoid this slicing \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":"src/linalg/schur.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4c119f51b85b2ff7bd8b1c2a3604ceb8487aedd45882ed0f9b3eb2c52b1fab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add balancing? \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":"src/linalg/schur.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f29c6e8504621dbe6eeaad70ccb2eff26ab13d8edb47599d5b0a1bd84d63233"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add balancing? \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":"src/linalg/schur.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"053f43de208ed395021fb5fcb59ef95018f49a1a62c08d8d14a82af7943400c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add the same but for solving upper-triangular. \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":"src/linalg/solve.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4474e7163b6fe85e25167919be7f6ead11b0cdbe0fa02b505cc41c519b2ef5c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add the same but for solving upper-triangular. \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":"src/linalg/solve.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"0630497190331b95371632676b614a9fe487f3e1aaaeb92670eedb321ca92605"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: does the case \u0060v.y == 0\u0060 ever happen? \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":"src/linalg/svd.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a18df6ced16aa52e56877ecbc59ffc870f0c36072858ee3d09ca01b62b5ea1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: write a test that enters this case. \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":"src/linalg/svd.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e2d4f4d156138eaf24a09078c557965b7d993659ff615fce1b401a8dc7bcf2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this more generic wrt the storage types and the dimensions for \u0060b\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":"src/linalg/svd.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2b2fb7ed79f01feb4bdb5cfa73e4f1df7d87c4823511ddd9508fe626093883"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: return an Error instead of an Option. \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":"src/io/matrix_market.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"563d67bd0c90566cb398160eaad4d1f7340876de994b65080dd56acbe687bbb2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: return an Error instead of an Option. \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":"src/io/matrix_market.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1d0a7ccc8f3d6b8c2f9dbecc7778694cf6034290d796d9762cfe86cbdd5789"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: return an Err instead. \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":"src/io/matrix_market.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d69f786f01813c9a08c0882dadeea97cd864f474810d8609f9528aa6f2c32e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: take the isometry by-move instead of cloning it. \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":"src/geometry/dual_quaternion_construction.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f94ffaccb0c14cf7484c281aea75b0c0d64f9dc5410fd6e23419188d40d2eec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:\u00A0can we avoid the conversion to a rotation matrix? \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":"src/geometry/dual_quaternion_ops.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44f470bb76bdcd55598a4b4ba6f032f5df63500f16f99404d7d9d3215642ce1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:\u00A0can we avoid the conversion to a rotation matrix? \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":"src/geometry/quaternion_ops.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a56d6c8f304c62bee7f200d18f1c47a1c8dd3f046ecf0047a20ef5c9c7f020"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can we avoid the conversion from a rotation matrix? \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":"src/geometry/dual_quaternion_ops.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"97207fe0e432a5e722f15c96f9ff248ef05ef224fc3ff85ac010f7e6f244773a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can we avoid the conversion from a rotation matrix? \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":"src/geometry/quaternion_ops.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a3cd1ff8bfe617b0cf52ac9472ec21cc0fec1c8e0ebc672654795402f7109f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can we avoid the conversion from a rotation matrix? \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":"src/geometry/quaternion_ops.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9047c41c844cfeb357eec24f1fc8ad5702e7c3f0846cf319d35f1ea069949f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there are several cloning of rotations that we could probably get rid of (but we didn\u0027t \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":"src/geometry/isometry_ops.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"be554383e310d3d050ad5e4fafe339fa816678ca95a85b3e02284936b6fb234d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there are several cloning of rotations that we could probably get rid of (but we didn\u0027t \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":"src/geometry/similarity_ops.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b7c1957aca7c8d9ba5f3e90da78c2474370ba44af68854657fa6ece95ba149"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: too bad we have to clone. \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":"src/geometry/isometry_ops.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ea48c57667df210cdaf925dc1d9803643ce390ecb60b8a185239fcb87d8389"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t invert explicitly? \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":"src/geometry/isometry_ops.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"435ff4aa9885caa79aa2f3b49023264c1a51dc3ea72f7e3745bfbe89e8b90b1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t invert explicitly? \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":"src/geometry/isometry_ops.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f25b55a7eeb984a8beadec89eea9ee5a01993225002970d69805ee551c53904"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t invert explicitly? \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":"src/geometry/isometry_ops.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd45dd1193f6669a9dff9925f205e3dc959826933b55d22b0a8eaef75fecdd95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t invert explicitly? \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":"src/geometry/similarity_ops.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a5727ff4a92d295471206fc4e08f9aa8161d44ff53cc0349d450978ae082d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t invert explicitly? \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":"src/geometry/similarity_ops.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1b277e638725645483e8e2b5913286f9e81a0ea9452dd1aa7ce3bf447fff4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t invert explicitly? \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":"src/geometry/similarity_ops.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df848e95dfa266def7d0575044f882732edf44b2e6625c1b09921a059127c36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: because of \u0060transform_vector\u0060, we cant use a generic storage type for the rhs vector, \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":"src/geometry/isometry_ops.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d535665d9e55cfeec779784d2478d75334f2b57e2b231f48fc87377d121c15ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: because of \u0060transform_vector\u0060, we cant use a generic storage type for the rhs vector, \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":"src/geometry/isometry_ops.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ab5a4820630b6cc383056b8bae974546120d4c47d3715e4d75394d3ef6190e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t call inverse explicitly? \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":"src/geometry/isometry_ops.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0768daddff1b7b3f934f5d3408b218cf32ccceb78d71b7901404a4538fe7fa6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t call inverse explicitly? \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":"src/geometry/isometry_ops.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f5b0a2c0003dc02a6bdd9bc6e8ddc9ca0ae6f86bcb2acbcb4c918b2fac35fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t call inverse explicitly? \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":"src/geometry/similarity_ops.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"0592196ac09541e82394cb8231c55b8969337baee5cc2a744a3370869046df53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t call inverse explicitly? \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":"src/geometry/similarity_ops.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"6746c3ef25f0f3674227d120aa286e54fff98da8aee16cebc411ba804bd57177"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement Rotation methods. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/mod.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d038507c4c98ba562a6d5aeea0e26281cf4e1ba83770b03ab695348b79f01d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: merge with \u0060md_impl\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":"src/geometry/op_macros.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"42634a142d4a339c94d14e81939495669c82945accd65e46f78a460d62e525b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: merge with \u0060as_impl\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":"src/geometry/op_macros.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"066c369c829941cb82929ebb236a5d90b2325fd0972d89f8474a27031460f5d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: merge with \u0060md_assign_impl\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":"src/geometry/op_macros.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0ad38c6bdf822f03c56e0d5e74c96e71201a624d984f25cec00d4776e45c78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when we get specialization, specialize the Mul impl instead. \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":"src/geometry/orthographic.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6b9de7e2f44e1b5bda2f667b80b7f2da3b7b88b0d8cb48ce7520c6bcf14919"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when we get specialization, specialize the Mul impl instead. \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":"src/geometry/orthographic.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"3249a77dcfc2b299dbc26b820d4c73bcade4686fdb4b3b39e2f2b87dba4149fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when we get specialization, specialize the Mul impl instead. \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":"src/geometry/perspective.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e3bae539e702dbc674f16b2bdf4843b0ba50fba15cb9fec243640f7799d34f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: when we get specialization, specialize the Mul impl instead. \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":"src/geometry/perspective.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc126f6f4bbceeef067036edda8a71c8b18e821977c8363dde7d8ec878d8e25f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add a method to retrieve znear and zfar simultaneously? \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":"src/geometry/perspective.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7409f86f50c52fb25f6bf5d07339cee55097ebd9661c588977222784d2addd7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is mostly a copy-past from Vector::push. \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":"src/geometry/point.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"062d11188ca45bc8be22d73f61d1e5fe15c12c37c52c0738e5b094b784c06138"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is there a way to reuse the \u0060.is_in_subset\u0060 from the matrix implementation 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":"src/geometry/point_conversion.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f191ce8e9bf741c8808c1f893b382a6b60d496123f397827218564d614bac44"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: replace by the shared macro: add_sub_assign_impl? \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":"src/geometry/point_ops.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"131d9d64f5852f1df4d31a16bdc55803be14bda6b8335b8f6e07132e21b8a84d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: would it be useful performance-wise not to call inverse explicitly (i-e. implement \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":"src/geometry/quaternion.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"159e0c360c7dc2629b398b3df1241473a12a535aa661373b1eae5a566b87fcc3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: would it be useful performance-wise not to call inverse explicitly (i-e. implement \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":"src/geometry/unit_complex.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f3cf4ea36e91bc6412fc8bb5c27b088c5923e8df82191e2ef021ceb3f2ffe3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: take a reference to \u0060vector\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":"src/geometry/quaternion_construction.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6ac5ba1930c96d86103f3facca80c1df49e0f3e130e43e91e1bcf1d8f83175"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: merge with the previous block. \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":"src/geometry/quaternion_construction.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a3264f2b27562060309d12d8929db16d25a03a8692bd35089d6dd5fd7e9b07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: take a reference to \u0060axis\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":"src/geometry/quaternion_construction.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc548aad306e11792ff63a5ddb2816ff14698e2a24bbc36c585e18168e68966"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: code duplication with Rotation. \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":"src/geometry/quaternion_construction.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"9372bcb8840e5abe391e347230771064247235c914c5bd12b15f881117cae077"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: code duplication with Rotation. \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":"src/geometry/quaternion_construction.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad998ec7aef5da064d3f4f4faa9cdfda3a79ed142dd3b1f098aa2c478900ea9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: code duplication with Rotation. \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":"src/geometry/rotation_specialization.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d6e249c8ebd08e3358815436dc475c30de2d22c54410758f1ca8ee18d24ae6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: code duplication with Rotation. \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":"src/geometry/unit_complex_construction.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c7731ec8f36a4a26591447ffb8cc1eda6eb60ef70dc3fec3fa3863531d7a8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:\u00A0can we avoid the conversion from a rotation matrix? \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":"src/geometry/quaternion_ops.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27a88ff150eb9ad9c49aa7ef486f3b9d1c5b7c10cc2dab6231f0d2b2d1cddab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: will this be optimized away? \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":"src/geometry/quaternion_ops.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b2a3db40c446e1e054c6116d8cbd4885b4f445d1ecf2aae6e24797de6acfdd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: naming convention: reflect_to, reflect_assign ? \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":"src/geometry/reflection.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e4ff3684ffa9b559a56a8b8ef31c2778fc2c9811f61617f3f16ce42918ca9d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: naming convention: reflect_to, reflect_assign ? \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":"src/geometry/reflection.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"208f65d15ccbe4f8f1c44833b75dab6cee9e29005244bb7c638330dbadb84324"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: instead of calling inverse explicitly, could we just add a \u0060mul_tr\u0060 or \u0060mul_inv\u0060 method? \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":"src/geometry/rotation_ops.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c5752238f9711a4512fff8246eb276d2575bfd9828dd2b9f99b60d7dde42fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: instead of calling inverse explicitly, could we just add a \u0060mul_tr\u0060 or \u0060mul_inv\u0060 method? \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":"src/geometry/translation_ops.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63839805d09c8fa158ff066b78dc1a130dc84808216d1bd9af1182f553fcaaa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we don\u0027t handle properly non-zero origins here. Do we want this to be the intended \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":"src/geometry/rotation_ops.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a0cc2dc159dca5eea9f34a7f78a3fe161cb1580df86a3a691747b2ec8b98f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we don\u0027t handle properly non-zero origins here. Do we want this to be the intended \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":"src/geometry/translation_ops.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddf7df454f443f6e46af5d879937addf164ff3942c45e72a78d7f70b584a07a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: try not to call \u0060inverse()\u0060 explicitly. \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":"src/geometry/rotation_ops.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a06545bf5cb94eac9517d1ac44a88e704a38400b79b507e64cf9cbfa8e80f77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: try not to call \u0060inverse()\u0060 explicitly. \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":"src/geometry/rotation_ops.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d928e6957c35cea321e7e70c96f7b1454dfe3fb6cd4b81a9799fb276f4df024"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this shares the same limitations as for the current impl. of MulAssign for matrices. \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":"src/geometry/rotation_ops.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"81da8b5be2addc698b6f1d5315ce36f00f9794e19f1edb32bd59bc76870f4027"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use self.vector.push() instead. We can\u2019t right now because \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":"src/geometry/scale.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fe3df153e101e1373c9c492a4b8006f72a33713cd79fff70cdd1322343e1da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could we avoid explicit the computation of the determinant? \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":"src/geometry/similarity_conversion.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8633384171f8c10c080f7d2a94bcff8a6446c061f2750dd6b302605cedcb2678"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could we avoid the explicit computation of the determinant? \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":"src/geometry/similarity_conversion.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2283bdb609e096475b6adcfc55de438b052e9695c2dbcad6753cf00089ffd9d3"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: code duplication: those macros are the same as for the isometry. \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":"src/geometry/similarity_ops.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a371d8a352e46cb79f39eb73ce85636404a82e28c1f0a8ad4a30d06c4c0aa18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t invert explicitly. \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":"src/geometry/similarity_ops.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4922e73091f0c9920ca308db38a4f222fb5b3b62153c279c36291efcb9d5bdfc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t invert explicitly. \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":"src/geometry/similarity_ops.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e04f3aec0a022415671f1aaebdbb0af7568d974379c274207b10dbc5605a83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: specialize for TAffine? \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":"src/geometry/transform.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e294f9f34778184edea4426607b482d55d4ff563776e769d0fe00142d6075ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: deprecate this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/unit_complex_construction.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9652dea05a6b7770b8d92a657310018070dbc68dd48c7caf6008fa2d95fc1a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add UnitComplex::from(...) instead? \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":"src/geometry/unit_complex_construction.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"227ec21d722a8d74ebd5258accea07f69f6e6054f160d5cd26e3fb292155e96f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Bad name. \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":"src/base/allocator.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"273df09d61ce385848417d7b0a75efa5ec0eb2219eced0e7df1c60645afc11a7"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Bad name. \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":"src/base/allocator.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"14574d95d409851cdcdb0f8602c706708a2e4f000a162bb097163f4a3cdc50c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once the stdlib implements Default for arrays. \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":"src/base/array_storage.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c210c75d158908e864b4372ca79ece10a21e5ac443cdb06aad0cd894cf10e407"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: open an issue for serde so that it allows the serialization/deserialization of all arrays? \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":"src/base/array_storage.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b214f356a149c47c22668f20bb5123f464c6480dd0a42cc26b2137a9ed93d14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid bound checks. \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":"src/base/blas.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b3ede0c3eb752b11999259471764b37bae29a68fe848625581a9615455cf25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid bound checks. \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":"src/base/blas.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea4d9984085b4486c89334f44a46f2fe15d9b01c09fe8633bdcad4df0da0b2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid bound checks. \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":"src/base/blas.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"14737bb9b713a6774495f97d81e21e61689162ae1014c028cfb2cbc629510d95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid bound checks. \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":"src/base/blas.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"1beb98b2d02ad5ae7053940173e817cde813dcad471669dda7b8f9713a708163"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid bound checks. \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":"src/base/blas.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb25b991b42b3526bc8371c76f902331785416edf4e530a295177a0da01c22c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid bound checks. \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":"src/base/blas_uninit.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba91d334f6f4d97e5efeafb6cc54c492b942c171e525155c15e313fa1ab983a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid bound checks. \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":"src/base/blas_uninit.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc983858a7098bddf3b2203060fe50fe7f48b467d5fdad7859e8764bc8b784e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: would it be useful to avoid the zero-initialization of the workspace data? \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":"src/base/blas.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"184edbb7cced0cee196fbe2fa803457d0126a60bab58060cd12a95d3f98d806a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: would it be useful to avoid the zero-initialization of the workspace data? \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":"src/base/blas.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a874248e8ceb62e9aac95cfe3956997fb1f460b42123469fe2d9e0928f1c035"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add other operators like component_ln, component_pow, etc. ? \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":"src/base/componentwise.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7844ea7a57bb12410c54bd0cebbd3018398f9accc462c59d5760c7933f133ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add other operators like bitshift, etc. ? \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":"src/base/componentwise.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af1f2914cb6b6343e9f3e283693526bde61b50dddc77e89e652f75d0fd419ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can this be optimized? \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":"src/base/componentwise.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef688418e8a2b583b4b32871446306c74fd02f037bbf31db6db95044d879c13a"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: we can\u0027t do something like \u0060DimEq\u003CD1\u003E for D2\u0060 because we would require a blanket impl\u2026 \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":"src/base/constraint.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b832e8474ba73c8d34438a8c9b7df94849b9bdc7826d34763789d17aac94fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize that. \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":"src/base/construction.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"637d9fa7e8b113d521ccc59ab0f4ad5ac63e985dd589d67d71f703644c32665b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize that. \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":"src/base/construction.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c668bd272f54e75b79f953c8275bd04e5170a0ddd0440b6637cec5f4de561fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize that. \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":"src/base/edition.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01d349929ec4cee32a3eb65af3f03a08bb685a55127304f52be09014b8ea10a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize that. \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":"src/base/edition.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f8f17a802babfb3c9f83542a21cb14e816e31303e9a33e24d9db0a309d5fa0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize that. \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":"src/base/matrix.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a7c977f5e6f347a08fed350fa3dbecdf3907ccaa5f93c7136bdb78ad7e815b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize that. \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":"src/base/matrix.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"523915ba756544f8ef96624962c452d1587b0f40fbbb8e5ad74422427e184dc0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is not very pretty. We could find a better call syntax. \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":"src/base/construction.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedbf43bde9d4401728d7ef0d105efda3d1fe9579015c70d51a0e5d8df79abec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:\u00A0this is not very pretty. We could find a better call syntax. \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":"src/base/construction.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4d780e4a79d88b564d1e889fe261c4a1501a94660aab8d92092f8c8d95612a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:\u00A0this is not very pretty. We could find a better call syntax. \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":"src/base/construction_view.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f21e25631220fc8ebc5eda00ed886be84d7785e936b3fef4b4ec33348acb0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:\u00A0this is not very pretty. We could find a better call syntax. \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":"src/base/construction_view.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5af1965350843e5003b70ac871eafc9ca581cf9e0d4d4c337aac8b00183e976"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(specialization): faster impls possible for D\u22644 (see rand_distr::{UnitCircle, UnitSphere}) \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":"src/base/construction.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"4295b034ff22e137dc29266ecb5535ea4c7169f26abfac9a77d077cd0466ed41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: too bad this won\u0027t work for slice conversions. \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":"src/base/conversion.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1febf05850c37e4bcb01383e7a014037fedfcfd15de48b58f77fde13c20515aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: unfortunately, we must clone because we can move out of an array. \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":"src/base/conversion.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7a2e41cd0f87ad3b67f734254d99cb4af0925b33635fe860acf26c3f6e8f7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use Const\u003CT\u003E instead of D: DimName? \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":"src/base/dimension.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fe84d7bfa0556b10c662fe29a6ac51d68ecf5cd0b389653d3d5edba7363b7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is not a very idiomatic name. \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":"src/base/dimension.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"140a8cb3029fe6b0aec6f58705997eef16acca8999508e8fc0734d32769f0b2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use unchecked column indexing \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":"src/base/edition.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96ba5f4c11c828bae485d774874a751896113f33d806bdd1306e42b78348216"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is there a more efficient way to avoid the min ? \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":"src/base/edition.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a18c07245b7d63a79a81206653445720b9071c15233e98654141256c9273527"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid the clone. \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":"src/base/edition.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"db99640b5473de8de0bed63ec3ab6d11a22a4092e9317e692c27d4ca78a4d98f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid the clone. \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":"src/base/edition.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f2609c050fbab39ac0243f1ad795dfc1f0257831953500e8cb88fb075bc1dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid the clone. \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":"src/base/edition.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9fe9d9cd11b11cff522dfc48011a40cb2ac9dbffa1689f0f36b8dd56d88398"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the result is wrong when self and rhs are collinear with opposite direction. \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":"src/base/interpolation.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad450042a2efe58a93885c8afc928b65edf64ee3d47cf90d86ae1949c858b75"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: what if s_hang is 0.0 ? The result is not well-defined. \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":"src/base/interpolation.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8cba3091b28a3df315bd2851eb9709d08c47de740bbc77934bac1c3f374b45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we need to specialize for the case where the matrix storage is owned (in which \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":"src/base/iter.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01479833c788eade9302efd80878c79b90e69e9db746e949b25bdd53e4ddce0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider removing/deprecating \u0060from_vec_storage\u0060 once we are able to make \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":"src/base/matrix.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b560570058fc3419b9e34774344e069acb06f4e4b38a464ba0037ce732359a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider removing/deprecating \u0060from_vec_storage\u0060 once we are able to make \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":"src/base/matrix.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a72717fc9da6aa5b7608762a12c994bc45ae7745ff11df24b819763e967d80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider removing/deprecating \u0060from_vec_storage\u0060 once we are able to make \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":"src/base/matrix.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"563ec22b98f14cfdef7a2ae329faa5a4f5d88e97df5e13960d383d78c572aa70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this could probably benefit from specialization. \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":"src/base/matrix.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77cdb7bcad9c7a11d3a07bb2b1c350f52195f506c4ff067a2ddbfad780f562e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: bad name. \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":"src/base/matrix.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"447a97ec8f79b47df50a350c7b5ac96d35f96d73c6f15049947f65909c73e151"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check that those copies are optimized away by the compiler. \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":"src/base/matrix.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3293b0aad867c72547cfc113f725dbbc5412a3b6f5f70a8ed6eebc70b00cc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use copy_from? \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":"src/base/matrix.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cb6c61adda21f8d37b8a98b67295180ecaf912e1a9154087ec76aceadb6f68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: rename \u0060apply\u0060 to \u0060apply_mut\u0060 and \u0060apply_into\u0060 to \u0060apply\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":"src/base/matrix.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02ec52f3497f62b5ebcddb13397ff920101c97ea2468307883398998d4146ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use specialization instead of an assertion. \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":"src/base/matrix.rs"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcd773eb40aeeb8804b8ae2ae9b04fd7b25c8758cd0f56ded0fd98d9b93fc98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: see how much of this overlaps with the general indexing \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":"src/base/matrix_view.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"753de2228b18682d75eef3c5cc67ca0435cba573ec6728c38b6b71e550e03a7c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: see how much of this overlaps with the general indexing \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":"src/base/matrix_view.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"88909fb0e8ac8883c701b0fc3ea0d503561a73a535eedad403df3aa29fa19644"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Arbitrary strides? \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":"src/base/matrix_view.rs"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"192ed03a416c2cbf7357d0d02434a51a7863c949e722c3a8a2f6f658cbe7d778"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Arbitrary strides? \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":"src/base/matrix_view.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"60196567da657b0ffd0002de207543c40df37eb671b78c5aaa22d244d1feb244"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a way to avoid code duplication just for complex number support. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/min_max.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe64ff764861b1e7fa6c184791b161585ce278ce6d792e880195c33db1e47bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should be be a trait on alga? \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":"src/base/norm.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d32946e600114df76fc8b565c1cf8614495e491afad1f179e2ec30436099ecc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: specialization will greatly simplify this implementation in the future. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/norm.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d030ddf0c05c003b4e0a1ca716ff2cbf360dd43da39674d490241da4cca794"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this will be efficient on dynamically-allocated vectors but for \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":"src/base/norm.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd27e29f79553521e433c64a1d068ded71abeefea6d061fdaadb080745c459d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: return an iterator instead when \u0060-\u003E impl Iterator\u0060 will be supported by Rust. \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":"src/base/norm.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd02e2fe9a0126b8a08d48fb482fe3821bda08f01f5c78da79cfd0adcf532d1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is this necessary? \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":"src/base/norm.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ce68e720ae64aa8ce73e4a8f020f3defe2c001680959bf62b1de75d5a9cf13"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: use a GenericArray instead. \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":"src/base/norm.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a930f66d783fdede2a4a9c7514b879732d4292934a3e87ff4dbf13f1d56d386"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use specialization instead? \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":"src/base/ops.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fb65448479604c7a96bc4712de0260709b4249c6a47d9ab4152dff679c8b11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use specialization instead? \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":"src/base/ops.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd499ae970dcb89555a43ef4a70b724793ea666d006e5896fae0eca2df02e2b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use specialization instead? \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":"src/base/ops.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bfe42bc58033e8ca05c69dc51ffbd9c17eb51d11d7af760e2807d4cd99cbd2"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: optimize our iterator! \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":"src/base/ops.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"38669ba6780438b93869e04708bdfdf37f40f5a610c8ea62095d1de08b772f69"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: optimize our iterator! \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":"src/base/ops.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"607fbd94961816621c9e1d5fd13ab5c8d7eec132c7717f76b4c2e4a2a2d1680f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is too restrictive: \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":"src/base/ops.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cd2603a44a8a754d76a8a011a3139d8bda7ae05dfe56d75fe67a371e31ee5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: get rid of the IsContiguous \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":"src/base/ops.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"00caa2785118d7fc64989b1ac355fe815b87a1df2d684f6847cc789e80190e25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: get rid of the IsContiguous \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":"src/base/ops.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff591f6995f106b9fb10edd79befab911488d877b7c445bb68c892311d612f0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is too restrictive. See comments for the non-ref version. \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":"src/base/ops.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8c5ec24375a9012488d3ade37fe77cdcdb23d500d5ca1f9ba68c9102ab87b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: RelativeEq prevents us from using those methods on integer matrices\u2026 \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":"src/base/properties.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d443bfb8089df45ed513830191a76e9dc9b28a8cec0643d07d4fc33f40ed987"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: improve this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/properties.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6992efde8e797baa60a8dfdb991742c9e5bf263b555d5661124dfc1ad3c995fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid bound checking of column. \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":"src/base/statistics.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd730636a9a622ba9fdd2b2709b95c3fa850ac07896962effe3245d8efbd3769"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid bound checking of column. \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":"src/base/statistics.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"208640e70b19fcde8324a9184e79519862f2b999a343de7a4a695a81bdd1356f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: better name than Owned ? \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":"src/base/storage.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4d8c4a67339416e833d36526b23976fb7e317fa1e18858459fadb7ad4f56e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: doc \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":"src/base/storage.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34ecbbfec6f650b16c9689ce6ebdda2481079fe88ba89693e22f7e72725eace"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use t.assume_init_ref() \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":"src/base/uninit.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5b0dbf4b261e7b78ab7ba2fbaad06e3f2611340c2c53e80c3ac0c81ba2a8cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use t.assume_init_mut() \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":"src/base/uninit.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ac9ce44865dcaea709bc40c789c9d41c2ad7cbfea888819679c2ac296346bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:re-enable this impl when specialization is possible. \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":"src/base/unit.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1788f9f83da23bcb416b809a6d8daa872e6b61709fd59b55515a2ab3837a40"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: will not always work correctly due to rounding errors. \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":"src/base/unit.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae65a68ff68daaa50927abe711960a0069c9952c9682299914ee15ddeb94414"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test \u0022refactor\u0022 \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":"nalgebra-sparse/tests/unit_tests/cholesky.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d8103a96616bd85bffeba232b7afe22e8b63215026df2d2797640ca4e6f452"}},{"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":"nalgebra-sparse/tests/unit_tests/proptest.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ee0d7efbd966fb6eba297ac2bd5c04b5aca313c214ad00104d308e73b6e12a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider giving the iterator a concrete type instead of impl trait...? \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":"nalgebra-sparse/src/coo.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb439dc7b93ff3eb960d6c818a921e372df4a42642a311e2c608f3589d55330"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider giving the iterator a concrete type instead of impl trait...? \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":"nalgebra-sparse/src/coo.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab50e54c8fa92ebeef7f744975ab5d23ad4deee9cfecd68632c778b0ee25579"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid checks 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":"nalgebra-sparse/src/cs.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"67237f505326fe425e6b36d5ce3c6e0f38a5a310d61944866a1db4f501d0bdf1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This might be faster with a binary search for each diagonal entry \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":"nalgebra-sparse/src/cs.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a995148dadbca82d25ef5eaaa00b2584868d5aa34c2bbc74005fe311113413a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should skip checks 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":"nalgebra-sparse/src/cs.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1064e24d27c8b8f348deb9166884fe5d5110c9df7e81e06c5bae61aff64b9ee3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This doesn\u0027t belong 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":"nalgebra-sparse/src/cs.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6e926f6364383c5ad68acea5b8cdee3152431371156f09ddb3322175055df4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make SparsityPattern parametrized by index type \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":"nalgebra-sparse/src/pattern.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e78e0cc11f4f135f507c157c797b573de3d7740c2e1abb3dd31f7245f81499c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Skip checks \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":"nalgebra-sparse/src/pattern.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd2949ecb90a8157d364c7652a34454cdd8071911c1919bd02061c1c97e4a40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is inefficient. Ideally we\u0027d have a method that would let us \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":"nalgebra-sparse/src/ops/impl_std_ops.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8c306c3adcdee0973237c8ec520c760be826ce26e2d30e6ed35946537997bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is it possible to simplify these bounds? \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":"nalgebra-sparse/src/ops/impl_std_ops.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04f266c7ae4641b43b40ab0a6814a6eed98b000e047ae3efe33da22b2e7d0b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use exponential search instead of linear search. \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":"nalgebra-sparse/src/ops/serial/cs.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bba9ef4085ba70dced1b67721773fda368b6d9ea81470eefb3d6155ad03631c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can use exponential search here to quickly skip entries \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":"nalgebra-sparse/src/ops/serial/csc.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb27bd18a308725dd2373798727bc3a026b542ca21e6abbca63202d96b786c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can use exponential search here to quickly skip entries \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":"nalgebra-sparse/src/ops/serial/csc.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8df9f74dd78596af3a7cabfb2cfcef69f4ffb1fdc35435984e916fc00fe0b3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider circumventing format checks? (requires unsafe, should benchmark first) \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":"nalgebra-sparse/src/ops/serial/pattern.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"919cb5381c4e36ed3d3eee5bdff2aebe1184683edddf7e171bb0a325f56cac73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider using a bitvec or similar here to reduce pressure on memory \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":"nalgebra-sparse/src/ops/serial/pattern.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cb6bcd08e3c47a49344bec173281e1fd4f2dbae1f5f0cc40b46d4bfae29201"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should probably implement PartialEq/Eq, but in that case we\u0027d probably need a \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":"nalgebra-sparse/src/factorization/cholesky.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4980a23665cd01ee8dac18a7f000bb775aa99ea65702620102425c049940d0f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Improve error message \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":"nalgebra-sparse/src/factorization/cholesky.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd21ce3c2db3e150d195dcaed2f8665bf89733384ea6d615226f32e1247121a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid this transpose? \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":"nalgebra-sparse/src/factorization/cholesky.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a870ec9037ff601f9d1fbc9f7b9fd69ac888727fb35206a36b0df0d7aa6a6db8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid \u0022try_from\u0022 since it validates the data? (requires unsafe, should benchmark \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":"nalgebra-sparse/src/convert/serial.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"022c453fbcb10821233d1ad40f9733b2772aa649363c156e0aaa563c3b07d545"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid \u0022try_from\u0022 since it validates the data? (requires unsafe, should benchmark \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":"nalgebra-sparse/src/convert/serial.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dc0ca8f44029afdf704ed35c16dd317113b366129141cab3af568f430ec4f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider circumventing the data validity check 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":"nalgebra-sparse/src/convert/serial.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca58d42bee58f495284bea7cf826dbebc90385067ff3757902dc629ee7d39afe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider circumventing the data validity check 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":"nalgebra-sparse/src/convert/serial.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8046be594128fa29eadaed7a78a4fbe6d90ed5ce891dd9ab7fecae377ba574f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid data validity check? \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":"nalgebra-sparse/src/convert/serial.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec695e1616c0e15f807107f69251ae814ea26b7408daa00243072cdff16a3a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Avoid data validity check? \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":"nalgebra-sparse/src/convert/serial.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c731b37994adc91daa23f8d0ea69dd853027904336ad19ac3de8bbc7e584de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If input is sorted and/or without duplicates, we can avoid additional allocations \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":"nalgebra-sparse/src/convert/serial.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2444ba268862118aecea260badf41532fe47428a6a6f74f9ee8a394a5c50827a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Instead of allocating a whole new vector storing the current counts, \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":"nalgebra-sparse/src/convert/serial.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d3134d8bc7eb8fb2db78bd9567a3704fc4c57e91f40f937dcf723c3b178ac3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //  TODO: Use quote_spanned instead?? \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":"nalgebra-macros/src/matrix_vector_impl.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d6fe4ba7417dd2a92e3d9c0225f5768d5175b2c3715f3a65b3a404eac2fd22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //  TODO: Use quote_spanned instead?? \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":"nalgebra-macros/src/matrix_vector_impl.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d567ca574d23604a644218ec89566289a978e0b5566527fc76a4a1a3548c38d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test the complex case too. \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":"nalgebra-lapack/tests/linalg/real_eigensystem.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fbc3959274542c0654762ac0af6806b0b4ac60c82519452ea90915a21dbcc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test the complex case too. \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":"nalgebra-lapack/tests/linalg/real_eigensystem.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6a19403c26c6e89c92902ee82c13474b5b17e17b2ca32e0086d22dcca9e336"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check symmetry as well? \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":"nalgebra-lapack/src/cholesky.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a7ee1a57b36820ac411f4af2763c8fc3404e7a324628605dfe8dc1530b02c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: avoid the initialization? \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":"nalgebra-lapack/src/eigen.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c36693ffc778307fa7248ac0e2729e84d5bcabcc6102c55b4d7f5fc08893748"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Tap into the workspace. \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":"nalgebra-lapack/src/eigen.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"78feeb9e8da77b9eb5dd2a27fa831c061c24a91db4a1330676aad6d29219497c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //// TODO: decomposition of complex matrix and matrices with complex eigenvalues. \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":"nalgebra-lapack/src/eigen.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60be0829b1dc39bae3ac5d8d66fa13ef915700dcae77cc3f71490a153d34aa6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: return a richer error. \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":"nalgebra-lapack/src/lapack_check.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d70d6c8e18b3e8ae68a12b1c8febe1c1620b15b2fad75a1e2fcceebbea30f55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO:\u00A0when we support resizing a matrix, we could add unwrap_u/unwrap_l that would \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":"nalgebra-lapack/src/lu.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c9178ab106ae6113bf4842a734008afd33cf8f807a26bab6c2126f0534c6cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should be OMatrix\u003CT, R, DimMinimum\u003CR, C\u003E\u003E \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":"nalgebra-lapack/src/svd.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6100c6170408aa7bcd00fd0a5c6cf7d3b9bc67a8ebdf606e9a13052c00862864"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should be OMatrix\u003CT, DimMinimum\u003CR, C\u003E, C\u003E \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":"nalgebra-lapack/src/svd.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"842130e040763ad89d7b5bccb625e245ac12014f396d2d0366394c9fc8e07137"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: All those bounds\u2026 \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":"nalgebra-lapack/src/svd.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd413ca903d15075735a524ba472c3c36be0490ff9c791f3ff6149f4cd3dcdcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add methods to retrieve the null-space and column-space? (Respectively \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":"nalgebra-lapack/src/svd.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e2a79b24ee0df23067180bdd2b6246c387558d44d6b6cbd4201b63f3fd8adc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //// TODO: should be implemented for TVec/TMat? \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":"nalgebra-glm/src/common.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8eee2122d9e77582932968c6c96f901a726991520b2382210666c336fd85a7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //// TODO: should be implemented for TVec/TMat? \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":"nalgebra-glm/src/common.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"392b93df151f459f70d84b59ea656714c1862898f10619c9640e6d25c321e394"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //    // TODO: use an actual FMA \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":"nalgebra-glm/src/common.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb187efbc16ecfc113324196b2001111b2bde3c989d5dfe63f1fdddb0f55421"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //    // TODO: is there a better approach? \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":"nalgebra-glm/src/common.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b3bae9bd21d8ac96d0a7396eaea33437d483ed74773fad8f5456eddd220dc3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //    // TODO: is there a better approach? \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":"nalgebra-glm/src/common.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4705ba994838e3a0fb42c12e807e64bc434eb974621ac953961306c2311d64"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: improve those. \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":"nalgebra-glm/src/gtx/normalize_dot.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"416c3b125f0df4bd2047138637a44ce061a2d67fd920efd3fa8923d719fef76f"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: improve those. \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":"nalgebra-glm/src/gtx/normalize_dot.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8aee1eed3b33e53c37d53111aacd07465a4916f6389d99fc150ca0b03df9156"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there should be a crate::sqrt_2() on the RealNumber trait. \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":"nalgebra-glm/src/gtc/constants.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2d4fee57816ea4c94520d6cd96ef0847eb7f2c5c8d75d9ae5af3d540cabd55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should be optimized. \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":"nalgebra-glm/src/gtc/matrix_inverse.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9eb8d24962cae44758cd9a9ac43894ffefb8803e00fbf56b4dcd8ac2dea744"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtc/quaternion.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f278a644a2ece0c817d1ef258829ccb8d0ace098c51bf7f19e7922a935d4650e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtc/quaternion.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa21ba0ec498629bab6cf8705fdd0cdee82fcae501444eb13420370229619b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtc/quaternion.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"43520b9b9c37d26a32af73d3ad409889508789ee20a08de64f11318e601c84b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Breaking change - revert back to proper glm conventions? \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":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ca16d47c88fd6a5813c883cd76fc8f7c607c761587882499e19196116f14b3"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 5 project(s) overshoot their size bounds, lowering Project Cohesion to 6.0/10. The most over is \u0060(repository root)\u0060 (46609 LoC, 162 module-visible types across 8 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e623b7fa5776b8a84dacaeb050d8f1bd663860410102888abebc1ce034c195a8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fc1f8b65692ff78b874b3e036099fb845500bb886890296d12101435aacf83b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5788d741f3d0287efc056a5097b250bfd2385934146f4ff712dc4ab8fe13ce0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5a8b5118bb9c7931875db974b76117a8e949c807d11a2751a9eaa6467d7c3b9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04964ed5f61e88f9bfcf2f3e9b467fb9ecfef1159d92ce3184df278862dc284d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a436d7bf79ee67b460bd8380ee042f20cef0147b0031764778820b4b7628972d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c326e3619de0051640ecfdf0110e3ce2038f994f848ffee5e60d39aadce88c9c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2900c236a61f1644cd859265b855fd7093e869b30d80162cfb967b6f5132e292"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e283a4acf7bafafa156076bbf32eec8202616ec54e8dbbbfcf941b73e7b6cb5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55721815df810d0ed091d1951627e3efd8de31fce60f50b57702a4047b939635"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"001ba7f9256518e59a26caa8f8e912e843c11184d1f9bfc6b970b9d24dc17232"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7442ad017bec2776b3e2c37ec71c5b7b877e3a34c6c3d5b1b9d388a3489b45d4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4878cf90b468e332089168050b07943f2bdc9dcfcc9eb22d7cbd0fd1739ae42a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e18d23ab5e32350560aca2fafa052ebfedc99a14a46f660f42fb232e839ec6e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2df754a97e8785cbf12b5c6b9b93f9bb5a44ecd343346575c080c33175fd83fe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0821086e214a5bc0c568078cec7471729793622c0a20b76cc65ba129a4e5483"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6cb0e9bf77dd2e58eb7718057b3a6c40bd2f0eec5316e22be5a1e8a77e640225"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"465a7d100870d55956f01c44bfdfc69d0585842568d6c1bc02ba9766e3dd8961"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D34","level":"note","message":{"text":"Concentrated knowledge decay: 170 of 172 significant files have no living knowledge, while the repository is still being changed at a low rate (1 commit(s) in the last 90 days) \u2014 so this is one repo-wide knowledge-decay state, not 170 separate risks. Counted over 172 of the 261 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"008bd8d3156a7f5206da709f59f1f87af76671c6b9becea72c8c9cffbcbd4f8e"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca20595e38b86a99b82d3649c6e19a4e3bbc2034066f9d99cc5a635c1479553"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/io/matrix_market.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d93e62666be991519ca0bd5b9bcca6e38d7a29d9fc0b4fb9f3675af79a20e1"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/quaternion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79aa2fc47d45ce782c01654497f593bf4e667c40060c10618060b84c4fa6892"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/edition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"658e2a9e38313ff1db797eb42a7f31caf9c119a9d0cbd664a067e80ecde5d6df"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/matrix_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a331397934d2b9a48aa76d4829e5fe0839e3248824adbee34cea78ee304eef35"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/construction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daf111d5af214d476272a295541851f47ee1bff7199ae78525ae6baf7bc19e7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/blas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15900df839d2050604f43bb95a7f7d3ccfa48f9590daa31ddfd66d11ff98458"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/alias_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a936a97c37623b513cf9cc9c6e934e016a9d8a8d71230f2a01a98f19a9e97dd7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/rotation_specialization.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f2e37c12385ddc6980dd26e1ab3c036156eea0a2ac60a2696235a806e3d6ca"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/alias_slice.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"272fd75f2e35c9b9a97579b61ff440b44aac521912b6c1aba8bb880dc23ecd9f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/dual_quaternion_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4575d9bc6785d9797456c84e50014ab1407e57269dd58445ab13af3590175db"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/dual_quaternion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf28d07893b4e4af75ecbbb64b1f639c23704e344ce53f70cf7884b1fe61c0f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/svd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb20beb3391db8579a9f5f6d3be78657bab225dcc07ff79f6922b2983aa98ffc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/quaternion_construction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93168e68720d7d5f853c04a2db708ac5e5daf3efbc85e23a10b9139f2be772c7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/transform_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aa7f868fb64f648f121d2247a005542525fe0f83663e60410e25d09f9d5993"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"750982bf182a3a674cb6bc9400e799d3f6739297acec151dd13f65c8e40832ee"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/orthographic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d41bca97c6bab9a696cca97080701c5f10c2bba0745d1b09b0182df6b1d0fcc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_clip_space.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b27582369234e9c8d433fd1e108e55a917d7ca2330ecea85b6b29c916ace7d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e74d7b52678959881ca3f993bacc003f61abf2a2f6b57ef86132b04a01b054"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be922a37e4e95525078d15b9db80fb67b5039a344b468d440f0f29868714104e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/solve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fc99d821e20303afe1b2fb66f62fc0677661888789427755b46d42305c1251"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/cs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b36e0fa4282122c654e77c812c0eabed640621bbe7e924df4d058e2c98c5b1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/norm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"613638973655775c0a049c82bbe452cd595c1488fd97a257551c34269f3e3b3a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/indexing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0948083b06ff54e3e8319a04d491661b5923b9d4bf3108bd47a2dd6d05a56d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/isometry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3be720fcdb4a8f76c4b8c3aa78a33c72a283c6e070e87dcb5ec36663bce1483"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/transform.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de8e220e19646838dec06de092190c4c9bb8114dcf8941ef185e732dd44f771"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/rotation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29299e9eb778994bf3215592f80bcb7e0fe09ac7a04016e3411a694af0b78352"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/similarity_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"301ed062c660e47818f51c28ac5a81146696176559d36d18ffc6629cd5567475"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12029161022fae2ad368c7ffb725541cbfad9214c3d167e93e340b181e2ca9e6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/isometry_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55d11f4e1732296f25f7e5fd65562cd876ebd108504a2a5157397572e72ad6f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/iter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fa1bb1c31f739219cbdf0049c3498929f8aadf61190c4dca28bc3505e48377"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/lblt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba65a459c93842b2103a31c64566323e28016f076e18441c90e1f8c7000b3ef"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/quaternion_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdece94199851d46d8d8c5136deaf5ec981fa29bd9936778cf4622a1183d8b0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f47a327e08d3cabdfb7b108991f5a280445c0950579e275b69e14cb6f6f6ae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/alias.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad5b30d65684bfb46091f4c495882b826a61bd7e8d7e2fc34ff3d78230fd72c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/qr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"615009a09f7c4dafb54679db387e5b0e083e89bd8acdefde45fcd0e284deb00e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3247b9e2887ebba88111fc7b3ed00da2c2b30da0f3b9b2307c68d091b233ec3b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/proptest/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0846ecd750eabf66f94353a25eeebf0833c98458bdb81708b0391cd52620f0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/isometry_construction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f918b0c3241ff86441306d600fbd21790aaf2baeed688c9646e18a48fab84099"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/qr_util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ff0371e6a978d33eb69e22e3121ae5a20582bc39099012c88f8a1d3cad2db5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/exp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e56506cbf019e3c2e40d05ef5932fdd1cebcbf786e2785ed91f6cc29ef2410"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/decomposition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"829d47400605b3c823a78405ff6f82e7e6ad0859da30e6a99cbc78cf7407e320"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/cg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c4730608f55fa2270a600eed2c707f959f25611f84a434b0a33f8eb074af22"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sparse/cs_matrix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e68dfa6656bf0b75a5529776eb9e8eeb08277931876d812944eb9f587f0c46"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/similarity_construction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb748be64b4b00e3d3cd443b4326e4d9ce5fee37d27589c4b361651760d49d3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/point.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6392308c1bb1383a615a40d388845c6092b637ad6e3a4db916754d7113debc6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/statistics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de4f9a8a6109f4125d5dcd2b8c2bf5c3e0804b45e710a76b8250591ef721618"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-macros/src/stack_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b224bacd0183be9e41bcd9d775cf03c4e63a14fd2da4deee08cc02cb9fa197"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/unit_complex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afa0b6645ffa85103eced23b436d334e6c9f0eb2c890f3dda4d1e905ffef0f7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"062241e946f784ab097442ebd5241a8d3ce3d1685d6ea53a1cdbf0fab3ecf9c3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/symmetric_eigen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5b70cc0c1e3cc10ddcc1505804fdb583d29fe429183e06821ec3c1382cfbf8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/vec_storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d0bae05f2fc70695b35993c9ddd34242109fd7e33c8045367950d60d194633"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00709d3206eaa0bd53ad57d088835f511b256f638a039dfd8867ce24884abb47"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/similarity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9419c26fd0764528a74eb87b50189f75c51a4c871abf9b16ab7089294196729d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/eigen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb38e7bd61a6f36119b6bd19c3de3301e6f6ca2fc262efe34314b18339ae6b6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/unit_complex_construction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c120dc0bec8f55e71812f765a3c495c4b98a91d71b1567d85e68b799f22463"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/construction_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb442d5dcba49c8f77911c920515f576b3e52313508caae163a7d0acf1e9ca2b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/bidiagonal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78032d4eacf781092fd4f9599137c6e4941f92181a82992cdd74245d73704672"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sparse/cs_matrix_cholesky.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6e0a74b808a20272af740f1ae24b97665cc47a61435d688eb2506a619fb4ee"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/convert/serial.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c530204591708eaa258ceb4d51012a1fba39d28b01f6b5faab5f60b685636b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/lu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17593e51e322ba9e127374b63d6839a62a99587dc7f98d1c4cd54d3760bb92c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/impl_std_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf6ff14dbb2bb4edf6276ca7eda18b5fc60b48c1660ed51a262244b9b9617de"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/factorization/cholesky.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d41e7bd9f6f1228c0da896d4e7e55021602f642d57fc18b07eb75412e339c09"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c33f69917d722b66c48f439a10418b2826f9a2ad07b07bb32c0fd02d79bb05"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/unit_complex_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"273acb84eb530f96938dc1f38c58aa4b2e214975971573b4b39f6248f9ac71b8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/default_allocator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28c103daa42da82a3d0d462c35455dc0ee16e41934a623fd5ff4b581c7c9dd4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/inverse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa66c45d6a4d9f426734a752c55bb7c2fc0d95fb382570de62448b9ae60b045d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/unit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b8f5724234bfc438c86cdf02367a5ddefa509eb595a4e401acd3f388957435"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/lu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d80bc0eef853da508371bd2054b5d166d47238a344b5fe331e043339a38d5cf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/scale.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1745eb521c62c9a79667ebc5b8503acdc9325650d4080a89bc2a29ec9aac9069"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/componentwise.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25571845c120d89a95925bf691557aba3ab0b6cbb352c7c3caa22b74b1f4d20"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/isometry_conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a3a4a161f6f998c1ba23bdb3a909789abf763037488c0d36caaf90f2f92b44"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/svd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b9fdba1bf0da60663fe691f02ae14f2c623533b22de5c8f647b31f0854d295"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/generalized_eigenvalues.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cb375ab6dee15f44a7221ea6dedb12b0fea1e71771a5ef9c87e89ca65b526b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/blas_uninit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9048a472d3ced96a673335d22f6d7b562a07664f01cbb0690bb71d795414787b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/perspective.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22068a63465222cdd884d7d89fd3702996803f3d4eaaef7ffd9ea94a75b90222"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/min_max.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6028b5fa558b55924a9c65e8faf95a7a65ffa578500b70605e205f35485f5c1e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/col_piv_qr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe59296feb89e0d791fbfbbca0cab40cf02efb98d05c5bca37781112ffa5bdbb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/quaternion_conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7566ff7314a2406771b861c4ba9acc50b76edfbfa29fba556757a391a5333f2c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dd73232cce72482fe3ffb86a07648cd18e7de3ee77c1aa84471da6a8017dd3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/colpiv_qr/test.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6a3a7290dbb6e4e3d63415869a5c21032a4fb9efc703755a6f86c756bbbe6b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/qr/abstraction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a08e5dd250da0d9f62ff99a7c758814ccaeb6fd83d3b682af7afca238fc19c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/similarity_conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2508fb7edbd2beaa8154090e70e36f64e109ee849fc086523d8340983eb45785"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/coo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac93d37254b7baee740e903a738d008fbc0f33be5204e45bd984faa0021317c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/rotation_conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c0f1a64f798490d1002390cd3bc21e8e79b12a48793ca1ed38ccfdba03d373"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtc/type_ptr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24ce0721e04a5d47be7c6adda0275c4d44cf0d3176001271ce6b2394e1c0ef1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/aliases.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d391795f36c7542f72777f39d5a84dce56065b9e6da770912352979dfd9fdbc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/serial/csc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43020f4398601a85ff813804a389459a4702ade0fa39490fcf61bb6cc062960"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/qr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"771404bd3a6fc45b07793ba7311b0af8498c160aa71ae1208acc4a6fe0fd1dfe"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/dimension.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d451e3fefe99d26feeb140cfee787894c3b460b1723572fbc5089c608ceb5658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/qz.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"531759fafcc183e5e3c470c253289d6b106b962f30ef4e7c16a6e4fabb946cf7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sparse/cs_matrix_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff73d12e69cc531a3f0bc867b6a6d82668459c3017fd6bb6b4d4bf4f8cb4f82"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/point_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"294e9d84d4bddba67a2d86a785844f0cac806a7ada45b3e98028c59c964a9e8a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/isometry_interpolation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fefbe97e75a7359bce25dbb847a3e4222f806627afc88fe41dc4597d32dcb91"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/par_iter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde190eaa40fde51730a1d82855eefdb8597533a132b87a1c06d51fba4692a10"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/translation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fffc7d5f55267f3c6d39a08aefa067ca742e1c3ba61044f80ac9621e925e1c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/serial/cs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca79a010a61d95b34472f76b0e27645a9fcfd1cdd67d44f75ac300b5fe51e0c5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/translation_conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efb8d9f3b1c6f146c76d4fe8420c3e4591c9cbbe4c1d6138a4d7575e98b6ef3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sparse/cs_matrix_solve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3504d3fde92ecad208b4c3eaa534f87cb5f72f4a890b4a787e3825bc7b66d4d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-macros/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c420876db102c0fe4edf4a20cdebc0f3043b1b38c6da976e978a174ac486e4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/op_macros.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb8cfee252660ab481320379195928065dd86983c166d4bf241ceb5d91eb666"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/array_storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb4386309d3c6943524cc9a39cb4461a894690178fe52545379efcacfff20b0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/full_piv_lu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0066b3a684ac59c26a1f41c1f4dcf686974d5e3313ac612c33da8cce136f758"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/schur.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb66954fda4e0ef5f38f7ad8a3ab25441b03672b04c896b373d8fdb47360597a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/dual_quaternion_construction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bee9543164e2c64607ae04a923e9aa2a734a815ca0d46adb34a3bed7826e732"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"810b51b75fd33f5b8eba3daf250662d12c73dd696c5abd6c7f47786d57068c29"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/unit_complex_conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e78e3ded6265630797b54bce9934332ebda3c0070d836d4ad104d77ae557452"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/point_construction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"912a60f0262b930c45b134dae234c3c1a6271d2f5e465fbaf213635df5de17bf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/coordinates.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddb0d155fb860c3c5ee947d47f7f5fefac6bcda6266af9f73634762ea94161a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ad15a32edb17ef5c4b86626932c4f69e61394ce68773d8098b4832c2786c80"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtc/constants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbb4fd6d7a9549b324066e423ff8dc90e1ee46e4f2846e3554db5f80d16b2f2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/rotation_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42ac83dccb623d5f5cb40d19c301ea722bf58b8118aa7d9e06f22059b066d6a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/hessenberg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d731222ea66f5bfc8749fd15cb0f26249e2b4b9fc9315052d5e4aa1f07cd66"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/cholesky.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cea079f497ae7eab96b519d618ac1e02820ba815e7ed7186a955155705e0f8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/symmetric_eigen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"725bd5e16d3f791559a1e64751c9ef32a5e3bc012708dbdb90d7a8aa3f0e5cb2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_projection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a016051107c5f5fdf6ae0a3fff02abdef727c7be40ac702565c7b8a5ee1c5dc8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/scale_conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc6ecf30dbed270760c5935a159159f7900e68da287c496769e4a36262758a2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/colpiv_qr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0576a3236d5c9df8a23786a367f49a61219a1728b4ccd62361d3cb4b0bab32"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-macros/src/matrix_vector_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bb841b0f7619273338b9d3fe04cf188e39fc703b8046c6d02e1c78b517976e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/givens.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e11d61d5e5aa73e0080ff54e8753e45f128d99e70050f7cc6f4d8482198d7e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/allocator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1addbb83e9dc2d2e4d77040d203627b1cb9a658bd4f65b9f3933ac20996d1eae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/serial/pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a5ead1f1a790a287b8f64055cebd43f211d44ce6dc1a2e5667f23bb0a25b6e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/symmetric_tridiagonal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afde7fbd0fa897afe9d7f81071083bb24a72a2c4082af1da55e1d4536bc9ef3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/point_conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1d203aec723e71ff083e788bb5ad3712d464e0b96200891b4797920a80a793"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/householder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6b18733bc9b641ca92d0327e0b8d3587da6db609c412aafcbc6c56a3f5a4c7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtc/packing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd63f4d66fddf844c7a66e06b70d9f5ffaa5797154bd620c2bf085024e299a98"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/constructors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"362ec400380f92fa64b9ec74aa37d3e810e2a404dbbcffa93871d549a0fe5044"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/translation_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4ac5f7fe25a6b7f95e99fcc143bb035afe9576a3b6d01b13bcaf816c32859d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/dual_quaternion_conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89d1146b69a18cfe5d074aa8555ce1f8cf5424f4b35d0ad38205f845f6e8a89"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/hessenberg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce45fd249f03a506353220e084bff665e061184a4633dcce99b9ce330061ff3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/vector_relational.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebb4d3a0fc687d8f8ca628224f6d8f0a2eafb1574629c403212602251924bff"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/permutation_sequence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e4be0a2cdf24ccda9b753e77d1ce73f77235deadb734be7c31c346953931e7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/colpiv_qr/rank.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f571e13cfec61b77948db40397416d93c201aa5cb8fae8436e64074137c444"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_transform.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b075d6b92c4541e31e2836d467fa01dd79ecf9bed74f36fbe8b2aa12e73c218"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/colpiv_qr/permutation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c9c81a715b1ea4463b145ab22fa4f30473cd8f379ea1b3baa45e516e8a2b70"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/reflection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbdb268fccec10b1da69257a6c4dcd14227d86fddd409cabd56b5dc3aa3af41"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/serial/csr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"578b848f7811966fcf6f6623623fc549b5734f3b61f86eb08718c0efa3ae2a04"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/convolution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea177a4ca9ccdcf346b190dc6842cd2af40dba96ef3f65cb4bca4d5be98f8d4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/scale_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"228c58a64a5971a003d8adf487014ab6bc4086ca56cdfcebfd77da917a70f3ec"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/ops/serial/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e4d52ae11c3ed76041a31b7f7b8010614868d558acbcda39df36d48c970073"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/translation_construction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf58d89c54e6f433ac51834d463fd9909e9beb3222164d95de926c5168131c1e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/interpolation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"115ebf10abc1872924a98d4aa8a50876de126419c89d8b41eac34810a4c83f16"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/abstract_rotation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8052d8c4ef9facccf07f86451f1e50a50b4598d41a25cb5c7bb666780a75b95c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtx/euler_angles.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a6bdabb0cf0b24958f1df528c5c300b0556368029bc4360560a4ffa542289f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/scale_construction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f8dfd8cb7a7033b22d7c040e9a109a01599ded92bd0cace755f504632dfa23"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/properties.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"577933339fb31961e3b469f1dfab8415275f41f0b9412efe4e2e56b9376b33e6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/constraint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3867709dfaac9ea28d897796ae05dc5eb7d548c383cea1f527662ac33f159e5c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/eigen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7371e796dd056ecaae3837d63a2e5c58d9bad0cb9bcc2c7af22c8041f46f4ba8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/vector_common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"477a7b5f0bca4f96dfe1d09d1a584acbbb1f61b1fc499dbcaaff39c444368310"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtx/quaternion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b2bb5bb92f554ed6548a533f71cdaa41ed99042376ff79346f037a3b2409be"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtx/matrix_operation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8d3af4ab7ea1cc5202cd57ba101740d303c0f960bb1bbbb6a631aa0abcd33d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sparse/cs_matrix_conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a770425bd396eacb7df52b037223a64fa3cdb3d789169967c5c9217ef7e753d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtx/transform2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f58cefb531f2ddc2b9778f4af0b9ed0560e79f49afb4d0cfb4f79a4cacd121"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/udu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c342b8fbff9c919dffd39a7076c8e6bfb3a4a9181d935e71dc66c02df3ab6a9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtc/bitfield.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"851cfff7dbf1ff9c01a96e3d5957e735b1ac7b333fb7bfc3dee9fa9f574a59af"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtx/norm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"588ee02be584720541d4ab2ae5ada1c5ad3e52ab7863fedafdfdfe69cb5f8f7f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/rotation_interpolation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"559a4aa5eb470747016e391a9347231ed5b7898b967973fe359cfdd79399ac03"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/linalg/balancing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec60867c9565d0a902992d499c1eeddaf10ef7a6feec5b145c860acbec4ea09"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/colpiv_qr/permutation/test.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e0eea0f91b32ec7317878a2382d6cb78b22f2efdcc7772f4e5b0f50d819e46"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtx/rotate_vector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e5ac77735d398afc79efd2703dd1e8389ce612096c3d9822144d391ef78c93"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/convert/impl_std_ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e3be910d1ff1ee7cdc7674f651087fbffb2e96960763f0bbbcbbfbfbc7219f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtc/quaternion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bab3b65599962ca2efbc74525b5247a3824e2c70ff21a41e07235793cfe1916"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/gtx/component_wise.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76540aeeb3fbaec52be1546071fc5c7ab6c5f90d0731ad7525202d3a745961f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/matrix_relationnal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da8daac17fe52cc1a9b5a5274dfc427f5144d291f21b34b96e71248332d2d18"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-glm/src/ext/scalar_common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9d92a62297ac45b60b6c88059dbdbe3f66f7c14a1cce992cbe3b13f4b4132a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2d8ad1158dac0a3786415b7a3f69398b10509552340848cd98871b1279ef08"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/base/uninit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4682b981c1fce65ce70f1e0e76f70059f3496a21f447c7abef141823a374b68"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/coo/coo_serde.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5e2a73656c32a5af68d2abd0d69fb9f7443ef2edd1f6980ad33358d624e7be"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csr/csr_serde.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29243e02153144b7a811eeebe8356588cbeed1fae4acc86069bc46bf4e168821"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/csc/csc_serde.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0036f1354d578edfef6c97f4a38d4d1e8bbe761d9201157e7b5bcee3c7cdc5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: quaternion.rs \u2192 similarity.rs, transform.rs, translation.rs: \u0060src/geometry/quaternion.rs\u0060 changes together with 3 other files \u2014 \u0060src/geometry/similarity.rs\u0060, \u0060src/geometry/transform.rs\u0060, \u0060src/geometry/translation.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/quaternion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"476b9c7244bf97324cf05563e89ea337386cfd1d2367a6dacd6b0fb5ea6632d0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: orthographic.rs \u2194 perspective.rs: \u0060src/geometry/orthographic.rs\u0060 and \u0060src/geometry/perspective.rs\u0060 change together 65% of the time (22 of the 34 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 22 shared commits counted here, the most recent 3 are \u00607866bcee\u0060 Remove CUDA support relying on abandoned toolchain; \u0060c63503de\u0060 chore: remove explicit bytecheck dependency; \u0060e959f2eb\u0060 Fix CheckBytes derives \u002B drop Complex rkyv support for now \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/orthographic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf626f92f40151ee255ceb235cc3416f97376294ae82079913e49653e074f67a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: rotation.rs \u2192 isometry.rs, similarity.rs, transform.rs, translation.rs: \u0060src/geometry/rotation.rs\u0060 changes together with 4 other files \u2014 \u0060src/geometry/isometry.rs\u0060, \u0060src/geometry/similarity.rs\u0060, \u0060src/geometry/transform.rs\u0060, \u0060src/geometry/translation.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/rotation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa131fad9311650d3f2da93c10d974e903ae16719180c0b30184ce3e4fb30ec0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: point.rs \u2194 similarity.rs: \u0060src/geometry/point.rs\u0060 and \u0060src/geometry/similarity.rs\u0060 change together 50% of the time (14 of the 28 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 14 shared commits counted here, the most recent 3 are \u00607866bcee\u0060 Remove CUDA support relying on abandoned toolchain; \u0060c63503de\u0060 chore: remove explicit bytecheck dependency; \u00602cbb27c6\u0060 Derive CheckBytes trait on Archive struct \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/point.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87dbcf84ef501848bd93191d62163dd6407f974b8d2f8df04144f9c83592ef5"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e87a81f8993dd1761147e37a83351ec9fec6bb3da2843a5e84fbde943103b73a"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M1","level":"note","message":{"text":"Thin README: The root README is 53 words, against a bar of 120. Of the three newcomer-critical sections this check looks for by heading, in the README and in the repository documents it links, it found no a build/run or getting-started section, no a testing section, no an architecture or project-map section. Sections are matched on HEADING text only, so material written under a heading this check does not recognise \u2014 or with no heading at all \u2014 is not seen and this row may understate what the document covers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88b11295dc6ac6146c259ace6043143959f96dc98628f8c8578b6c5f95b8149"}},{"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":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060curr != usize::MAX \u0026\u0026 curr \u003C= max_j \u0026\u0026 !marks[curr]\u0060 appears character-identically in 2 files \u2014 nalgebra-sparse/src/factorization/cholesky.rs, src/sparse/cs_matrix_cholesky.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-sparse/src/factorization/cholesky.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dd2ee11f9c17de586479097e1839d449f9ee21c076b01c4e44b442db60011e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nrows.value() == 0 || ncols.value() == 0\u0060 appears character-identically in 2 files \u2014 nalgebra-lapack/src/qr.rs, nalgebra-lapack/src/svd.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"nalgebra-lapack/src/qr.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cb5454b90f8ff3274a72a9b7c94fb0e79bd9629e5ec44547bec62c15e5d4a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sim.isometry.translation.vector.is_zero() \u0026\u0026 sim.scaling() == T2::one()\u0060 appears character-identically in 3 files \u2014 src/geometry/quaternion_conversion.rs, src/geometry/rotation_conversion.rs, src/geometry/unit_complex_conversion.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/geometry/quaternion_conversion.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"db913eb44e9031ea55f4375b3f31cb45678f41eba7ddeb3c37cbf6063f69e44b"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"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":20,"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."]}]}