{"$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":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"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":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"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":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"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":"SyntaxError::generate_notes (cyclomatic 61): SyntaxError::generate_notes has cyclomatic complexity 61 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 12 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/rsonpath-syntax/src/error/display.rs holds 2 of the 6 functions over the threshold \u2014 including the worst \u2014 and 49 of the 74 points over it (66%), 4.1\u00D7 the next-largest file (crates/rsonpath-syntax/src/parser.rs at 12). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/error/display.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f2d52c720af1629e7045011336bd7656eeb636e925d1893d94ce7b59788987"}},{"ruleId":"D1","level":"warning","message":{"text":"rsonpath_syntax::parser::string (cyclomatic 26): rsonpath_syntax::parser::string has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 8 of the 26 points are its own statements and the rest belongs to 2 function items inside it that branch (read_escape_sequence, read_hexadecimal_escape). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/parser.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f66277d8337c02182e08c6ed84a71f8d8170c0d6feb79b4b4e19e3edf2444c"}},{"ruleId":"D1","level":"warning","message":{"text":"Executor::handle_opening (cyclomatic 23): Executor::handle_opening has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/engine/main.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b68a54b561474b918e6e861e5afa10f55396647c5e7a216691fb7af7f73ca40"}},{"ruleId":"D1","level":"warning","message":{"text":"rsonpath_syntax_proptest::filters::any_json_float::arbitrary_exp_repr (cyclomatic 20): rsonpath_syntax_proptest::filters::any_json_float::arbitrary_exp_repr 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":"crates/rsonpath-syntax-proptest/src/lib.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"876c9f268d93480473eb78da1cabe8838bfc00863b6abaaf98f14529f2a80263"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayableSyntaxError::fmt (cyclomatic 18): DisplayableSyntaxError::fmt has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: SyntaxErrorKind::toplevel_message (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/rsonpath-syntax/src/error/display.rs holds 2 of the 6 functions over the threshold \u2014 including the worst \u2014 and 49 of the 74 points over it (66%), 4.1\u00D7 the next-largest file (crates/rsonpath-syntax/src/parser.rs at 12). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/error/display.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"0212f9f770d2a28eaeb477f61b5ca8812b33d638c4acbff4c91598d822ffdd11"}},{"ruleId":"D1","level":"warning","message":{"text":"rsonpath_syntax::parser::logical_expr::parse_single (cyclomatic 16): rsonpath_syntax::parser::logical_expr::parse_single has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/parser.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d14f38c7f6b10eb3d80c9073653a29326bc22a115978a9e90a2481cf318795d"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxError::generate_notes (cognitive 56): SyntaxError::generate_notes has cognitive complexity 56 (threshold 15). Drivers by points: if/else 34 (57 pts), boolean chains 12, loops 4 (9 pts), match/switch 1 (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. This shape REPEATS in the file: one other method here (SyntaxError::generate_notes::fix_unquoted_bracketed_selector) 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/rsonpath-syntax/src/error/display.rs holds 4 of the 14 functions over the threshold \u2014 including the worst \u2014 and 111 of the 230 points over it (48%), 3\u00D7 the next-largest file (crates/rsonpath-lib/src/engine/main.rs at 37). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/error/display.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d998aed7d6f9aaa0b36488a6dfe8ce72792bafd172e2498e41f8e79bf3ee5d49"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::handle_opening (cognitive 48): Executor::handle_opening has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (36 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 24). 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":"crates/rsonpath-lib/src/engine/main.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5fec70577622281f5207acf48243945ed02615139f4e74b77464f15601e577"}},{"ruleId":"D2","level":"warning","message":{"text":"rsonpath_syntax_proptest::filters::any_json_float::arbitrary_exp_repr (cognitive 47): rsonpath_syntax_proptest::filters::any_json_float::arbitrary_exp_repr has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (37 pts), loops 5 (10 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax-proptest/src/lib.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d09260197f08d0c73015520a447d8a0a9c7b6ab4cd4bd7f98ea43d81b33bb1e"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayableSyntaxError::fmt (cognitive 46): DisplayableSyntaxError::fmt has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (35 pts), loops 4 (11 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/rsonpath-syntax/src/error/display.rs holds 4 of the 14 functions over the threshold \u2014 including the worst \u2014 and 111 of the 230 points over it (48%), 3\u00D7 the next-largest file (crates/rsonpath-lib/src/engine/main.rs at 37). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/error/display.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabfa89b273403c593eee112b820453fbba1ed4faab6fe4ece151fccef81e9f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Suggestion::apply (cognitive 46): Suggestion::apply has cognitive complexity 46 (threshold 15). Drivers by points: if/else 4 (21 pts), loops 4 (16 pts), match/switch 3 (9 pts) (nesting depth added 35). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/rsonpath-syntax/src/error/display.rs holds 4 of the 14 functions over the threshold \u2014 including the worst \u2014 and 111 of the 230 points over it (48%), 3\u00D7 the next-largest file (crates/rsonpath-lib/src/engine/main.rs at 37). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/error/display.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4aa5c001bc25be5afa8ea5a85c91b72155d9447c218ca0d8881ce3fc4654083"}},{"ruleId":"D2","level":"warning","message":{"text":"rsonpath_syntax::parser::logical_expr::parse_single (cognitive 31): rsonpath_syntax::parser::logical_expr::parse_single has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/parser.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"88154ff7f3de10b34e37a8e56fd49d016faf5fb93bcf11e99cca121fab89ae21"}},{"ruleId":"D2","level":"warning","message":{"text":"rsonpath_syntax::parser::string (cognitive 27): rsonpath_syntax::parser::string has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 6 (12 pts), loops 2 (nesting depth added 13). Most of this is not in the body itself: 12 of the 27 points are its own statements and the rest belongs to 2 function items inside it that branch (read_escape_sequence, read_hexadecimal_escape). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/parser.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4016fde2743d9bc7c264c479c63a63268b3fbfb90dfa9728ef46b299d664cae"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonFloat::from_str (cognitive 24): JsonFloat::from_str has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 3, match/switch 1 (nesting depth added 11). 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":"crates/rsonpath-syntax/src/num.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"745952be7f2765654e37d97f297cb8883807794becf6425a55a18597bd8352b0"}},{"ruleId":"D2","level":"warning","message":{"text":"SyntaxError::generate_notes::fix_unquoted_bracketed_selector (cognitive 23): SyntaxError::generate_notes::fix_unquoted_bracketed_selector has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SyntaxError::generate_notes) 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/rsonpath-syntax/src/error/display.rs holds 4 of the 14 functions over the threshold \u2014 including the worst \u2014 and 111 of the 230 points over it (48%), 3\u00D7 the next-largest file (crates/rsonpath-lib/src/engine/main.rs at 37). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/error/display.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f1cc8fe44e7f811454811e173691b56922ab2bc209df0e807a85e758349924"}},{"ruleId":"D2","level":"warning","message":{"text":"NondeterministicAutomaton::new (cognitive 21): NondeterministicAutomaton::new has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 6 (7 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/automaton/nfa.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c3a68933c78043c92fff95b4034927405acd75bf530d4227a551fead3cddba"}},{"ruleId":"D2","level":"warning","message":{"text":"Automaton::fmt (cognitive 20): Automaton::fmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/automaton.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc3e7a432425c277e0d49776c73093c122f508b9041e97caaf0e87b0f8ceefc"}},{"ruleId":"D2","level":"warning","message":{"text":"Executor::handle_comma (cognitive 19): Executor::handle_comma has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/engine/main.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"253eae329a79d479742f0b11bf206d139997ee23b48f4b92375107f281104311"}},{"ruleId":"D2","level":"warning","message":{"text":"NondeterministicAutomaton::fmt (cognitive 16): NondeterministicAutomaton::fmt has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (13 pts), match/switch 2 (3 pts) (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":"crates/rsonpath-lib/src/automaton/nfa.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa1fd54ddf09c63115ce5994537cdbad87230ef32602184092322bf5ff14661"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalExpr::fmt (cognitive 16): LogicalExpr::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). 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":"crates/rsonpath-syntax/src/lib.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5fd71303808f5d257c95f39a8f518854036a202be7216be249b195cc1beb03"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SyntaxError.generate_notes: MethodTooLong \u2014 generate_notes runs 171 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 71 over it, 1.71\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":"crates/rsonpath-syntax/src/error/display.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd901fb607c6eb2851ee502b6a05de23d1158e55ea5f35cb52249361da59892"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HeadSkip.run_head_skipping: MethodTooLong \u2014 run_head_skipping runs 135 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 35 over it, 1.35\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":"crates/rsonpath-lib/src/engine/head_skipping.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"580001c182af572de60c8fdab43c57d9a1106a3911f633aa69eee7f8a2cf9fd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: classification/simd.rs: FileTooLong \u2014 637 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 137 over it, 1.27\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":"crates/rsonpath-lib/src/classification/simd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0a2021c0ea1f9e576a6bb1577774ba6b7e6bfc8adca5a6a644ec39bac5b113"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rsonpath_syntax::parser::string: FunctionTooLong \u2014 rsonpath_syntax::parser::string runs 125 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 25 over it, 1.25\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":"crates/rsonpath-syntax/src/parser.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a1e8348293c2ef2d7b7fd81d4138a8b4d9e4371c7e414bf6237d5910533754"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser.rs: FileTooLong \u2014 619 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), declaring 32 free functions. The bar is 500 significant lines; this is 119 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":"crates/rsonpath-syntax/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca8093635450c57ba86186c53a272252916ef7b91ac15b954dc1fbdec13ec60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 77 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":"crates/rsonpath-syntax/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c2da9afc596e28318d48ec3b800b25e0f8069c941095797f775005275776db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: rsonpath_test::read_and_tag: FunctionTooLong \u2014 rsonpath_test::read_and_tag runs 109 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 9 over it, 1.09\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":"crates/rsonpath-test/src/lib.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1809562686d7565d4fef428b3d71ca7def7b3f310490cd997dc178c9855ca5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ErrorFormatter.build_error_lines: MethodTooLong \u2014 build_error_lines 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":"crates/rsonpath-syntax/src/error/formatter.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca647d709f25bedf59aa4752ee4c1e018d46dd14da8bb810986c8b255f296b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/rsonpath-syntax-proptest/src/lib.rs:322-346 | crates/rsonpath-syntax-proptest/src/lib.rs:348-372 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax-proptest/src/lib.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92e9147788dc7816591ee8664e5be8b8968d67d8238de5f6e211254712791db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rsonpath-syntax/src/parser.rs:185-213 | crates/rsonpath-syntax/src/parser.rs:386-406 \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":"crates/rsonpath-syntax/src/parser.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfa1646381c22af2ca2e53b35bb0a4c8572cc12940c856003492cdf4acacba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/rsonpath-lib/src/classification/depth/avx2_64.rs:39-60 | crates/rsonpath-lib/src/classification/depth/avx512_64.rs:45-62 | crates/rsonpath-lib/src/classification/depth/neon_64.rs:39-62 | crates/rsonpath-lib/src/classification/depth/sse2_64.rs:39-62 \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":"crates/rsonpath-lib/src/classification/depth/avx2_64.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"383dd412a11dbd5ad6b0dfcb719d3e29f02c518107f8a4a0b05052d196d31ec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:85-108 | crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:115-144 | crates/rsonpath-lib/src/classification/memmem/avx512_64.rs:84-107 | crates/rsonpath-lib/src/classification/memmem/avx512_64.rs:114-142 \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":"crates/rsonpath-lib/src/classification/memmem/avx2_32.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca17e490360b3ec8328d34c964905d56d89fc31000bb685cc2e825c20b11a0a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/rsonpath-benchmarks/src/framework.rs:191-224 | crates/rsonpath-benchmarks/src/framework.rs:232-279 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/framework.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a588faf61aa41526d63bbe515e2bc92141cc3cd4f24b6ae6ffb340939c2482"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/rsonpath-lib/src/classification/memmem/neon_64.rs:53-95 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:53-95 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/memmem/neon_64.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc44c323241a04dd28f0a73158b7c84090dba30943f02fe3615a3aa376148950"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 38\u002B corresponding lines): crates/rsonpath-lib/src/classification/quotes/shared/mask_32.rs:55-93 | crates/rsonpath-lib/src/classification/quotes/shared/mask_64.rs:55-93 | crates/rsonpath-lib/src/classification/quotes/shared/mask_neon.rs:51-88 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 38 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":"crates/rsonpath-lib/src/classification/quotes/shared/mask_32.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9066d2116aba471e6e7a86b4c1ba6ddbc24b8b2b208561888b66a7c1d98b62f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 36\u002B corresponding lines): crates/rsonpath-lib/src/classification/memmem/neon_64.rs:105-140 | crates/rsonpath-lib/src/classification/memmem/neon_64.rs:147-188 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:105-140 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 36 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":"crates/rsonpath-lib/src/classification/memmem/neon_64.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"16718712beb22ed688a8d2c66c1f37e74949303bedf55c1dcddb3d1fa2dca1ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/rsonpath-lib/src/input/borrowed.rs:250-281 | crates/rsonpath-lib/src/input/borrowed.rs:305-336 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/input/borrowed.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8598c51687c4a59cf12630b0aa9195b4cc0a1e7cb68a0533f7f08a5ba48ace"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/rsonpath-benchmarks/src/dataset.rs:164-194 | crates/rsonpath-benchmarks/src/dataset.rs:196-222 \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":"crates/rsonpath-benchmarks/src/dataset.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0108b4824b11e5fdea60ddc7ff5ba7ee5fd5c7a502e7cad39fa2dfe729e7f7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:93-116 | crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:123-152 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/memmem/sse2_32.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d85e6ac8b9083b8a5a899bef3eff928bf0c7dfa12b0b2dae4ec2cc6f3d05515"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:50-75 | crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:53-83 | crates/rsonpath-lib/src/classification/memmem/avx512_64.rs:50-74 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/memmem/avx2_32.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b92d5a3f40233241eeb99196a888fb408a20e4384ee0a35f795e31310ffa71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/rsonpath-lib/src/classification/depth/shared/mask_32.rs:31-62 | crates/rsonpath-lib/src/classification/depth/shared/mask_64.rs:31-61 \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":"crates/rsonpath-lib/src/classification/depth/shared/mask_32.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"019ae4e91d4f5330fd662e1f46d47d7d8d74d598b1a114a937ed7129cf5f6214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 1\u002B corresponding lines): crates/rsonpath-lib/src/classification/structural/avx2_32.rs:12-12 | crates/rsonpath-lib/src/classification/structural/avx2_64.rs:13-13 | crates/rsonpath-lib/src/classification/structural/avx512_64.rs:11-11 | crates/rsonpath-lib/src/classification/structural/neon_64.rs:13-13 | crates/rsonpath-lib/src/classification/structural/ssse3_32.rs:13-13 | crates/rsonpath-lib/src/classification/structural/ssse3_64.rs:13-13 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/structural/avx2_32.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"defc338129657b8da1f405658b8b07d88dcf35ed1cbd1109cce606c20c099f67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/rsonpath-lib/src/result/nodes.rs:239-267 | crates/rsonpath-lib/src/result/nodes.rs:368-406 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/result/nodes.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"130a0c92161c9ab0242e7c3f04a8c244cc047a59f265f83bf1792bfcb7c43a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/rsonpath-lib/src/input/borrowed.rs:151-175 | crates/rsonpath-lib/src/input/mmap.rs:111-132 \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":"crates/rsonpath-lib/src/input/borrowed.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"449b1db6b61c21e12477224991ff8bf41846aad5a27bffa896aed66b462e86e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rsonpath-lib/src/input/padding.rs:270-285 | crates/rsonpath-lib/src/input/padding.rs:503-524 \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":"crates/rsonpath-lib/src/input/padding.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dc5977d9501c14a432c6f9cc839b3857716a7950e19229a7b229d37d273393"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/rsonpath-lib/src/classification/quotes/neon_64.rs:22-46 | crates/rsonpath-lib/src/classification/quotes/sse2_64.rs:22-46 \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":"crates/rsonpath-lib/src/classification/quotes/neon_64.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"286b4879064af586a68c3cb5bbf618090417d90509ab1e239ed64ab7c942bbc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rsonpath-lib/src/classification/memmem/shared/mask_32.rs:17-32 | crates/rsonpath-lib/src/classification/memmem/shared/mask_64.rs:18-34 \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":"crates/rsonpath-lib/src/classification/memmem/shared/mask_32.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5e6132b627f041f4424143563e03047a6dc0678b1352ac025d8d618205160b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/rsonpath-lib/src/input/borrowed.rs:133-148 | crates/rsonpath-lib/src/input/borrowed.rs:178-201 | crates/rsonpath-lib/src/input/borrowed.rs:204-219 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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":"crates/rsonpath-lib/src/input/borrowed.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb51574af1b0437fa2425f9f85ec65b5ff4c27aff9bbdd5512d67b36148e4e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rsonpath-lib/src/input/padding.rs:341-357 | crates/rsonpath-lib/src/input/padding.rs:456-472 \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":"crates/rsonpath-lib/src/input/padding.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d42a594693504fb6da1feb506a9a5db2b0c89de7c5f522ac626339ffb53fa03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rsonpath-syntax-proptest/src/lib.rs:294-303 | crates/rsonpath-syntax-proptest/src/lib.rs:305-312 \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":"crates/rsonpath-syntax-proptest/src/lib.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ca43db9d3a5acb0ac1728125bcdbc975f39fd0acce1eb2a5ee9217a2bc61ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/rsonpath-benchmarks/src/dataset.rs:133-146 | crates/rsonpath-benchmarks/src/dataset.rs:148-162 \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":"crates/rsonpath-benchmarks/src/dataset.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f503bc9f104dcc4236704d1f38825da6f39acaed1db4246507f4fd7a563746"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rsonpath-lib/src/classification/structural/avx2_64.rs:31-43 | crates/rsonpath-lib/src/classification/structural/ssse3_32.rs:32-44 \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":"crates/rsonpath-lib/src/classification/structural/avx2_64.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc1cf1bbd6654423a0675e153cdc4ce8fbf1b8a2e222c70369303c60e15970e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 1\u002B corresponding lines): crates/rsonpath-lib/src/classification/depth/avx2_32.rs:14-14 | crates/rsonpath-lib/src/classification/depth/avx2_64.rs:14-14 | crates/rsonpath-lib/src/classification/depth/avx512_64.rs:14-14 | crates/rsonpath-lib/src/classification/depth/neon_64.rs:14-14 | crates/rsonpath-lib/src/classification/depth/sse2_32.rs:14-14 | crates/rsonpath-lib/src/classification/depth/sse2_64.rs:14-14 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/depth/avx2_32.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d30e5fc61cfe36aed1065cf276ee8705090ffbc023d2db9f93c6c442f80f3b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): crates/rsonpath-lib/src/engine/main.rs:127-142 | crates/rsonpath-lib/src/engine/main.rs:149-164 | crates/rsonpath-lib/src/engine/main.rs:171-186 | crates/rsonpath-lib/src/engine/main.rs:193-208 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 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":"crates/rsonpath-lib/src/engine/main.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"deea9e7f6168fd05db544ca7e28f794a7ff82053e83aee21095dc11bf728a85c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rsonpath-lib/src/classification/quotes/avx2_64.rs:22-33 | crates/rsonpath-lib/src/classification/quotes/sse2_32.rs:22-34 \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":"crates/rsonpath-lib/src/classification/quotes/avx2_64.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9ee128ba8925102e455519eeba2632c5102261ae383bd426be8074f95acbcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/rsonpath-lib/src/input/borrowed.rs:222-238 | crates/rsonpath-lib/src/input/mmap.rs:164-178 \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":"crates/rsonpath-lib/src/input/borrowed.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ed1050b37d99509bd09322f8641000e5b11614b672a32e3fe2e109210faf75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/rsonpath-syntax/src/lib.rs:1221-1237 | crates/rsonpath-syntax/src/lib.rs:1242-1260 \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":"crates/rsonpath-syntax/src/lib.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d88da27278de092162db14ee72e2ef6d3f6166d8423dfcdb47a5bec3dd0a509"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/rsonpath-lib/src/result/nodes.rs:225-237 | crates/rsonpath-lib/src/result/nodes.rs:339-351 \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":"crates/rsonpath-lib/src/result/nodes.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5d031d9c0503e2d5eff48c4a07eb6322eac8372e93756f6473797e61b0bdf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 1\u002B corresponding lines): crates/rsonpath-lib/src/classification/quotes/avx2_32.rs:8-8 | crates/rsonpath-lib/src/classification/quotes/avx2_64.rs:8-8 | crates/rsonpath-lib/src/classification/quotes/avx512_64.rs:8-8 | crates/rsonpath-lib/src/classification/quotes/neon_64.rs:8-8 | crates/rsonpath-lib/src/classification/quotes/sse2_32.rs:8-8 | crates/rsonpath-lib/src/classification/quotes/sse2_64.rs:8-8 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/quotes/avx2_32.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d2b691f8d662048df51f04ee72423b397c082e7753989d83a9cced7622d508"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/rsonpath-lib/src/input/padding.rs:192-199 | crates/rsonpath-lib/src/input/padding.rs:239-246 \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":"crates/rsonpath-lib/src/input/padding.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f8de0c5b53c745ecf1e687761e650c06dd734edfa61a45e3af19e270daa74e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/rsonpath-lib/src/input/buffered.rs:179-194 | crates/rsonpath-lib/src/input/buffered.rs:197-212 \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":"crates/rsonpath-lib/src/input/buffered.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d23329bea8e1fb891ad63640276664f805a7fc532b6cad9fb50679af225d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 1\u002B corresponding lines): crates/rsonpath-lib/src/classification/structural/avx2_32.rs:12-12 | crates/rsonpath-lib/src/classification/structural/avx2_64.rs:13-13 | crates/rsonpath-lib/src/classification/structural/avx512_64.rs:11-11 | crates/rsonpath-lib/src/classification/structural/neon_64.rs:13-13 | crates/rsonpath-lib/src/classification/structural/nosimd.rs:121-136 | crates/rsonpath-lib/src/classification/structural/ssse3_32.rs:13-13 | crates/rsonpath-lib/src/classification/structural/ssse3_64.rs:13-13 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 1 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/structural/avx2_32.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a9ce6acb4876988f8b9226842b52b39146c454771e8333b644f65e50c27625"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 1\u002B corresponding lines): crates/rsonpath-lib/src/classification/structural/avx2_32.rs:12-12 | crates/rsonpath-lib/src/classification/structural/avx2_64.rs:13-13 | crates/rsonpath-lib/src/classification/structural/avx512_64.rs:11-11 | crates/rsonpath-lib/src/classification/structural/neon_64.rs:13-13 | crates/rsonpath-lib/src/classification/structural/nosimd.rs:171-183 | crates/rsonpath-lib/src/classification/structural/ssse3_32.rs:13-13 | crates/rsonpath-lib/src/classification/structural/ssse3_64.rs:13-13 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 1 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/structural/avx2_32.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10203c73a28df66ec6fe50a24e5063e81602a3fd71afe2e687cccf1efdd4da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rsonpath-lib/src/classification/depth/shared/vector_128.rs:36-48 | crates/rsonpath-lib/src/classification/memmem/shared/vector_128.rs:21-31 \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":"crates/rsonpath-lib/src/classification/depth/shared/vector_128.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a33e311d4cf0d1b01a15d24ea958f0233e92c333231043c47a9f200a683a3d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rsonpath-lib/src/classification/depth/shared/vector_256.rs:36-48 | crates/rsonpath-lib/src/classification/memmem/shared/vector_256.rs:21-31 \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":"crates/rsonpath-lib/src/classification/depth/shared/vector_256.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e2f95a34ae5e61cc2831e5f2ac6dbd7af4afadeba366c9f37733de4041e482"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rsonpath-lib/src/input/padding.rs:359-371 | crates/rsonpath-lib/src/input/padding.rs:399-410 \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":"crates/rsonpath-lib/src/input/padding.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6558a65747b42e84cd783adad9a4e62ec5eae7d50c854d9a87e821f161643e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 1\u002B corresponding lines): crates/rsonpath-lib/src/classification/depth/avx2_32.rs:14-14 | crates/rsonpath-lib/src/classification/depth/avx2_64.rs:14-14 | crates/rsonpath-lib/src/classification/depth/avx512_64.rs:14-14 | crates/rsonpath-lib/src/classification/depth/neon_64.rs:14-14 | crates/rsonpath-lib/src/classification/depth/nosimd.rs:47-63 | crates/rsonpath-lib/src/classification/depth/sse2_32.rs:14-14 | crates/rsonpath-lib/src/classification/depth/sse2_64.rs:14-14 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 1 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/depth/avx2_32.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7454c04a11f16ff18bd3bd340e2e6a96b147683ce0acf070a53862a88ef4e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/rsonpath-lib/src/input/padding.rs:328-339 | crates/rsonpath-lib/src/input/padding.rs:373-385 | crates/rsonpath-lib/src/input/padding.rs:412-423 | crates/rsonpath-lib/src/input/padding.rs:443-454 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/input/padding.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"3124e203c805714f5bcbb13c9cd32169d57bc56d7df08e420e8633d4a5fa0502"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/rsonpath-lib/src/automaton.rs:190-196 | crates/rsonpath-lib/src/automaton.rs:221-227 \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":"crates/rsonpath-lib/src/automaton.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6707a6ee52434e7e8d58da686e80be8c222f2a2002ab0f6b1c93d060ebc500c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): crates/rsonpath-lib/src/input/padding.rs:209-215 | crates/rsonpath-lib/src/input/padding.rs:225-230 | crates/rsonpath-lib/src/input/padding.rs:387-397 | crates/rsonpath-lib/src/input/padding.rs:425-434 \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":"crates/rsonpath-lib/src/input/padding.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b30d6ede27acf341661ff2e43871780c68a901512cb5030d22f0cb938a4d263"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/rsonpath-lib/src/classification/memmem/avx512_64.rs:157-166 | crates/rsonpath-lib/src/classification/memmem/neon_64.rs:203-212 | crates/rsonpath-lib/src/classification/memmem/nosimd.rs:82-91 \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":"crates/rsonpath-lib/src/classification/memmem/avx512_64.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3f811f2e6a55f112322c85927fc186d745329afc04cda902c00a7b3916d3cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/rsonpath-lib/src/classification/structural/avx2_32.rs:30-41 | crates/rsonpath-lib/src/classification/structural/avx512_64.rs:29-40 \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":"crates/rsonpath-lib/src/classification/structural/avx2_32.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81341f1e2f49aec6d629450709c6ce314d70e906814b132e518ad9da63d8b69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/rsonpath-syntax/src/num.rs:686-691 | crates/rsonpath-syntax/src/num.rs:773-779 | crates/rsonpath-syntax/src/num.rs:864-870 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/num.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e714e4cda4786d9c27ae0855e02f811243bb6ef1a2f313e6598afce5b6157d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/rsonpath-syntax/src/num/error.rs:95-104 | crates/rsonpath-syntax/src/num/error.rs:123-132 \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":"crates/rsonpath-syntax/src/num/error.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af5198f6a2a52eefdeadcc6608b8dc00fadf3cb55254fcbad995794335c4200"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/rsonpath-lib/src/input/padding.rs:287-295 | crates/rsonpath-lib/src/input/padding.rs:526-536 \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":"crates/rsonpath-lib/src/input/padding.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0950366034b3a8ffcf35ea6ab80abeb7aacf2a7f769e0b415a2c6042bb0394a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/rsonpath-lib/src/input/padding.rs:569-585 | crates/rsonpath-lib/src/input/padding.rs:588-604 | crates/rsonpath-lib/src/input/padding.rs:607-623 \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":"crates/rsonpath-lib/src/input/padding.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee58781f3ba7dc221e40c9137a55a26babd0cf786ad8bc3f4cc5d07696d4b30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 1\u002B corresponding lines): crates/rsonpath-lib/src/classification/structural/avx2_32.rs:12-12 | crates/rsonpath-lib/src/classification/structural/avx2_64.rs:13-13 | crates/rsonpath-lib/src/classification/structural/avx512_64.rs:11-11 | crates/rsonpath-lib/src/classification/structural/neon_64.rs:13-13 | crates/rsonpath-lib/src/classification/structural/nosimd.rs:185-195 | crates/rsonpath-lib/src/classification/structural/ssse3_32.rs:13-13 | crates/rsonpath-lib/src/classification/structural/ssse3_64.rs:13-13 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 1 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/structural/avx2_32.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68d1b3d1f868466ccdaed12b6ae426ce2e3decb715cf5edc1e9b157f9707e6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/rsonpath-lib/src/input/owned.rs:47-58 | crates/rsonpath-lib/src/input/borrowed.rs:44-54 \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":"crates/rsonpath-lib/src/input/owned.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"04aba43350c7ef11821c8cd72353b89449ba4aad97ba441edbfc4c74912f43d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 1\u002B corresponding lines): crates/rsonpath-lib/src/classification/quotes/avx2_32.rs:8-8 | crates/rsonpath-lib/src/classification/quotes/avx2_64.rs:8-8 | crates/rsonpath-lib/src/classification/quotes/avx512_64.rs:8-8 | crates/rsonpath-lib/src/classification/quotes/neon_64.rs:8-8 | crates/rsonpath-lib/src/classification/quotes/nosimd.rs:125-135 | crates/rsonpath-lib/src/classification/quotes/sse2_32.rs:8-8 | crates/rsonpath-lib/src/classification/quotes/sse2_64.rs:8-8 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 1 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/quotes/avx2_32.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f563593e8d0991f8da1596b2133d5ee58a04f3b5f7712d64184cf1e8d54c2a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 1\u002B corresponding lines): crates/rsonpath-lib/src/classification/depth/avx2_32.rs:14-14 | crates/rsonpath-lib/src/classification/depth/avx2_64.rs:14-14 | crates/rsonpath-lib/src/classification/depth/avx512_64.rs:14-14 | crates/rsonpath-lib/src/classification/depth/neon_64.rs:14-14 | crates/rsonpath-lib/src/classification/depth/nosimd.rs:34-37 | crates/rsonpath-lib/src/classification/depth/sse2_32.rs:14-14 | crates/rsonpath-lib/src/classification/depth/sse2_64.rs:14-14 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 1 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/depth/avx2_32.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd7407a618b39fdcfb2cbbf2de44d090e2f5d00927f981cb5e80389a26afe03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): crates/rsonpath-lib/src/classification/memmem/neon_64.rs:116-137 | crates/rsonpath-lib/src/classification/memmem/neon_64.rs:164-185 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:116-137 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:164-185 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/memmem/neon_64.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/memmem/sse2_64.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 91 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 \u0060crates/rsonpath-lib/src/classification/memmem/neon_64.rs:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/memmem/neon_64.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5374b1c396787530dc9df79356ee0d14aaa4e1907e4cc60e481e17fcbd811335"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:54-75 | crates/rsonpath-lib/src/classification/memmem/avx512_64.rs:53-74 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/memmem/avx2_32.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/memmem/avx512_64.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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 \u0060crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:54\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":"crates/rsonpath-lib/src/classification/memmem/avx2_32.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbca76d728044bdcbf62be20e540d779978318420b459e0a2b587861fe33497e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 6): crates/rsonpath-lib/src/classification/memmem/neon_64.rs:55-75 | crates/rsonpath-lib/src/classification/memmem/neon_64.rs:107-127 | crates/rsonpath-lib/src/classification/memmem/neon_64.rs:155-175 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:55-75 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:107-127 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:155-175 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/memmem/neon_64.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/memmem/sse2_64.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 91 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 \u0060crates/rsonpath-lib/src/classification/memmem/neon_64.rs:55\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/memmem/neon_64.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8327b398c1483d5e86ee2bfeb9292896c3f570a177765444b4b2b6bf11485159"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 4): crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:65-83 | crates/rsonpath-lib/src/classification/memmem/neon_64.rs:75-95 | crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:65-83 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:75-95 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/memmem/avx2_64.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/memmem/neon_64.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 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 \u0060crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:65\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":"crates/rsonpath-lib/src/classification/memmem/avx2_64.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"456a410c24c3a56ef7fedcbac56a025b86abe76f2d10b37dc7a3e2e2c74d4641"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:87-107 | crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:123-143 \u2014 both copies are in the same file, so extract the block 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":"crates/rsonpath-lib/src/classification/memmem/avx2_32.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e98f2b21894b1507c75a8c530c2edfc19981c424c248ca7eb943fa5b8158e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/rsonpath-lib/src/classification/memmem/avx512_64.rs:86-106 | crates/rsonpath-lib/src/classification/memmem/avx512_64.rs:122-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/memmem/avx512_64.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"41618cbeede2010482b778803c39d99e10de208a521a3ce89e84d04bb6c45f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): crates/rsonpath-lib/src/classification/quotes/shared/mask_32.rs:56-75 | crates/rsonpath-lib/src/classification/quotes/shared/mask_64.rs:56-75 | crates/rsonpath-lib/src/classification/quotes/shared/mask_neon.rs:52-71 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/quotes/shared/mask_64.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/quotes/shared/mask_neon.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060quotes\u0060 to \u0060u32\u0060 in one and \u0060u64\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":"crates/rsonpath-lib/src/classification/quotes/shared/mask_32.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff981778a1c5cf1149610bbda016a59a9489d7290b743e339421d7d6054a9a49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/rsonpath-syntax-proptest/src/lib.rs:327-346 | crates/rsonpath-syntax-proptest/src/lib.rs:353-372 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/rsonpath-syntax-proptest/src/lib.rs:327\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":"crates/rsonpath-syntax-proptest/src/lib.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e90a9fb4dbff14fc4f3c75a16fde8aeb68093218b3678a0700dcd4b8f352c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/rsonpath-lib/src/classification/structural/shared/mask_32.rs:39-57 | crates/rsonpath-lib/src/classification/structural/shared/mask_64.rs:39-57 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/structural/shared/mask_32.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/structural/shared/mask_64.rs\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. 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":"crates/rsonpath-lib/src/classification/structural/shared/mask_32.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d1ca500eef6ebc31586a98e422f8aacedfdbd2a8d4295a455f83395536256a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:99-116 | crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:135-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:99\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":"crates/rsonpath-lib/src/classification/memmem/sse2_32.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"044f7d4f196a93a118a6f6b31fe0347f22877f0cef41671d4f9c96d5dd32f9b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/rsonpath-lib/src/classification/structural/neon_64.rs:33-50 | crates/rsonpath-lib/src/classification/structural/ssse3_64.rs:33-50 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rsonpath-lib/src/classification/structural/neon_64.rs:33\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":"crates/rsonpath-lib/src/classification/structural/neon_64.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd34324877313145bcf9d41216eb69a7c013029d09c986f8b94e6d2389685143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/rsonpath-lib/src/classification/depth/neon_64.rs:43-59 | crates/rsonpath-lib/src/classification/depth/sse2_64.rs:43-59 \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 \u0060crates/rsonpath-lib/src/classification/depth/neon_64.rs:43\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":"crates/rsonpath-lib/src/classification/depth/neon_64.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"55862a146ecce508abe084d12cba103782144d9e2fd106b6a433442155dc0427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:93-108 | crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:129-144 | crates/rsonpath-lib/src/classification/memmem/avx512_64.rs:92-107 | crates/rsonpath-lib/src/classification/memmem/avx512_64.rs:127-142 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/memmem/avx2_32.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/memmem/avx512_64.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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 \u0060crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:93\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":"crates/rsonpath-lib/src/classification/memmem/avx2_32.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f70e8e3b7a0b1c264adb1e04093bb2bbc0c78a3eb664f5ccaeed04897222ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:99-113 | crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:134-147 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:99\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":"crates/rsonpath-lib/src/classification/memmem/avx2_64.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7356027442b7acee7b1a5fb2b6fd7a9e20bfc5827517722ebefceb814e1c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/rsonpath-lib/src/classification/quotes/neon_64.rs:32-46 | crates/rsonpath-lib/src/classification/quotes/sse2_64.rs:32-46 \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 \u0060crates/rsonpath-lib/src/classification/quotes/neon_64.rs:32\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":"crates/rsonpath-lib/src/classification/quotes/neon_64.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa42220cbcaa90aa62bbbd30739ab26ec4a0edc1ee219a8d7b2099edc58798d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/rsonpath-lib/src/input/borrowed.rs:161-175 | crates/rsonpath-lib/src/input/mmap.rs:120-132 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rsonpath-lib/src/input/borrowed.rs:161\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":"crates/rsonpath-lib/src/input/borrowed.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd63cf2d7985eff105171346d48206c7bd6302f810a1841cc7daf807e5a4f256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 6): crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:105-116 | crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:140-149 | crates/rsonpath-lib/src/classification/memmem/neon_64.rs:127-140 | crates/rsonpath-lib/src/classification/memmem/neon_64.rs:175-188 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:127-140 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:175-188 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/memmem/avx2_64.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/memmem/neon_64.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 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 \u0060crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:105\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":"crates/rsonpath-lib/src/classification/memmem/avx2_64.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a71e5391676451886c5a7d1060df1c9ac0adc914d36268e27755cd49748a5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/rsonpath-lib/src/input/borrowed.rs:268-281 | crates/rsonpath-lib/src/input/borrowed.rs:323-336 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/rsonpath-lib/src/input/borrowed.rs:268\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":"crates/rsonpath-lib/src/input/borrowed.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e24dc7af9ba99ef658efb47fae4d681bf82f61dd06329057a171194b1b5b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 6): crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:58-70 | crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:66-78 | crates/rsonpath-lib/src/classification/memmem/avx512_64.rs:57-69 | crates/rsonpath-lib/src/classification/memmem/neon_64.rs:78-90 | crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:66-78 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:78-90 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/memmem/avx2_32.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/memmem/avx512_64.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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":"crates/rsonpath-lib/src/classification/memmem/avx2_32.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50c1ce2380692f9a6e5c45a0cd281114977ebfa6c050997489c1e41191a8679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/rsonpath-lib/src/classification/depth/avx2_64.rs:48-60 | crates/rsonpath-lib/src/classification/depth/avx512_64.rs:50-62 | crates/rsonpath-lib/src/classification/depth/neon_64.rs:50-62 | crates/rsonpath-lib/src/classification/depth/sse2_64.rs:50-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rsonpath-lib/src/classification/depth/avx2_64.rs:48\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":"crates/rsonpath-lib/src/classification/depth/avx2_64.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfd03c2a08d8c3b37c5b36a72191d6e53a762002b11585b018a4abf7cd1bc49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rsonpath-lib/src/classification/depth/avx2_32.rs:44-56 | crates/rsonpath-lib/src/classification/depth/sse2_32.rs:48-60 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rsonpath-lib/src/classification/depth/avx2_32.rs:44\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":"crates/rsonpath-lib/src/classification/depth/avx2_32.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdff59daba3838ae8e26ab2bfddf73ba035a5c3a35eeaa83cef1a7782bfc720a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rsonpath-lib/src/classification/depth/shared/mask_32.rs:50-62 | crates/rsonpath-lib/src/classification/depth/shared/mask_64.rs:49-61 \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 \u0060crates/rsonpath-lib/src/classification/depth/shared/mask_32.rs:50\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":"crates/rsonpath-lib/src/classification/depth/shared/mask_32.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"228d837a2938c9343278befb70101dce071f74650cace60b005dc5cee25b94be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/rsonpath-lib/src/classification/quotes/shared/mask_64.rs:81-93 | crates/rsonpath-lib/src/classification/quotes/shared/mask_neon.rs:76-88 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/quotes/shared/mask_64.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/quotes/shared/mask_neon.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rsonpath-lib/src/classification/quotes/shared/mask_64.rs:81\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":"crates/rsonpath-lib/src/classification/quotes/shared/mask_64.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"55672527e0f1884d4d4aabafcc54201890ad89dfb1e6ef249f46a07320a30e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rsonpath-lib/src/classification/memmem/shared/mask_32.rs:22-32 | crates/rsonpath-lib/src/classification/memmem/shared/mask_64.rs:24-34 \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 \u0060crates/rsonpath-lib/src/classification/memmem/shared/mask_32.rs:22\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":"crates/rsonpath-lib/src/classification/memmem/shared/mask_32.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b070a64cbe6b700c3b8a2dd629cc4ed32b57dc5087e4612bd3186bd5a0f479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/rsonpath-lib/src/input/borrowed.rs:191-201 | crates/rsonpath-lib/src/input/mmap.rs:144-152 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/rsonpath-lib/src/input/borrowed.rs:191\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":"crates/rsonpath-lib/src/input/borrowed.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9486ab7f23158dd8a043d0449435e17423c5dd91d8fbdbd6d4966a60c6449af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rsonpath-lib/src/input/borrowed.rs:257-266 | crates/rsonpath-lib/src/input/borrowed.rs:312-321 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/rsonpath-lib/src/input/borrowed.rs:257\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":"crates/rsonpath-lib/src/input/borrowed.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef6b9085359a2cb8e884bda818561e3121fc525a2e294909c949a23e9723c55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:55-63 | crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:95-103 | crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:131-139 \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 \u0060crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:55\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/memmem/sse2_32.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"305ae06ea41b1f44716e1aa9968a440ef05a0472300d2e53b111534ada62be29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:160-168 | crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:165-173 \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":"crates/rsonpath-lib/src/classification/memmem/avx2_32.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b087953bd1298ad0b6c07be6ff5605d2b4950c09b35a6bea4f6f25914452ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:168-176 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:204-212 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/memmem/sse2_32.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/memmem/sse2_64.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 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":"crates/rsonpath-lib/src/classification/memmem/sse2_32.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3585b4c6bee1ce58796fe9e67b6ef56e651a2339f1b0169690ad25e1a2d59d90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/rsonpath-syntax/src/parser.rs:202-209 | crates/rsonpath-syntax/src/parser.rs:391-399 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/rsonpath-syntax/src/parser.rs:202\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":"crates/rsonpath-syntax/src/parser.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95330e30a3da505a4605dd6a3ac8a11c8015b45a6678e31dae4d07649daa7fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/rsonpath-lib/src/engine/main.rs:398-405 | crates/rsonpath-lib/src/engine/main.rs:452-459 \u2014 both copies are in the same file, so extract the block 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":"crates/rsonpath-lib/src/engine/main.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07054e917ab16056e31ba5183ce0f71725b7f88d3692106f1c61839f4815017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rsonpath-lib/src/classification/memmem/avx2_32.rs:116-122 | crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:124-130 \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":"crates/rsonpath-lib/src/classification/memmem/avx2_32.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd901f8b391f1c7fd6a489ddc3324cd2c53c15abae75b15496bb8c33c902c61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rsonpath-lib/src/classification/memmem/sse2_32.rs:124-130 | crates/rsonpath-lib/src/classification/memmem/sse2_64.rs:148-154 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/memmem/sse2_32.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/memmem/sse2_64.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 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":"crates/rsonpath-lib/src/classification/memmem/sse2_32.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f32661fd374418c813a9308213819f0d251f8b297de54f125987cb44b4e88b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:57-63 | crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:97-103 | crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:132-138 \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 \u0060crates/rsonpath-lib/src/classification/memmem/avx2_64.rs:57\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":"crates/rsonpath-lib/src/classification/memmem/avx2_64.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bccc02794fbf63be15523f988df6be924d0dedbb4d871db16184eb278cd7db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/rsonpath-benchmarks/src/dataset.rs:167-177 | crates/rsonpath-benchmarks/src/dataset.rs:197-207 \u2014 both copies are in the same file, so extract the block 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":"crates/rsonpath-benchmarks/src/dataset.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f899fb8139efaa2947353c98ef835683ffac62f519ce93552031b6d02dae067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/rsonpath-lib/src/input/padding.rs:273-281 | crates/rsonpath-lib/src/input/padding.rs:511-519 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/rsonpath-lib/src/input/padding.rs:273\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/input/padding.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3dbb56b3ac0ded2864f98b2648c144a201eb65b6fa141d9db4b5d1df4bbc36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rsonpath-benchmarks/src/implementations/jsonpath_rust.rs:35-41 | crates/rsonpath-benchmarks/src/implementations/serde_json_path.rs:32-38 \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":"crates/rsonpath-benchmarks/src/implementations/jsonpath_rust.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"769a08cba9ee106de928cb4ca85a1e553c4adb69c60c78ea3b08721a79a75a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/rsonpath-lib/src/classification/depth/shared/vector_128.rs:13-20 | crates/rsonpath-lib/src/classification/depth/shared/vector_256.rs:13-20 | crates/rsonpath-lib/src/classification/depth/shared/vector_512.rs:13-20 | crates/rsonpath-lib/src/classification/depth/shared/vector_neon.rs:10-17 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/depth/shared/vector_128.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba36b987520e583b6f9b9bd86f2c69a4f6c0c7d8d82089d282ee66288a33d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/rsonpath-lib/src/classification/quotes/shared/mask_32.rs:31-35 | crates/rsonpath-lib/src/classification/quotes/shared/mask_64.rs:31-35 | crates/rsonpath-lib/src/classification/quotes/shared/mask_neon.rs:27-31 \u2014 before extracting anything, compare \u0060crates/rsonpath-lib/src/classification/quotes/shared/mask_64.rs\u0060 and \u0060crates/rsonpath-lib/src/classification/quotes/shared/mask_neon.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060quotes\u0060 to \u0060u32\u0060 in one and \u0060u64\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":"crates/rsonpath-lib/src/classification/quotes/shared/mask_32.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a2853bedb11df50e1f9bf8976fd343da65047e8a4d2ea939a5489a21cc018d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rsonpath-lib/src/classification/quotes/avx2_32.rs:22-31 | crates/rsonpath-lib/src/classification/quotes/avx512_64.rs:22-31 \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":"crates/rsonpath-lib/src/classification/quotes/avx2_32.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"637eec682de85597e4d8c8d863481e43840f0c96986eae4cc5a385a4fbf88291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/rsonpath-lib/src/result/nodes.rs:245-256 | crates/rsonpath-lib/src/result/nodes.rs:374-385 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/result/nodes.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0866b5db0b3a780857a1e1550fa576f1f87e7e47170bb6f279dd827d2e7721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/rsonpath-lib/src/result/nodes.rs:228-237 | crates/rsonpath-lib/src/result/nodes.rs:342-351 \u2014 both copies are in the same file, so extract the block 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 \u0060crates/rsonpath-lib/src/result/nodes.rs:228\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":"crates/rsonpath-lib/src/result/nodes.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6bd8aa64e1bdcfebd602da98fdec097019a53646c978af9e69409d927bf448"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/rsonpath-syntax-proptest/src/lib.rs:228-234 | crates/rsonpath-syntax-proptest/src/lib.rs:270-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax-proptest/src/lib.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c970a60ead16bb0bd1d2e506c3f66cc5cba20d0d673225a7f841dd5a83c4de34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): fuzz/src/query.rs:387-402 | fuzz/src/query.rs:405-420 \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":"fuzz/src/query.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d27108ca5bc3deb6ff77a55312bda3047af112780636c13c5cd6e7d4870dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fuzz/src/query.rs:242-251 | fuzz/src/query.rs:262-271 \u2014 both copies are in the same file, so extract the block 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":"fuzz/src/query.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf510c3838a25fa217e33e299cc89c2bb36cc158c6b9b8d2bae645bfdbaf065"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rsonpath-syntax: rsonpath-syntax: abstractness 0.02, instability 0.00, distance 0.98 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f88869f12ef2984052cfacd495e0c2427c6c74b3c8fd61ac4bf402a348175385"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: /// Hack to convert errors to [\u0060InputError\u0060] easily. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/input/error.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71e7fef1a966ebfed7ac442b0444cc66d615aa35077931dbc0184422fff4b25"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This and is_list can probably be merged into Option\u003CJsonUInt\u003E carrying all the information. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/engine/main.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c921df88b863fd8e722332b68520660357dbda0ba7a2756e7505b659270f61bd"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060crates/rsonpath-benchmarks/Cargo.toml\u0060 makes this repository a deployable product (line 17)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/Cargo.toml"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"400c1785bd927779c7378403c4602414df98e40c6df5bac7e398cf5a049ac1bb"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/rsonpath-lib\u0060 (14260 LoC, 89 module-visible types across 12 directories) overshoots its size bounds. 1 of 5 build unit(s) (Cargo) overshoot their size bounds, lowering Project Cohesion to 6.0/10. 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":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71274dafc7f12b8e2ac7fc24de28544d3a12c0bd95ae533ec9eabe4a128f9668"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0f8524cb88b8ecebe1baaeaecf466d52056f7516482bb09c5e09b1bef14fb54"},"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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"08a42d8383e5f7f239f317df3cd8df5acc793abffe7176b91dc33258194d49f5"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"7e5d3f248b4e8357ec0ef3ded84eae23d9ec0aee3c68abd89b3a98ca3614bd76"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"e07df32842a8463e21478f58e14cf43ab8d07010a952c24a7d0c68c422527072"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"8b71af5411d3c036bc03ad6a84f221cc457598bb10340e1e2e4a33d5f7c5020c"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c9d52f24939b1ffd9f7fab2fb36e6167566993449a7182dc6792ffa2d4a3fce"},"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":"eeef0bf3bcf16b71c5716403c8dcba26b57d87438b49e6900b0ed8d6b9361c79"},"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":"05377593a97987335e56699059f24c27d198356a74363a438577162f1c78684f"},"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":"822d2a5fe4e64deabaaf6c3969834298b72d9d19a49f4bb338f5d4829a636ccd"},"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":"15f046ef403f259ea3f5a06799fe0e12050191e3965e1352dc315830b82fa831"},"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":"3d090cc3819941ea7c02049f7d311c56d5e2e7aa86e3d899e831c11e3090d6de"},"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":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4a0c58aca13bc848c37d4c3d5bcb90f8e046f8df5b386f5a3743d0625ad8dae"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9985e934bf5258966ba30771d636042c3373acbe5f9699173950198ff207d4c4"},"properties":{"dependency":{"package":"git2","version":"0.20.4","advisory":"RUSTSEC-2026-0183","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1eae401a2a8770be38f5a54c3afe36fa4464ebe4004c5fb285ffaa2f1ae4d5b7"},"properties":{"dependency":{"package":"git2","version":"0.20.4","advisory":"RUSTSEC-2026-0184","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"728758c9d3428053e1082b5fb9832c05e2e04dab40233f2ffbfd7792b93201ec"},"properties":{"dependency":{"package":"libz-sys","version":"1.1.28","advisory":"RUSTSEC-2026-0418","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf9b3890cba73cd3c5d5270d1976bd1bae94596a1c510482b94fe9367ef871f2"},"properties":{"dependency":{"package":"memmap2","version":"0.9.10","advisory":"RUSTSEC-2026-0186","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6b844095294426406be0c12ed349cb0d0b3203fb8e955c9c6db438a7dea1e20"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"498b911d4cd0190c68aa32196f580786c437150df33cb3762e2748ce2ddc7644"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 7 of 85 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 85 of the 148 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: crates/rsonpath-lib/src/classification/memmem/neon_64.rs, crates/rsonpath-lib/src/classification/memmem/avx512_64.rs, crates/rsonpath-lib/src/classification/structural/shared/vector_512.rs, crates/rsonpath-lib/src/classification/structural/shared/vector_neon.rs, crates/rsonpath-lib/src/classification/quotes/shared/mask_neon.rs, crates/rsonpath-lib/src/classification/quotes/neon_64.rs, crates/rsonpath-lib/src/classification/quotes/avx512_64.rs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/memmem/neon_64.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0c59092f6c4bead2d2b9f0cc2dc698c3fc93e3af9e1796a2ee8d6b205ec904"}},{"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":"crates/rsonpath-lib/src/classification/memmem/avx512_64.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc044c3a03a2c0d57f57ec08d58597a6dffdde7435e59f251cd509eb6c074df"}},{"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":"crates/rsonpath-lib/src/classification/structural/shared/vector_512.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2217dff39ebae63372789c6192ef2e33e781c0c4ac02929b233985d54c52283"}},{"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":"crates/rsonpath-lib/src/classification/structural/shared/vector_neon.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c07b49620e09923a1893dfcd519718bd8582b46d5f156116b07265f0820925"}},{"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":"crates/rsonpath-lib/src/classification/quotes/shared/mask_neon.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68773de1f109950808ae60565999e8352aece2fd0750b5e25f63168054d4c54a"}},{"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":"crates/rsonpath-lib/src/classification/quotes/neon_64.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15b12237223e3aa1308c801f2e2d6d5c5d1a32b203ac0e160fd468cc3f21543"}},{"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":"crates/rsonpath-lib/src/classification/quotes/avx512_64.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a1ff48b9193d4dc2f5e92012a758127ba4f64c775405f9f8a32fcf1e536d71"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","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":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"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":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 2 public types in \u0060rsonpath_benchmarks.framework.implementation\u0060 are marked as implementation by their own namespace, folder or name: \u0060Implementation\u0060 (crates/rsonpath-benchmarks/src/framework/implementation.rs:3, \u0060implementation\u0060), \u0060PreparedQuery\u0060 (crates/rsonpath-benchmarks/src/framework/implementation.rs:20, \u0060implementation\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/framework/implementation.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbd4d6ef5d69f9e024bf777da4a9eee188bf564c1877e9600462a9a02b09f36"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 3 public types in \u0060rsonpath_benchmarks.implementations.jsonpath_rust\u0060 are marked as implementation by their own namespace, folder or name: \u0060JsonpathRust\u0060 (crates/rsonpath-benchmarks/src/implementations/jsonpath_rust.rs:14, \u0060implementations\u0060), \u0060JsonpathRustResult\u0060 (crates/rsonpath-benchmarks/src/implementations/jsonpath_rust.rs:16, \u0060implementations\u0060), \u0060JsonpathRustError\u0060 (crates/rsonpath-benchmarks/src/implementations/jsonpath_rust.rs:65, \u0060implementations\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/implementations/jsonpath_rust.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"621d212df5991363349f08aba2b6d77f4c9d7ac2a5d2267f41acdf569af42957"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 6 public types in \u0060rsonpath_benchmarks.implementations.rsonpath\u0060 are marked as implementation by their own namespace, folder or name: \u0060Rsonpath\u0060 (crates/rsonpath-benchmarks/src/implementations/rsonpath.rs:11, \u0060implementations\u0060), \u0060RsonpathCount\u0060 (crates/rsonpath-benchmarks/src/implementations/rsonpath.rs:12, \u0060implementations\u0060), \u0060RsonpathMmap\u0060 (crates/rsonpath-benchmarks/src/implementations/rsonpath.rs:13, \u0060implementations\u0060), \u0060RsonpathMmapCount\u0060 (crates/rsonpath-benchmarks/src/implementations/rsonpath.rs:14, \u0060implementations\u0060), \u0060RsonpathError\u0060 (crates/rsonpath-benchmarks/src/implementations/rsonpath.rs:169, \u0060implementations\u0060), \u0060MatchDisplay\u0060 (crates/rsonpath-benchmarks/src/implementations/rsonpath.rs:182, \u0060implementations\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/implementations/rsonpath.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8106bf0dc5722db91b240036e087b5e3620be80dc902905a9aa0122ea35a203a"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 3 public types in \u0060rsonpath_benchmarks.implementations.serde_json_path\u0060 are marked as implementation by their own namespace, folder or name: \u0060SerdeJsonPath\u0060 (crates/rsonpath-benchmarks/src/implementations/serde_json_path.rs:11, \u0060implementations\u0060), \u0060SerdeJsonPathResult\u0060 (crates/rsonpath-benchmarks/src/implementations/serde_json_path.rs:13, \u0060implementations\u0060), \u0060SerdeJsonPathError\u0060 (crates/rsonpath-benchmarks/src/implementations/serde_json_path.rs:60, \u0060implementations\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/implementations/serde_json_path.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"71406c387ae3e6526674a66fc2f79b7f213f1dbb1c00cb95062afca4bb120ee2"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 2/4 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/rsonpath-benchmarks\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch gitsubmodule: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060gitsubmodule\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"189dbbebbc083d2f437329c82dc1cae8adbf1b7293a5bc9e2de708f747e84eda"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!self.are_commas_on \u0026\u0026 !self.are_colons_on\u0060 appears character-identically in 2 files \u2014 crates/rsonpath-lib/src/classification/structural/nosimd.rs, crates/rsonpath-lib/src/classification/structural/shared.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":"crates/rsonpath-lib/src/classification/structural/nosimd.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb577dcfae8af147ab11b543d49a19617a0884e6e7efa4db0b9259d96948fee6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060member.quoted() == slice \u0026\u0026 (from == 0 || bytes[from - 1] != b\u0027\\\\\u0027)\u0060 appears character-identically in 4 files \u2014 crates/rsonpath-lib/src/input/borrowed.rs, crates/rsonpath-lib/src/input/buffered.rs, crates/rsonpath-lib/src/input/mmap.rs, crates/rsonpath-lib/src/input/slice.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":"crates/rsonpath-lib/src/input/borrowed.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5536b4160c0dc48748292e0822eb561fb7b9d3d006c3c82b3d86de0dba18069e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060offset \u002B idx \u003E 1 \u0026\u0026 input .is_member_match(offset \u002B idx - 2, offset \u002B idx \u002B label_size - 2, label) .e()\u0060 appears character-identically in 2 files \u2014 crates/rsonpath-lib/src/classification/memmem/shared/mask_32.rs, crates/rsonpath-lib/src/classification/memmem/shared/mask_64.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":"crates/rsonpath-lib/src/classification/memmem/shared/mask_32.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d914c08137126d83435bbd045c7617e41ed6809407b4398c9248441fb7cb34c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.are_commas_on \u0026\u0026 self.are_colons_on\u0060 appears character-identically in 2 files \u2014 crates/rsonpath-lib/src/classification/structural/nosimd.rs, crates/rsonpath-lib/src/classification/structural/shared.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":"crates/rsonpath-lib/src/classification/structural/nosimd.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8c9c6b3d5504242967d487dea31f3a0534869d3bef53bb7414513d1b25ba94"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.cases.iter_mut().find(|x|x.test_case.name==name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060add_special_case_tag\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-test/src/lib.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a072fc5c7cc25dadb9026c00ddcdb68a465a58ca98c7a4c386327cf12d301e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060JsonInt::try_from(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060any_json_int\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax-proptest/src/lib.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30d714eeb031638aa76f39fd276ebe4a2230371e529c5428990119b0fc409b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060JsonInt::try_from(i)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rsonpath_valid_json_int\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax-proptest/src/lib.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"3804e878172ddc0734a11c0bc2318bb14c665ac58863df52df3984c0e291baa9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060JsonFloat::try_from(f)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060any_json_float\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax-proptest/src/lib.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"e774a42a01b96065f557dad18f677b9cac227459878a86a4074b9628ca366c34"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060JsonFloat::try_from(f)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060any_json_float\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax-proptest/src/lib.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6324680a6cf04da2ac2f53a164f8adee1f7f243c7661d9c72cc58184a87c3e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.find(\u0027.\u0027).unwrap_or(s.len()).try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060arbitrary_exp_repr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax-proptest/src/lib.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"e039f3816078e3d3a25571dda12e3c1d9a45250e666e169a22c14c900001a785"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value.abs().try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/lib.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1742e902867057fc625bbc2d44500976fff607c465054013ea07f14964462fa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value.abs().try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/lib.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2099edef630cd3904d627b2327bab935145ef64963ba1201d5b293d908ccd89"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.inner.drain(..).next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060into_singular\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/lib.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"29703a775584abc6305c614bb38fc520954cd0f900445be9cba7922fe2606db7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.partial_cmp(\u0026other.0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060cmp\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/num.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5ca9c5ec4404a6c01fa439d335e36fd963769de9f881ecc68ca16069659032"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chars.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/num.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d08f7538b3cf4b6447b156bc603f2dc9c5cf472d1c65095e8e7fc07faee2528"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.options.recursion_limit\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parse_json_path_query\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/parser.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c117bf796e40cd3ba41fe7ff2bf3ab110a3bb0fb35b337005fab74693a681f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060int.abs().try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parse_directional_int\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/parser.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f478c0127f975b4dacab97a583a0faea630b400f5d45b6cd8560d2e4ff0bfd5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060char::from_u32(n)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060read_escape_sequence\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/parser.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9d41a51e98118b675e051481bcc1cbf487077f1dc511c721dff766f81672f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060char::from_u32(raw_c)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060read_escape_sequence\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/parser.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae56dbcf045bce60992611c2c60974221d3313063cfc77ad840d9adc0d0edc9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(result,\u0022\\\\u{:0\u003E4x}\u0022,c as u8)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060escape\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/str.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c26f2409413ff9c9b7f8716c7400430f7291d6dd3fa22c96adf5f4f10c4e3f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060diffs.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-syntax/src/error/display.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d3e5ad0ad2fae0c4915c45f25453b1051fc4c0e290f492c3025881e9add138"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(label.unquoted())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fmt\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/automaton.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f1e46d3b8cebab3207a1a705a98964752f4163ae7e01692fd2cb819734b48c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stack.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060record_end\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/result/approx_span.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"048363b4dc104674bf651a6e1287fec4706c3f4bb5125a42c1a31a832b3de03d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.node.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060record_value_terminator\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/result/nodes.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7cadc490f7da7733de18b6075ab08f990abd048f550d9c30e4315c9e326572"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stack.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060record_value_terminator\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/result/nodes.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca58b6144daf0776c2492d8e3a196c73608e4609feb18acb322d6437e7c24c6e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060node\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060output_to\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/result/output_queue.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"339906fb9d96c962fe147d3e43c9ac50aa7c724b6996b405b0880465392a2179"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tail_skip.classifier.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060skip\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/engine/tail_skipping.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da962048d71736ecade524a09102525ac2cb2d1019b31b1e2d8dde1b76f3372"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.classifier\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060stop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/engine/tail_skipping.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62fb9b91406989557f9fd352688c6b2ed5a1fbe7a968eb6c137d6403aed5b35"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.classifier.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060deref\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/engine/tail_skipping.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baa7fe49ce7393975a814b58c1210b37037accb3e42f6a43419172d57d84233"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.classifier.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060deref_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/engine/tail_skipping.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b921d79cd630270d4bc20da0a69f5e97602f2aa144dd4aabef7f2288995ba0b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SimdConfiguration::try_parse(\u0026simd)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060configure\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/classification/simd.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"2442ea0d0450fa4898e559e6bad2057bd4bd7b18605bd06e13d0067cafd5c080"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u64::try_from(gcd)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060solve_linear_congruence\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/automaton/array_transition_set.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"884fc03a63d67b84b71812620159812a9b7b0e0c867de957cc4124f9d5edc97a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(label.unquoted())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060stringify_label\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-lib/src/automaton/nfa.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"86476ea9ba97c73277d2f351fbac05546123dc26b8ac0e7b2bff71c5a61a865e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ProgressStyle::with_template(\u0022{msg} {spinner} {wide_bar:.green/white} {bytes:\u003E12}/{total_bytes:\u003E12} ({bytes_per_sec:\u003E12}) {eta:\u003E10}\u0022,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_progress_bar\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/dataset.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae89d4c3a8c61b1c4f7939e318c2552f4bc9b1e2f8fb8d7fccc41f87d4eef41e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u64::try_from(bench.json_document.size_in_bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/framework.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d548030113f8b8e64571e0ea19d7361fb1cfe89ea5dbae6b6c8ada86f09c455"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.implementation.load_file(file_path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/framework.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd95b6908f13c7fbf6ed43ac93fc81bf234679a867de94c6773002336b5f645f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.implementation.compile_query(query_string)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/framework.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f86160875dc7cdfa0bc5d2dc4bc8438fc83d156723a1383d9da7170c6e9dca2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.implementation.run(q,f)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060run\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/framework.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5449142febe9027ae0f8ebe5befedf3fbbc74061b98e730f75e1bcbb9f829df8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rsonpath_syntax::parse(query)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compile_query\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/implementations/rsonpath.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"584658146a0839d5ffa529ff5b5c99b5d2f7de6a1702f3f3856a4dffc4710bff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rsonpath_syntax::parse(query)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compile_query\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/implementations/rsonpath.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b199a2c41934d76136e315e8181f6f4f221cec143fb35a5445f02ac28866ae59"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rsonpath_syntax::parse(query)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compile_query\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/implementations/rsonpath.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b89ee6d6f84e9f1099391a6d2770bf3539731f827297dc2237767596be3ef1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rsonpath_syntax::parse(query)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compile_query\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/rsonpath-benchmarks/src/implementations/rsonpath.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a820e2a4cb9286350968c92aa314d61faadeb53f705b083e38e787cac8076d"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-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-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-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"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":28,"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."]}]}