{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"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":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"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":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"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":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"analyze.main (cyclomatic 53): analyze.main has cyclomatic complexity 53 (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":"profiling/analyze.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"890364ac5770b3eff271fb6617d3af800136476114097f95a5bd4242d4cc18c8"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze_mt.main (cyclomatic 42): analyze_mt.main has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze_mt.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8716d32265e12b83a62a5e048ba5a1942166903c1be601b4d1c2ff7c591c2d06"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::o200k_family::o200k_extended_masks (cyclomatic 38): gigatoken::pretokenize::fast::o200k_family::o200k_extended_masks has cyclomatic complexity 38 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"b518e164a0a3137210f43e45f1dc719b498d7b0d3f8677c44f344c94f583162d"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::o200k_family::o200k_algebra (cyclomatic 35): gigatoken::pretokenize::fast::o200k_family::o200k_algebra has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ba2936c5323c758af0d5204d2432c67d1d2ec122111cfd89b1b631a840dc07"}},{"ruleId":"D1","level":"warning","message":{"text":"MaskState::fill_spans_two_phase_impl (cyclomatic 32): MaskState::fill_spans_two_phase_impl has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/mask.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"533428b8a819350c74f6d6532c50f5b418bc4f4da23ca725c1f86e00238c2bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"PretokenizerIter::next_state_machine (cyclomatic 31): PretokenizerIter::next_state_machine has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/state_machine.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"116754a28783bfb82b5d041c07c105e06685342dd0393eacaea062297b57084f"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::cl100k::advance_pos (cyclomatic 30): gigatoken::pretokenize::fast::cl100k::advance_pos has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca85fe7c0b401713b5f1ca192a8117dfb84357441e2099f6477a088380e3992"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::olmo3::advance_pos (cyclomatic 30): gigatoken::pretokenize::fast::olmo3::advance_pos has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/olmo3.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43731f0b2582346dd9b11d20231903258b1509e60ff04a249f4eb58b8400bc1"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::qwen2::advance_pos (cyclomatic 30): gigatoken::pretokenize::fast::qwen2::advance_pos has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/qwen2.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab53b3b04259e5f9f6ac7969bc5f607fd3d15b4bb97bf67952ad535e51f7364"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::qwen3_5::advance_pos (cyclomatic 30): gigatoken::pretokenize::fast::qwen3_5::advance_pos has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/qwen3_5.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d96f20f4e132ed23a507fce7782863104e0e46e4c3810b5562e0ba3fd2ea82"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::o200k_family::advance_pos (cyclomatic 29): gigatoken::pretokenize::fast::o200k_family::advance_pos has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2614bc157b23fcb169f49a2eda0d45641a109f313f0b1afa01d4adb159c94d1e"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::deepseek_v3::advance_main (cyclomatic 28): gigatoken::pretokenize::fast::deepseek_v3::advance_main has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/deepseek_v3.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ff6518af6de2c79177d82915c644d232367f0604b45be2dacc48eacd9a9d5e"}},{"ruleId":"D1","level":"warning","message":{"text":"SentencePieceBPE::encode_units_impl (cyclomatic 25): SentencePieceBPE::encode_units_impl has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/sentencepiece.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"81eed6f8195042f7135009932dffa1ea2df88ed21bfb9d2c7a89652a065752f9"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::cl100k_family::family_algebra (cyclomatic 24): gigatoken::pretokenize::fast::cl100k_family::family_algebra has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"af24ad9df3dd52513b79f9e6fb0517feba699b024e110fa172617b42a6f63548"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::reference::simd::count_pretokens (cyclomatic 23): gigatoken::pretokenize::reference::simd::count_pretokens 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":"src/pretokenize/reference/simd.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f732cd2c51495086aec866bcd1f8bb835b45115a7a93c77dfe2a1ca95924b5"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::r50k::advance_pos (cyclomatic 22): gigatoken::pretokenize::fast::r50k::advance_pos has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/r50k.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd3ab226ee87fb0bcbb598b271cd35267d5b5858d49b60f22d63d17623147fa"}},{"ruleId":"D1","level":"warning","message":{"text":"_cli.bench (cyclomatic 22): _cli.bench has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_cli.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db901d6627bdbf1ff85ea6e64e142d80743a80146ccf5544332e450c5c76bc2"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::bpe_train::train_bpe (cyclomatic 21): gigatoken::bpe_train::train_bpe has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe_train.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efdff39ba258a465d69bfed0f8e839d31faa14b1d7e3ee7a47f10f7885067fb"}},{"ruleId":"D1","level":"warning","message":{"text":"_cli._cpu_info (cyclomatic 21): _cli._cpu_info has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_cli.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"942855f910f7e094df8efda99bbdaa9be82760abf015a8e99733eb737072609a"}},{"ruleId":"D1","level":"warning","message":{"text":"PrecompiledCharsmap::normalize_into (cyclomatic 20): PrecompiledCharsmap::normalize_into 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":"src/bpe/sentencepiece.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b3210b386875ae01eac4c649ba1f272d753a0f2f04949cc6001db9e62705a9"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::mask::classify_uni_chars (cyclomatic 19): gigatoken::pretokenize::fast::mask::classify_uni_chars has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/mask.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a8c33a3c12b4a3c6d718024404fb4f0dce8e290fe45cf382d179a4ecc83561"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::o200k_family::prev_tail_absorbed (cyclomatic 18): gigatoken::pretokenize::fast::o200k_family::prev_tail_absorbed has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"da06857a09b2e8342efe45eba9672856be65beaba13900b89dec7868175d87f9"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::r50k::extended_masks (cyclomatic 18): gigatoken::pretokenize::fast::r50k::extended_masks has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/r50k.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab490a2de2a3402dec607470076cb9ed728014ee4a425a0e33d1365039c43a0a"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::reference::combinator::pretoken (cyclomatic 18): gigatoken::pretokenize::reference::combinator::pretoken has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/combinator.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"389fbf0e762f08c34a4fd316d68f674996a19933148a6a19f72b1fea40686a49"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze_mt.categorize (cyclomatic 18): analyze_mt.categorize has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze_mt.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78bd3ebef8b5926e3d34be4f8be999ffba73ef43b5549b31aaa7c66e3b61612"}},{"ruleId":"D1","level":"warning","message":{"text":"pmu_summary.parse_metric_table (cyclomatic 18): pmu_summary.parse_metric_table has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/pmu_summary.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5828b6166db581b2f0efa27a675652bfbaa4647492cc8bd4588860d921ba1f7"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::o200k_family::classify_uni_o200k (cyclomatic 17): gigatoken::pretokenize::fast::o200k_family::classify_uni_o200k has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f64d62f1a69f88136dacbeb9f378acc1f81cad93abf0a79c0c2b9c401dce86"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::bpe::bpe_merge_symbols_ranked (cyclomatic 16): gigatoken::bpe::bpe_merge_symbols_ranked 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":"src/bpe/mod.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"34875de64f50c0ea088b1829fcfcc2046e3963bb4b8337350db718468fc46029"}},{"ruleId":"D1","level":"warning","message":{"text":"gigatoken::pretokenize::fast::cl100k_family::family_extended_masks (cyclomatic 16): gigatoken::pretokenize::fast::cl100k_family::family_extended_masks 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc87d226e5b166936525a045ac3e9939240eb50c8c086d9aedeff966d092f02a"}},{"ruleId":"D1","level":"warning","message":{"text":"HFCompat._check_call_args (cyclomatic 16): HFCompat._check_call_args has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_hf_compat.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4103a66cf08d99fea50fc936a7c652b9247742668250eb2bcfb5f083c7bf8e47"}},{"ruleId":"D1","level":"warning","message":{"text":"HFCompat.decode (cyclomatic 16): HFCompat.decode 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":"gigatoken/_hf_compat.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"63662e6f4c61ca66ee0e644671185c022dea3089ce85659658cf0871abdb0db6"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze.main (cognitive 93): analyze.main has cognitive complexity 93 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 19 (29 pts), ternaries 7 (16 pts), boolean chains 11, error handling 2 (5 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent 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":"profiling/analyze.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc00b9ca9fb2b6801235bcadc7326567c795c12d2dd2fee3a5ca5f1fc21e599"}},{"ruleId":"D2","level":"warning","message":{"text":"MaskState::fill_spans_two_phase_impl (cognitive 90): MaskState::fill_spans_two_phase_impl has cognitive complexity 90 (threshold 15). Drivers by points: if/else 25 (61 pts), loops 7 (20 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/mask.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d016a41a698ea0771f6f61218db25049ae6d626252d6889420e5fa3b1f9bdef2"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze_mt.main (cognitive 81): analyze_mt.main has cognitive complexity 81 (threshold 15). Drivers by points: loops 17 (26 pts), ternaries 9 (26 pts), if/else 8 (19 pts), boolean chains 7, error handling 1 (3 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent 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":"profiling/analyze_mt.py"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4e65724e213e04fc9f17887b1ad24553fde192f9fd98f5418542f3b8ebfdcc"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::o200k_family::o200k_algebra (cognitive 56): gigatoken::pretokenize::fast::o200k_family::o200k_algebra has cognitive complexity 56 (threshold 15). Drivers by points: if/else 26 (42 pts), boolean chains 8, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c596075121c4114d72a6ef9830e2b4330351db667a40cf0e552293b6a390742"}},{"ruleId":"D2","level":"warning","message":{"text":"SentencePieceBPE::encode_units_impl (cognitive 50): SentencePieceBPE::encode_units_impl has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (31 pts), boolean chains 10, loops 4 (9 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/sentencepiece.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fd2a42372ea5462fd65895bb82de144fba9852c9f98dcb942615517861fe5c"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::o200k_family::o200k_extended_masks (cognitive 49): gigatoken::pretokenize::fast::o200k_family::o200k_extended_masks has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (31 pts), boolean chains 12, match/switch 2 (5 pts), loops 1 (nesting depth added 12). Of this number, 40 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70aa509766ae18cf9feea9e88a00ddde84ce8416cc75593ae8b91b325578d90"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::bpe_train::train_bpe (cognitive 48): gigatoken::bpe_train::train_bpe has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 9 (18 pts), match/switch 1 (2 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe_train.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c543bd1dc746903d896e1e81536cd0899c6d493d0cb66c4c98ba4e6c23b8ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::deepseek_v3::advance_main (cognitive 47): gigatoken::pretokenize::fast::deepseek_v3::advance_main has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (41 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/deepseek_v3.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"6711be30040d594b1868fd87b73c090cb4b964187a2519ba2ba66472e6ce9892"}},{"ruleId":"D2","level":"warning","message":{"text":"PrecompiledCharsmap::normalize_into (cognitive 43): PrecompiledCharsmap::normalize_into has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 2 (8 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/sentencepiece.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"041626f4344e5f4b6684e0213335cd7b5fe8d0a3035611fbcf5ea024368351f8"}},{"ruleId":"D2","level":"warning","message":{"text":"PretokenizerIter::next_state_machine (cognitive 40): PretokenizerIter::next_state_machine has cognitive complexity 40 (threshold 15). Drivers by points: match/switch 8 (23 pts), if/else 7 (16 pts), loops 1 (nesting depth added 24). 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":"src/pretokenize/reference/state_machine.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1b2772cb2067c1af8175a8f4e8e0f27fb7be05e42b15effd1ef53b87c5b501"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::mask::classify_uni_chars (cognitive 40): gigatoken::pretokenize::fast::mask::classify_uni_chars has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (33 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/mask.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53e063c339466eb025f0bfc6ed87df87b0298d10f040e00b20599c4c5c85d64"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::qwen3_5::advance_pos (cognitive 40): gigatoken::pretokenize::fast::qwen3_5::advance_pos has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (32 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/qwen3_5.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"283973c0004490469701a94e2b7651702372a5494c3111ce2707dc80c0e61503"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze_mt.categorize (cognitive 38): analyze_mt.categorize has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 5 (9 pts), boolean chains 3 (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":"profiling/analyze_mt.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd860d3ba083d176dfb2ffa6e8aa2edd6691da5009ffc0ab80dc87ddbeff2675"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::cl100k::advance_pos (cognitive 37): gigatoken::pretokenize::fast::cl100k::advance_pos has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (31 pts), match/switch 2 (4 pts), boolean chains 2 (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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ef1ae254f228883110a336195f03f0768e38fb946c91e2c0706c2772f9d9f5"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::olmo3::advance_pos (cognitive 37): gigatoken::pretokenize::fast::olmo3::advance_pos has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (31 pts), match/switch 2 (4 pts), boolean chains 2 (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":"src/pretokenize/fast/olmo3.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dd2d0a8cfb727ec2663a915bf29ae05869cdfbedf46fae7b59328d1c159331"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::qwen2::advance_pos (cognitive 37): gigatoken::pretokenize::fast::qwen2::advance_pos has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (31 pts), match/switch 2 (4 pts), boolean chains 2 (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":"src/pretokenize/fast/qwen2.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df6da343de0b4efa6f13ccd5af6fc29ee027141b192b32574188f19bbada271"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::o200k_family::advance_pos (cognitive 36): gigatoken::pretokenize::fast::o200k_family::advance_pos has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (30 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2feea76a4b91997a521b104b768d15ad78661701097817d1e86fc06d9d1a9d53"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::o200k_family::prev_tail_absorbed (cognitive 36): gigatoken::pretokenize::fast::o200k_family::prev_tail_absorbed has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 2 (7 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"278ee95a285d9b88986b0d103b98a2dae6a5b1f571d6a36f236ab343ccfd98e7"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::reference::simd::count_pretokens (cognitive 35): gigatoken::pretokenize::reference::simd::count_pretokens has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/simd.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"8697e5d821d02029bce9d9db7a07d8c089017e987106d2c69597049722496d17"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze.atos_resolve (cognitive 35): analyze.atos_resolve has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (10 pts), ternaries 3 (9 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"96290328d12523ef2285e994ad30eef76acbc7fa1507f8cc4efadeef9cae33f8"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze_mt.atos_resolve (cognitive 35): analyze_mt.atos_resolve has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 5 (10 pts), ternaries 3 (9 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze_mt.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e09b3e77e8663c96fe6f5544405e8922458f7f5f4e608557b080aa4c57b602"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::cl100k_family::family_algebra (cognitive 32): gigatoken::pretokenize::fast::cl100k_family::family_algebra has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3499351f762b7a256408f946c9dca5ba5783252910b00bfa7ba72054bfb7a6b6"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::bpe::bpe_merge_symbols_by_rank (cognitive 30): gigatoken::bpe::bpe_merge_symbols_by_rank has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9af4d7efda90abfb5c3c79a8c15b230b4fd8497f4d56fe95449f5fd01605a7"}},{"ruleId":"D2","level":"warning","message":{"text":"_cli.bench (cognitive 30): _cli.bench has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 5 (6 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_cli.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f7ae0cc983ccaaa394d16197d015bf347f21d92092115806d207c7419ddfe9"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::o200k_family::scan_case_run (cognitive 27): gigatoken::pretokenize::fast::o200k_family::scan_case_run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7801f69fc9b440b7c4f15c788eb067bfa5667307e194f82087ed91a259ff31a1"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::r50k::advance_pos (cognitive 27): gigatoken::pretokenize::fast::r50k::advance_pos has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 3 (7 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":"src/pretokenize/fast/r50k.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"802f4e0d060e14ada275d7431c324d2ba2d309813bef53c817d385f54510d4e0"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::bpe::bpe_merge_symbols_ranked (cognitive 26): gigatoken::bpe::bpe_merge_symbols_ranked has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db62384095e5be8283a094d4c00bd2eacc22feb5adf22445a61035e6c06a735"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::reference::combinator::other_run (cognitive 26): gigatoken::pretokenize::reference::combinator::other_run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/combinator.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff75969b58c205fdfe5414fdd0d2f866963237e358262c30d576a3548b53b956"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::reference::simd::count_ws_pretokens (cognitive 26): gigatoken::pretokenize::reference::simd::count_ws_pretokens has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/simd.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"5020698c8a96fb00a4a8f9e4d41d5dd98e383480aedb1b73673b693434184609"}},{"ruleId":"D2","level":"warning","message":{"text":"pmu_summary.parse_remarks (cognitive 26): pmu_summary.parse_remarks has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, ternaries 1 (4 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/pmu_summary.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5024bf5c8d8a20d88dc104d9f8dc98983e8b895e40dd0dac255d91283abceeb9"}},{"ruleId":"D2","level":"warning","message":{"text":"SentencePieceBPE::finalize_speed_paths (cognitive 25): SentencePieceBPE::finalize_speed_paths has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 6 (11 pts), match/switch 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/sentencepiece.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"33699c89885892f2bdc2c8b0fa761ba2fc30faa9ecac416bfabefac3baf5ed78"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::reference::combinator::pretoken (cognitive 25): gigatoken::pretokenize::reference::combinator::pretoken has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/combinator.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"d728ea24cbaaec4f56a5e643f8bcc737924e8e917ae9bbdd4f22fadf8a4f6f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"HFCompat.decode (cognitive 25): HFCompat.decode has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_hf_compat.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"7679b1000fa20ce215c326c1da142fd53db16c8bcf847a640893b7f60c9fb16a"}},{"ruleId":"D2","level":"warning","message":{"text":"pmu_summary.parse_metric_table (cognitive 25): pmu_summary.parse_metric_table has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (9 pts), loops 3 (5 pts), error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/pmu_summary.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa3a1193abb790c1959118834fb8512de52eb164e4e338c5a6b7039874cb43c"}},{"ruleId":"D2","level":"warning","message":{"text":"MaskState::next_span (cognitive 24): MaskState::next_span has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/mask.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bf6e4aaefa62ea8a2f1bcc2f3022366dd44cfdb100ccca6ac373cd492d4abf"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::cl100k_family::family_extended_masks (cognitive 24): gigatoken::pretokenize::fast::cl100k_family::family_extended_masks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d981ee10066ea760c90fc5f73d42e225a9dba132b2413b6f8142168014f2c56"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::r50k::extended_masks (cognitive 24): gigatoken::pretokenize::fast::r50k::extended_masks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/r50k.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1d218cdba92d0ecab7376bfe7a9f3bc907add791093378b40c8b8bb1c70a39"}},{"ruleId":"D2","level":"warning","message":{"text":"_cli._cpu_info (cognitive 24): _cli._cpu_info has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 8, error handling 1 (2 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_cli.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f94cde683c8bb0c519356e05972025f9d34ff61d97b7a72aee93596989be07"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer::encode_pretoken_miss (cognitive 23): Tokenizer::encode_pretoken_miss has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/tiktoken.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e3d4d1cbfb8b6f137364cbaefc1e28f3399c4b1e074a67e8c936616e681d17"}},{"ruleId":"D2","level":"warning","message":{"text":"SimdPretokIter::handle_whitespace (cognitive 23): SimdPretokIter::handle_whitespace has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/simd.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"87583392e1738b7c0a9db9f2ea4ae6730eba3f5bc12d8eac06cdbc15d04609fe"}},{"ruleId":"D2","level":"warning","message":{"text":"SentencePieceBPE::safe_fragment_ranges (cognitive 22): SentencePieceBPE::safe_fragment_ranges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/sentencepiece.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73b8a36d2ca0a57e712fcfea4ecec9ee717e5f3ccfcb834421d820a7dccc836"}},{"ruleId":"D2","level":"warning","message":{"text":"HFCompat._matrix_encoding (cognitive 21): HFCompat._matrix_encoding has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), ternaries 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_hf_compat.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cd4c61eda1b6b6956e907798fb73b32572463d7c92b3af1aa7b960d932cb59"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::bpe::bpe_merge_symbols_short_scalar (cognitive 20): gigatoken::bpe::bpe_merge_symbols_short_scalar has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25a493b35af4782cb0e6df05a31f07799bd1fd90ce5e247d94d28dcb4e8be38"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::deepseek_v3::scan_ps_from (cognitive 20): gigatoken::pretokenize::fast::deepseek_v3::scan_ps_from has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/deepseek_v3.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6d31ac80b1103d0b5d97a2de06ed85d1ec56b85b77560d405d9af7fe024ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"SentencePieceBPE::unit_crossing_pieces (cognitive 19): SentencePieceBPE::unit_crossing_pieces has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/sentencepiece.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aba3a048fcc37523ce0b06d12e4615aa9493a0a87d69e239a4502184804bae8"}},{"ruleId":"D2","level":"warning","message":{"text":"SentencePieceBPE::init_symbols (cognitive 19): SentencePieceBPE::init_symbols has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/sentencepiece.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4313eb7ea2855029b95b53792bd33ddb852a83abc14b2a4ad60cb9d9ed7da0e"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentIter::next (cognitive 19): DocumentIter::next has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/input/mod.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5a26d2366580ee5ade24820bfed0b39fda58de9095a2db03ee170bcf38d155"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::load_tokenizer::hf::build_sentencepiece (cognitive 19): gigatoken::load_tokenizer::hf::build_sentencepiece has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 6, match/switch 3 (6 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/load_tokenizer/hf.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c5de7acd935639994d031cc8c0a1016c7b5c9e3b58db1344b826e9b788f400"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::r50k::advance_ws (cognitive 19): gigatoken::pretokenize::fast::r50k::advance_ws has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/r50k.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc29e15466a12a4f671d0eb32f205a69a6fded6a02ac2a2060a1125750be2118"}},{"ruleId":"D2","level":"warning","message":{"text":"data_view.cp_length_blocks (cognitive 19): data_view.cp_length_blocks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 1 (5 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/data_view.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb91bbb6bd077143265ebc4bb29e20d9561d49c182cc807beeb3f7c4fe2587e"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze.strip_generics (cognitive 19): analyze.strip_generics has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bc7ffbed1f9e276d3ca3498fd63de1f907e10bfb001a5fee0e217167604435"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze_mt.strip_generics (cognitive 19): analyze_mt.strip_generics has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze_mt.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4b57c88670fd03afacb8797dd614bf0550266b41cb8422b5eab6634f82bd55"}},{"ruleId":"D2","level":"warning","message":{"text":"SentencePieceBPE::apply_norm_ops (cognitive 18): SentencePieceBPE::apply_norm_ops has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/sentencepiece.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f26f709a9b961ec11280d7af42bc6b7f483653e3f204fc377b2c2a40a5ec19"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::batch::build_doc_chunks (cognitive 18): gigatoken::batch::build_doc_chunks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5eebc0d99b40a34797b2adf528ec79e71de9f1829c2ab84625fe5ac19c0369f"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::reference::simd::scan_digit_run (cognitive 18): gigatoken::pretokenize::reference::simd::scan_digit_run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (gigatoken::pretokenize::reference::simd::scan_other_run) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/simd.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"530c8e927e73224a0d21eb2a11b74a32d2e36bf6c981fe77be69d77335c604e6"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::reference::simd::scan_other_run (cognitive 18): gigatoken::pretokenize::reference::simd::scan_other_run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (gigatoken::pretokenize::reference::simd::scan_digit_run) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/simd.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c30c7e0c286f4e7a3e0d85a1732ec0a3ff667515ffb235f9d5629704c2d2580"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer::for_each_piece (cognitive 17): Tokenizer::for_each_piece has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/tiktoken.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea6ee83e1e3e1a1e4b3f7290e4ffe553b77fbe6c588bb6f37a795d61ffdba99"}},{"ruleId":"D2","level":"warning","message":{"text":"SeparatorReader::next (cognitive 17): SeparatorReader::next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/input/file_source.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca62a45a4d44ba3aa102183499ee3d62e33607345594151e39a4566b9a6639f"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::batch::encode_chunks_gathered_with_cap (cognitive 17): gigatoken::batch::encode_chunks_gathered_with_cap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52c5ebd8af48fa8af785442b904f4ef21c25746fa5fec875b628aa8567c3a17"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::bindings::padding::pad_truncate_matrix (cognitive 17): gigatoken::bindings::padding::pad_truncate_matrix has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bindings/padding.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"26139d4a67517f4bdcc1678e5a4f47301ac80d56705b8cc521f90245a219070d"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::o200k_family::classify_uni_o200k (cognitive 17): gigatoken::pretokenize::fast::o200k_family::classify_uni_o200k has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa44a735392266bd26700f085a90f5c0cfb0f16e70ac7498e463afe1dba5499"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::r50k::ascii_batch_algebra (cognitive 17): gigatoken::pretokenize::fast::r50k::ascii_batch_algebra has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/r50k.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6a19a57afb5aac3d1cdbaa9cf9a1b3c2cc96b7221a170d7b1a86fad94482e2"}},{"ruleId":"D2","level":"warning","message":{"text":"HFCompat.convert_tokens_to_string (cognitive 17): HFCompat.convert_tokens_to_string has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_hf_compat.py"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fd9bece12a8cefa1306c90e21dd846f609a1792728786b0e90af9729f30415"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze.categorize (cognitive 17): analyze.categorize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e419e8257357090777c0651c599821577c9ba29c14a0991397a862b31b1f69"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::bpe::bpe_merge_symbols_small (cognitive 16): gigatoken::bpe::bpe_merge_symbols_small has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (gigatoken::bpe::bpe_merge_symbols_ranked_slice) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f67e53370526869eadcb90cf3668f8b6c5ee2877e16a9f98d8ece8c85522bb4"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::bpe::bpe_merge_symbols_ranked_slice (cognitive 16): gigatoken::bpe::bpe_merge_symbols_ranked_slice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (gigatoken::bpe::bpe_merge_symbols_small) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41a31199d361823294dbde704315b6d57e5d862eee5334261dbb21b0e70d740"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::bpe::sentencepiece::collapse_space_runs (cognitive 16): gigatoken::bpe::sentencepiece::collapse_space_runs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/sentencepiece.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"4426ccf3813e064f1f60b4db624a6bd4cb21a8efb1c05c24d271c526b1deacc2"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::deepseek_v3::ws_token_end (cognitive 16): gigatoken::pretokenize::fast::deepseek_v3::ws_token_end has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/deepseek_v3.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f241b536ce9a19e8e039f9d9bd73224de9ba25597eb157232ccf3d135ded9f81"}},{"ruleId":"D2","level":"warning","message":{"text":"gigatoken::pretokenize::fast::o200k_family::batch_masks (cognitive 16): gigatoken::pretokenize::fast::o200k_family::batch_masks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"317e9a2c9b0fb7e69ab145098468f3b676e513a16c6f17fd0513940a4c057fba"}},{"ruleId":"D2","level":"warning","message":{"text":"_hf_compat._template_special_ids (cognitive 16): _hf_compat._template_special_ids has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 2 (4 pts), ternaries 1 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_hf_compat.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"c621699ed08ac6d51bce67849a93ba7ddeffb215cc63c4b24dd9cf76352d2d8b"}},{"ruleId":"D2","level":"warning","message":{"text":"hf.to_tokenizer_json (cognitive 16): hf.to_tokenizer_json has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_load/hf.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88ba0ef3fec5e5da18dccf7390bd3d3bded11120d35e550e130b8b1c40fead1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tokenizer: ClassTooLong \u2014 780 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), 44 methods, 3 blocks, lines 25-1728. The bar is 400 significant lines; this is 380 over it, 1.95\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/tiktoken.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f37c24c8844548c088517a2f3a893ac1cf456906f5514081550f7656b1708c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bpe/tiktoken.rs: FileTooLong \u2014 910 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: Tokenizer (3 blocks, 25-1728). The bar is 500 significant lines; this is 410 over it, 1.82\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/tiktoken.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b186ed11107295895c02583b537a22fbaf0331121d78c6c0830da494e43c149"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fast/o200k_family.rs: FileTooLong \u2014 893 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 393 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1264da418141a5a0bec6d17974a7c4b3dd8c092460035f01667b26a54c641ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notebooks/bit_patterns.py: FileTooLong \u2014 865 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 365 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/bit_patterns.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"100d670bd6ac8207790ca1499bf984b417892fd37af6ffdaab8ec1bc6897fdad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MaskState.fill_spans_two_phase_impl: MethodTooLong \u2014 fill_spans_two_phase_impl runs 170 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 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/mask.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c641ad003467a5976de48d1994bf7f710a9b27a5ef41151b241646924d5e3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bpe/sentencepiece.rs: FileTooLong \u2014 809 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: SentencePieceBPE (4 blocks, 235-1493). The bar is 500 significant lines; this is 309 over it, 1.62\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/sentencepiece.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"756764ff038e962846949ba242e1dfe04a4c4f6d5eebd935ec14fabea25f9498"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gigatoken::pretokenize::fast::o200k_family::o200k_algebra: FunctionTooLong \u2014 gigatoken::pretokenize::fast::o200k_family::o200k_algebra runs 161 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 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8cc53be0ae5c8948c2c4b1c4b3be56d2fd0c6984f77b9eb7b0207ec089c98c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tokenizer: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/tiktoken.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"679253bb5d5a5430303ecf53d51818182294eb967a041dd3d835d9f03655b6eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fast/mask.rs: FileTooLong \u2014 723 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 223 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/mask.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ec9f05e69c2f688090e18c8dda334eb75cad5ab50bfa26053ded238bfa8027"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SentencePieceBPE: ClassTooLong \u2014 572 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), 30 methods, 4 blocks, lines 235-1493. The bar is 400 significant lines; this is 172 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/sentencepiece.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45c0f2c824ba1f436ffe8504d9cff34a5847783dacdee6094f7ed3d585e620d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gigatoken::pretokenize::fast::o200k_family::o200k_extended_masks: FunctionTooLong \u2014 gigatoken::pretokenize::fast::o200k_family::o200k_extended_masks runs 121 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 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c17bfff3ec2f4e779db391dced854d1cc94dcc5d2652204e8f84a69975afa3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bpe/mod.rs: FileTooLong \u2014 568 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 68 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9562c2cf4a604fa8e38fa4906024da896cc05a4b1fc145e37c571e280c98e82"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/batch.rs: FileTooLong \u2014 547 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 47 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5230af04d65436a15c8e3717548de8beaa56e326d2291af10313f1a9b342e11c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HFCompat: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_hf_compat.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e955d3f6ec61d45973c7bd67d466ead623ecfa19ab54ba9bf87aeb93c52dd24d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gigatoken::bpe_train::train_bpe: FunctionTooLong \u2014 gigatoken::bpe_train::train_bpe runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe_train.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1c40bffb5ae695f0a230e8ae3d85ee5d4b2378ad52df56f75af5427e9d98b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: gigatoken::pretokenize::fast::cl100k_family::family_algebra: FunctionTooLong \u2014 gigatoken::pretokenize::fast::cl100k_family::family_algebra runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c58fac8a701c42a8056beb4694266b6272f7a54f84662877cac97648c84227"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reference/simd.rs: FileTooLong \u2014 517 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 17 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/simd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c791c5dd42c69f1581f2ef86aafef9d9f9e869b4948f880110cb7e0cb71adc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 30 shared lines): src/pretokenize/fast/cl100k.rs:143-256 | src/pretokenize/fast/olmo3.rs:139-252 | src/pretokenize/fast/qwen2.rs:141-254 | src/pretokenize/fast/qwen3_5.rs:204-316 \u2014 These 4 members are variants of one another: a block of 30 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"509c97a76e762632b054957bcdd6ce6ec2e153eb96007dc6883cb6264ab1ada5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 41 shared lines): notebooks/dfa_states.py:9-136 | notebooks/simd_unicode.py:9-138 | notebooks/unicode_classes.py:14-100 \u2014 These 3 members are variants of one another: a block of 41 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/dfa_states.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2971ca84e159bd365d77c50c7e875eb028dd5cae460ab03bdcd42aff0ff5db46"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (67 shared lines): src/pretokenize/fast/cl100k_family.rs:386-585 | src/pretokenize/fast/o200k_family.rs:1026-1262 \u2014 These two members are variants of one another: 67 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"68527ce6980475caa7254a0ad2e6278d18eca942fa2f6f53ee27579937cb84b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): profiling/analyze.py:36-83 | profiling/analyze_mt.py:29-65 \u2014 These two members are variants of one another: 35 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"318d4fdf0ef4ffe2be9c4574e72c1a68e23ba86f27a71cd0f2ab7de099b313d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/pretokenize/fast/cl100k.rs:102-138 | src/pretokenize/fast/deepseek_v3.rs:179-218 | src/pretokenize/fast/o200k_family.rs:273-309 | src/pretokenize/fast/olmo3.rs:98-134 | src/pretokenize/fast/qwen2.rs:100-136 | src/pretokenize/fast/qwen3_5.rs:163-199 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3faaf6cabaf5bd8b3b804dfad71515d9950e623c809f888e7d2d289e4b09de"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/bpe/mod.rs:553-625 | src/bpe/mod.rs:651-719 | src/bpe/mod.rs:747-803 | src/bpe/mod.rs:820-893 \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":"src/bpe/mod.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e2a7f5f282c8e7e1dc0a63ef72bdbaafac0fe3376b5874d36777d8032b8f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/pretokenize/fast/cl100k_family.rs:123-197 | src/pretokenize/fast/mask.rs:177-216 | src/pretokenize/fast/o200k_family.rs:1300-1392 | src/pretokenize/fast/r50k.rs:66-119 \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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0edaafefd037884b9b5f9bd4eda10a0e706dae13729e2d31b95aa0b0c5f3fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 3): src/pretokenize/fast/cl100k.rs:144-191 | src/pretokenize/fast/olmo3.rs:140-187 | src/pretokenize/fast/qwen2.rs:142-189 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k.rs\u0060 and \u0060src/pretokenize/fast/olmo3.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 186 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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"26968e97acef33e2ef05ae49fe2ff838c639ec5c2e99d6a246fd68fbe9ccc5fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 3): src/pretokenize/fast/cl100k.rs:221-256 | src/pretokenize/fast/olmo3.rs:217-252 | src/pretokenize/fast/qwen2.rs:219-254 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k.rs\u0060 and \u0060src/pretokenize/fast/olmo3.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 186 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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a077b7e4e62e79edceba27d2eedd8a44ae7dbe9576c620f7376400bfd4d0474"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 3): src/bpe/mod.rs:687-719 | src/bpe/mod.rs:771-803 | src/bpe/mod.rs:861-893 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b637871cf6451781c77ab0a350330c564e804f55741f4d927f51b34b7b5b814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201330 lines \u00D7 2): src/bpe/tiktoken.rs:1538-1558 | src/bpe/tiktoken.rs:1638-1667 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/tiktoken.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4865eb45e370cb77e47746368f118cea6b559ac7aa6a326d4d7d9fe6265a28f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/pretokenize/fast/olmo3.rs:112-134 | src/pretokenize/fast/qwen2.rs:114-136 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/olmo3.rs\u0060 and \u0060src/pretokenize/fast/qwen2.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 196 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":"src/pretokenize/fast/olmo3.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea61afbd63be7a11f3067e3a13cbbf932696e17a267ba44805a4f6a0a6dd8cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): src/pretokenize/reference/simd.rs:513-535 | src/pretokenize/reference/simd.rs:683-704 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/simd.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"680657f8766b4b332064d01df2154e56b3d525508e216b29b432010822dd390a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201321 lines \u00D7 4): src/pretokenize/fast/cl100k_family.rs:124-143 | src/pretokenize/fast/mask.rs:188-191 | src/pretokenize/fast/o200k_family.rs:1301-1321 | src/pretokenize/fast/r50k.rs:67-85 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 141 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddef0ea281464a46a45f3683a48cc62526c8ec713ab127b5ce942d11a0dcb1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/pretokenize/fast/r50k.rs:220-238 | src/pretokenize/fast/r50k.rs:391-409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/r50k.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfd08c7c04ebbd99c185c3bb5aa11e49e4da584c0f89e00860e74c617ae016e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/pretokenize/fast/cl100k.rs:110-127 | src/pretokenize/fast/olmo3.rs:106-123 | src/pretokenize/fast/qwen2.rs:108-125 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k.rs\u0060 and \u0060src/pretokenize/fast/olmo3.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 186 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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a292d0d116a23491f7a35b5fa973cf40a006918a30d077ac73335dfe45b51162"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/bpe/tiktoken.rs:619-635 | src/bpe/tiktoken.rs:652-668 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/tiktoken.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eef5099f03fd3dfeba2e0729a0fd08f551febae9e1a4dde8191eff318e589db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): src/pretokenize/fast/cl100k_family.rs:532-548 | src/pretokenize/fast/o200k_family.rs:1172-1183 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 141 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6f4b33b1a70aae9e96efa52e4e9d8152ccdc37c46cb19fa17160dce950d239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): src/pretokenize/fast/cl100k_family.rs:562-578 | src/pretokenize/fast/o200k_family.rs:1240-1252 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 141 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08b0e52e78670112b22ac0ae6e39708763d3b402c154b48d1c38add771bc0fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): src/pretokenize/fast/cl100k_family.rs:512-527 | src/pretokenize/fast/o200k_family.rs:1158-1169 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 141 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"c950638d37136aa5e6aaabd41e8a54459f4b63b3a04d02ff24285bd21f005441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): src/pretokenize/fast/cl100k.rs:103-117 | src/pretokenize/fast/o200k_family.rs:274-288 | src/pretokenize/fast/olmo3.rs:99-113 | src/pretokenize/fast/qwen2.rs:101-115 | src/pretokenize/fast/qwen3_5.rs:164-178 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k.rs\u0060 and \u0060src/pretokenize/fast/olmo3.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 186 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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f58ad70f770dd9012c507fb662abf97ceb3a2cae9ede9765bd4d54dea20484"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 3): src/pretokenize/fast/mod.rs:427-437 | src/pretokenize/fast/o200k_family.rs:215-229 | src/pretokenize/fast/qwen3_5.rs:134-148 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/o200k_family.rs\u0060 and \u0060src/pretokenize/fast/qwen3_5.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 39 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":"src/pretokenize/fast/mod.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b4a3ed888b05e1dbd01e259ffdb51d06b9931a673c7bbc8083164aed1d7ec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): src/pretokenize/fast/cl100k.rs:215-228 | src/pretokenize/fast/olmo3.rs:211-224 | src/pretokenize/fast/qwen2.rs:213-226 | src/pretokenize/fast/qwen3_5.rs:275-288 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k.rs\u0060 and \u0060src/pretokenize/fast/olmo3.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 186 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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"54511ab1510c19cab3bddb282397868ece0c40f52dbb5c3a9ec05d07e09e7c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/bpe/mod.rs:654-667 | src/bpe/mod.rs:750-763 | src/bpe/mod.rs:823-836 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e85c80a35be219fb1822c48d890d3eed2b76ac91cbe08eb1c88b609af1ef433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 3): src/pretokenize/unicode.rs:78-87 | src/pretokenize/unicode.rs:171-184 | src/pretokenize/unicode.rs:292-301 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/unicode.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0054f27674bd49afa2ab54ed86f774280217f8371ca4546c89fe8b3e98f62c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/bpe/mod.rs:469-482 | src/bpe/mod.rs:930-941 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5b84b7ba04834f361174c5a9e3a7087e9f7e7efb8ddbd351b8783872cee6f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/bpe/mod.rs:513-525 | src/bpe/mod.rs:611-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"5340e8bda7220599d60f59afa3ae486d53036c01bc293e1de1715dae0195d871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): src/pretokenize/fast/mask.rs:281-294 | src/pretokenize/fast/o200k_family.rs:1469-1480 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/mask.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 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":"src/pretokenize/fast/mask.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"481fd46a8e479c107b1ad24b83d0a39930531da68ccbf56d6e31041df4aa532e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): src/pretokenize/fast/cl100k.rs:159-171 | src/pretokenize/fast/olmo3.rs:155-167 | src/pretokenize/fast/qwen2.rs:157-169 | src/pretokenize/fast/qwen3_5.rs:220-232 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k.rs\u0060 and \u0060src/pretokenize/fast/olmo3.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 186 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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcacf544d2ecf4c09c6437ec4e6335753f45e14e85058d3ae6411e9868c51e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/bpe/mod.rs:486-498 | src/bpe/mod.rs:568-580 | src/bpe/mod.rs:946-958 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e91ecf5f1a35b0a620380d0a20fe7920b72b214de90c7830d569bb9009e5654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/pretokenize/fast/cl100k_family.rs:225-237 | src/pretokenize/fast/r50k.rs:142-154 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/r50k.rs\u0060 as WHOLE FILES: this scan already matched 5 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d692817d263a391b7a5e966aef2987d3ed43854e5eb06b2e05fd14f1f466e9f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/pretokenize/fast/cl100k_family.rs:404-414 | src/pretokenize/fast/o200k_family.rs:1067-1079 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 141 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd84d7de553509cb76757c0860d743b9e5c95fe88d6b36afd9e9bde0fa00e63b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/pretokenize/fast/cl100k.rs:195-206 | src/pretokenize/fast/olmo3.rs:191-202 | src/pretokenize/fast/qwen2.rs:193-204 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k.rs\u0060 and \u0060src/pretokenize/fast/olmo3.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 186 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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"baceeb3e2bb6a1f5eae89c8fcd47c43e2a7f3451f6cac4434f4227aab22e8100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bpe/tiktoken.rs:1564-1575 | src/bpe/tiktoken.rs:1684-1695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/tiktoken.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1bb2ce1ee822a654168fcc2efc379c686c1322d3e40f89ab02d39a668f1bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/pretokenize/reference/combinator.rs:27-38 | src/pretokenize/reference/simd.rs:85-96 \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":"src/pretokenize/reference/combinator.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0d88be4c246434e4fa723d9586211c035ea40a0d0df8af54a7ffee7eac8642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/input/parquet.rs:82-92 | src/input/parquet.rs:94-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/input/parquet.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89cf53e01b2343ba31f65e4255435e1b2d6b114fc27a85a879db00c1e69f441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/pretokenize/fast/cl100k_family.rs:146-156 | src/pretokenize/fast/o200k_family.rs:1325-1335 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 141 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5310e00f2e319c1922ad801645a0167d485fbe8bd926c18d491122f9e2f4c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/pretokenize/fast/mask.rs:483-493 | src/pretokenize/fast/mask.rs:517-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/mask.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"59afb11d16347f04e6a7a61eca0a1f6c54e8925db4dfebcdde00463e389ff7c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/pretokenize/reference/avx512.rs:189-199 | src/pretokenize/reference/avx512.rs:203-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/avx512.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b9dd22dda69dec10d0e0b566988a7ba6a82007c1ed8106c9eac4692eb4c273"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/bpe/mod.rs:556-565 | src/bpe/mod.rs:658-667 | src/bpe/mod.rs:754-763 | src/bpe/mod.rs:827-836 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"190484dfb86da3992bfc74a47a29949bdd52012629c0985e1f182c9dc265988c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/input/file_source.rs:460-469 | src/input/parquet.rs:179-188 \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":"src/input/file_source.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5e983caaa50afc602c33fc1dc8dffd3a3df3fc7b0609b2a7f9d4f2c9c999b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/pretokenize/fast/cl100k_family.rs:497-506 | src/pretokenize/fast/o200k_family.rs:1147-1155 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 141 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc97f9aef9d668fd652e0a18e07d3c3d251d7793580970bca343607c1ad558f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/pretokenize/reference/combinator.rs:107-116 | src/pretokenize/reference/simd.rs:121-129 \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":"src/pretokenize/reference/combinator.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"603bf25cd85205f32c67832a1296aadf16423816170c9488252b0a052e88b706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/pretokenize/reference/combinator.rs:371-380 | src/pretokenize/reference/combinator.rs:394-403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/combinator.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a05884ec4978c85b668e1dbda41a859a5e2782eba156bc59ff3b31b24287c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/pretokenize/reference/simd.rs:706-715 | src/pretokenize/reference/simd.rs:727-736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/simd.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e947e647b6e24d9172dea91938692229ce8d460d63ae30609fb3d35803336b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): src/pretokenize/fast/cl100k.rs:107-115 | src/pretokenize/fast/deepseek_v3.rs:185-193 | src/pretokenize/fast/o200k_family.rs:278-286 | src/pretokenize/fast/olmo3.rs:103-111 | src/pretokenize/fast/qwen2.rs:105-113 | src/pretokenize/fast/qwen3_5.rs:168-176 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k.rs\u0060 and \u0060src/pretokenize/fast/olmo3.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 186 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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"623ef4609de7f7e094e15306f8d4ee9d068189dbf7cc91519928c55f82b20c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/bpe/mod.rs:503-511 | src/bpe/mod.rs:602-610 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbcacbfa304c733556a2b2134a48ee1e290ff79d598e60f94c77492498dbda5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/pretokenize/fast/cl100k_family.rs:447-455 | src/pretokenize/fast/o200k_family.rs:1121-1128 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 141 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cca14c66ea6d76cdf7277cd8fbf4b07d66a86488b0dfb68d530e03c587f435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/pretokenize/fast/mask.rs:302-310 | src/pretokenize/fast/o200k_family.rs:1481-1488 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/mask.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 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":"src/pretokenize/fast/mask.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba95708344ca9cc334bd6a6c48b7383baa08e4c8fa8e5478db79598d4145a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/pretokenize/reference/simd.rs:434-442 | src/pretokenize/reference/simd.rs:660-668 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/simd.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ada5a9dfd0e528664b82019a0443899622a7a7a3e2ffb867342b1b69ce8cb6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/bpe/tiktoken.rs:895-902 | src/bpe/tiktoken.rs:1091-1098 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/tiktoken.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f96166b5557933fb15eb22f927a12668e00c9cdf8fa0eab900b2faaa493d1ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/pretokenize/fast/o200k_family.rs:1349-1356 | src/pretokenize/fast/o200k_family.rs:1359-1366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/o200k_family.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e234f0aab35eaf5bc4acb516fdc5107b005af401a21c8112d33f6af54460825d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20138 lines \u00D7 4): src/pretokenize/fast/cl100k.rs:211-213 | src/pretokenize/fast/olmo3.rs:207-209 | src/pretokenize/fast/qwen2.rs:204-211 | src/pretokenize/fast/qwen3_5.rs:266-273 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k.rs\u0060 and \u0060src/pretokenize/fast/olmo3.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 186 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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a32ed99c7a98f2bf7adce2ce750843a5f068c33109781c34a3052ff6e4f395c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/pretokenize/reference/avx512.rs:281-288 | src/pretokenize/reference/avx512.rs:326-333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/avx512.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"990639432418fa75796b8a6273b1b731b9404e63ab5076099a65d235eddede34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/bpe/mod.rs:501-507 | src/bpe/mod.rs:694-700 | src/bpe/mod.rs:778-784 | src/bpe/mod.rs:868-874 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a93c5c26bb64cbb8be359b58863dfff6728354b898e023db241725d9aad2386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/pretokenize/fast/r50k.rs:534-540 | src/pretokenize/fast/r50k.rs:553-559 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/r50k.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"520cc77f56382da0a6f6f5dcfa5f879a27c29095b92f5de284926f4daa1a87ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/pretokenize/reference/avx512.rs:288-294 | src/pretokenize/reference/avx512.rs:310-316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/reference/avx512.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb97e11ee72344237f9992d16c408ee4dda9bbb8f63c836230a03f6e8e74e92f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/pretokenize/fast/mod.rs:391-396 | src/pretokenize/fast/qwen3_5.rs:115-120 \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":"src/pretokenize/fast/mod.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2ce56d443ebad0e879ed7d727af0da5db7d798f30f4c9539191c0e35f6de47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/pretokenize/fast/cl100k_family.rs:146-150 | src/pretokenize/fast/o200k_family.rs:1325-1329 | src/pretokenize/fast/r50k.rs:88-92 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 141 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c61646b93f973c5348d43c3efb2c050d76f241769aa34dc0062630c28837fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/batch.rs:797-801 | src/batch.rs:974-978 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/batch.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2b889d87bb1f9a6511fb57b894e4e347967686b4e5c718819ee15108514bde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): src/pretokenize/fast/cl100k_family.rs:154-158 | src/pretokenize/fast/o200k_family.rs:1336-1338 | src/pretokenize/fast/r50k.rs:92-97 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 141 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac97b4b61f21b089628d50574cb07a3427d8b37a19b7f7dee87eb9cda765c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/pretokenize/fast/cl100k_family.rs:166-170 | src/pretokenize/fast/r50k.rs:103-107 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/r50k.rs\u0060 as WHOLE FILES: this scan already matched 5 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff4878f5738f2ba5c73a09a443d1313947015887a51ed715658cde1ec51ae48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/pretokenize/fast/cl100k_family.rs:185-189 | src/pretokenize/fast/o200k_family.rs:1380-1384 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 141 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"49515f985470c7a7eb93ea8495bf765e1ec797dea5586873fb5d0de222e7abda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/pretokenize/fast/mask.rs:1367-1371 | src/pretokenize/fast/mask.rs:1452-1456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/mask.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba94f5ce367a4d18f0fce11040fe4b5859cb960f57e6121019e984c263ad0a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/pretokenize/fast/mask.rs:1409-1413 | src/pretokenize/fast/mask.rs:1445-1449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/mask.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc5665c37ecf1c5fcea610cd6864ec751cf92358ddbff199e3737ff17ced565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/pretokenize/fast/cl100k.rs:39-44 | src/pretokenize/fast/olmo3.rs:35-40 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k.rs\u0060 and \u0060src/pretokenize/fast/olmo3.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 186 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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4048d49847a226a4ee95ad91fdfb872b1765a62aa0c73ff431fd6f250ebaf9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/pretokenize/fast/cl100k.rs:48-54 | src/pretokenize/fast/olmo3.rs:44-50 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k.rs\u0060 and \u0060src/pretokenize/fast/olmo3.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 186 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":"src/pretokenize/fast/cl100k.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2acfca100f24f886a25a8e13ba026acdc92a59acf85d013228bf15ea374622ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/pretokenize/fast/cl100k_family.rs:42-52 | src/pretokenize/fast/o200k_family.rs:461-471 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/cl100k_family.rs\u0060 and \u0060src/pretokenize/fast/o200k_family.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 141 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":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"454b8b52530b044e74bfdc54220445e921c55b3f3cb9789b0eaa544b12da1324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/pretokenize/reference/combinator.rs:83-89 | src/pretokenize/reference/simd.rs:99-105 \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":"src/pretokenize/reference/combinator.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"babff2e530c0b172248c1cd9da3bf44bfdfffdea7544453e2725728513e8024f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/pretokenize/fast/qwen2.rs:37-42 | src/pretokenize/fast/qwen3_5.rs:38-43 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/qwen2.rs\u0060 and \u0060src/pretokenize/fast/qwen3_5.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/qwen2.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec0801bb8c2f398e078b043faa48684024ae9f62023b2cc81dc43ebb6282a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/pretokenize/fast/qwen2.rs:46-52 | src/pretokenize/fast/qwen3_5.rs:47-53 \u2014 before extracting anything, compare \u0060src/pretokenize/fast/qwen2.rs\u0060 and \u0060src/pretokenize/fast/qwen3_5.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/qwen2.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcde1533d9ccf1a6d3eb9567d2c95376f0f73394759caeb00b7309294ec44cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (110\u2013114 lines \u00D7 2): notebooks/bit_patterns.py:995-1104 | notebooks/bit_patterns.py:1450-1563 \u2014 both copies are in the same file, so extract the block 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":"notebooks/bit_patterns.py"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"2390c3a0841a3e886e2285a21a36fc23eb4de266d7528ce38eca8b16f2e2496c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (82 lines \u00D7 2): notebooks/bit_patterns.py:825-906 | notebooks/bit_patterns.py:1191-1272 \u2014 both copies are in the same file, so extract the block 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":"notebooks/bit_patterns.py"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15b4ec0e658bb50aee53be817cb0f8a91f60a43f2947ae236d7b8a083031160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (78\u201381 lines \u00D7 2): notebooks/bit_patterns.py:744-824 | notebooks/bit_patterns.py:1113-1190 \u2014 both copies are in the same file, so extract the block 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":"notebooks/bit_patterns.py"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6d49227643c69f5058e37a5bc35e0e926342190821b5b7ab60eae9d649340d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201332 lines \u00D7 3): notebooks/bit_patterns.py:934-952 | notebooks/bit_patterns.py:1290-1308 | notebooks/bit_patterns.py:1355-1386 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/bit_patterns.py"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fd3844478f93089aa642da811962962cfbe1eeea706673b5fdcc29461d3a6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): profiling/analyze.py:140-169 | profiling/analyze_mt.py:110-138 \u2014 before extracting anything, compare \u0060profiling/analyze.py\u0060 and \u0060profiling/analyze_mt.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 122 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25ad0171a2a1a9bf79036a48ce123eb68b6e627b4cd601263b33927509d4397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201328 lines \u00D7 3): notebooks/bit_patterns.py:954-971 | notebooks/bit_patterns.py:1310-1327 | notebooks/bit_patterns.py:1389-1416 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/bit_patterns.py"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bc9fe2ed3e146c9f972797188530494a26a3a263f9afa8586d4f283b529e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 3): notebooks/dfa_states.py:24-48 | notebooks/simd_unicode.py:20-46 | notebooks/unicode_classes.py:19-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060notebooks/simd_unicode.py:48\u0060 calls \u0060get_bits_utf32\u0060 and \u0060notebooks/dfa_states.py:50\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/dfa_states.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2a8066353ea6253620b661c8935fbffefd73a43ab05cd7dc24f5a763bbf383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): scripts/build_release_cross_platform.py:255-281 | scripts/build_release_cross_platform.py:289-315 \u2014 both copies are in the same file, so extract the block 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":"scripts/build_release_cross_platform.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"450512529a3c2c8abed0388216e00ed4de189c6325d42d5582e489792a83aa1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): notebooks/bit_patterns.py:303-323 | notebooks/simd_unicode.py:297-317 \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":"notebooks/bit_patterns.py"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"728785798a18402abdcad04e9903c4c1674e248d2cbf3dcfc336c40c02096e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): notebooks/bit_patterns.py:909-925 | notebooks/bit_patterns.py:1273-1288 \u2014 both copies are in the same file, so extract the block 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":"notebooks/bit_patterns.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a1f09ac28ac608f301bc6628cac2d23c892d816eaccfc4cb57cbb4daa22c3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): notebooks/simd_unicode.py:48-64 | notebooks/unicode_classes.py:44-60 \u2014 before extracting anything, compare \u0060notebooks/simd_unicode.py\u0060 and \u0060notebooks/unicode_classes.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 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":"notebooks/simd_unicode.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2129045df75e70b41838980690980a3680a8bea564996658598a09a4e2de6cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 3): notebooks/bit_patterns.py:989-1000 | notebooks/bit_patterns.py:1345-1356 | notebooks/bit_patterns.py:1443-1458 \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 \u0060notebooks/bit_patterns.py:989\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":"notebooks/bit_patterns.py"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c5b265623d3e1fd693c83ef8ae2c51e585ad79c60edbb710aa0d9e33716d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): notebooks/dfa_states.py:484-498 | notebooks/dfa_states.py:626-639 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060notebooks/dfa_states.py:624\u0060 calls \u0060project_bits\u0060 and \u0060notebooks/dfa_states.py:483\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/dfa_states.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfb2d813ce69b9246604da106d10db19b00f5f5964752b34661e86f1c6e1a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): notebooks/simd_unicode.py:92-106 | notebooks/unicode_classes.py:82-94 \u2014 before extracting anything, compare \u0060notebooks/simd_unicode.py\u0060 and \u0060notebooks/unicode_classes.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060notebooks/unicode_classes.py:80\u0060 calls \u0060chr\u0060 and \u0060notebooks/simd_unicode.py:90\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/simd_unicode.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c127d4ce609cd54fb5d3f701162ac1183d2fa352641ff6ab7b636e82fd61216"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): notebooks/dfa_states.py:485-498 | notebooks/dfa_states.py:605-617 | notebooks/dfa_states.py:627-639 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/dfa_states.py"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae90a429bdeaf53c72974b20ff54dc11fc873a333cb888044579af45982efb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): profiling/analyze.py:56-69 | profiling/analyze_mt.py:42-53 \u2014 before extracting anything, compare \u0060profiling/analyze.py\u0060 and \u0060profiling/analyze_mt.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 122 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 \u0060profiling/analyze.py:56\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note 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":"profiling/analyze.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c82ecf7a8560b3fe6269f0020aa41d66aba18e30a2e79a85dc335ffc1c9bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): notebooks/dfa_states.py:112-123 | notebooks/simd_unicode.py:99-111 | notebooks/unicode_classes.py:89-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/dfa_states.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d032f0e22bc564ae108d0783b3386923ab1db2e34e510b8ef91169c4e73e8eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): profiling/analyze.py:42-54 | profiling/analyze_mt.py:29-40 \u2014 before extracting anything, compare \u0060profiling/analyze.py\u0060 and \u0060profiling/analyze_mt.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 122 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 \u0060profiling/analyze.py:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a13a82861c26999634d829afe34ff6010e4432ee6d30873336a4691505e95c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): profiling/analyze.py:72-83 | profiling/analyze_mt.py:55-65 \u2014 before extracting anything, compare \u0060profiling/analyze.py\u0060 and \u0060profiling/analyze_mt.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 122 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 \u0060profiling/analyze.py:72\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b79d7fe3a91b3eee0274a46b41973efb6c090222c543a46ab1c1b29aa6f96d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): profiling/analyze.py:91-102 | profiling/analyze_mt.py:69-79 \u2014 before extracting anything, compare \u0060profiling/analyze.py\u0060 and \u0060profiling/analyze_mt.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 122 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":"profiling/analyze.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29d05968b1951d29a7fc1fc23ec15729308286382d890967e4775dd63bab19c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): profiling/analyze.py:299-310 | profiling/analyze_mt.py:266-275 \u2014 before extracting anything, compare \u0060profiling/analyze.py\u0060 and \u0060profiling/analyze_mt.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 122 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 \u0060profiling/analyze.py:299\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":"profiling/analyze.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b6889758dab205f21a0b19d4b5a542b352eb5cd9d3bfb5e90e32c86c3b1799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): notebooks/bit_patterns.py:889-898 | notebooks/bit_patterns.py:935-944 | notebooks/bit_patterns.py:1255-1264 | notebooks/bit_patterns.py:1291-1300 | notebooks/bit_patterns.py:1356-1377 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/bit_patterns.py"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63a98fab5e7bc832a199cd95e50c7e05fe49bf0d310d4f99acc4dedb4735751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201310 lines \u00D7 3): notebooks/dfa_states.py:79-88 | notebooks/simd_unicode.py:87-96 | notebooks/unicode_classes.py:72-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. 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":"notebooks/dfa_states.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c094b5bb464c2b17025917200ca106d61e4f5db398b0245c67670ee5b23626f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): notebooks/bit_patterns.py:325-333 | notebooks/simd_unicode.py:319-327 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060notebooks/bit_patterns.py:336\u0060 calls \u0060cell\u0060, \u0060_\u0060 and \u0060notebooks/simd_unicode.py:330\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/bit_patterns.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11f9aee3de6dc809b87227f16c3e7aca61b60729525a65740df1d0cf88c4b80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): profiling/analyze.py:121-129 | profiling/analyze_mt.py:98-106 \u2014 before extracting anything, compare \u0060profiling/analyze.py\u0060 and \u0060profiling/analyze_mt.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 122 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9f1262ef393d4b3354db46cf1358c3a1d91a48bba94a8e7238ea6e1283109b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): notebooks/bit_patterns.py:915-922 | notebooks/bit_patterns.py:970-977 | notebooks/bit_patterns.py:984-991 | notebooks/bit_patterns.py:1278-1285 | notebooks/bit_patterns.py:1326-1333 | notebooks/bit_patterns.py:1340-1347 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060notebooks/bit_patterns.py:911\u0060 calls \u0060all_equal\u0060, \u0060enc_class\u0060 and \u0060notebooks/bit_patterns.py:983\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/bit_patterns.py"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1cb8f9f1161a30a17812796e5bc41bd4d21079c26b88b97d3f5596b9bfdf81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): notebooks/bit_patterns.py:1415-1422 | notebooks/bit_patterns.py:1438-1445 \u2014 both copies are in the same file, so extract the block 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":"notebooks/bit_patterns.py"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"364ec992d0d05f8fa047b2a7f360fb6c3d31c735ca5f65c860611c9ce4577eea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): profiling/analyze.py:285-292 | profiling/analyze_mt.py:255-261 \u2014 before extracting anything, compare \u0060profiling/analyze.py\u0060 and \u0060profiling/analyze_mt.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 122 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":"profiling/analyze.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2075e93cbf5acb6477a6c85492fbb0c8b648f20bb926b5053b1c36ab1908d86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): notebooks/bit_patterns.py:973-979 | notebooks/bit_patterns.py:987-993 | notebooks/bit_patterns.py:1329-1335 | notebooks/bit_patterns.py:1343-1349 | notebooks/bit_patterns.py:1441-1447 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/bit_patterns.py"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9474e8a4b56cdc6642f688add29bfe4fb30f63148d7e179fa48346e954f174a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): notebooks/simd_unicode.py:67-73 | notebooks/unicode_classes.py:63-69 \u2014 before extracting anything, compare \u0060notebooks/simd_unicode.py\u0060 and \u0060notebooks/unicode_classes.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060notebooks/simd_unicode.py:66\u0060 calls \u0060lru_cache\u0060 and \u0060notebooks/unicode_classes.py:60\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/simd_unicode.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e6c6166a410e87c1393d4964bbb09ccec7a20907aadc7ed40b8e052d378478"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): notebooks/bit_patterns.py:918-923 | notebooks/bit_patterns.py:973-978 | notebooks/bit_patterns.py:987-992 | notebooks/bit_patterns.py:1281-1286 | notebooks/bit_patterns.py:1329-1334 | notebooks/bit_patterns.py:1343-1348 | notebooks/bit_patterns.py:1418-1424 | notebooks/bit_patterns.py:1441-1446 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060notebooks/bit_patterns.py:1427\u0060 calls \u0060bytes\u0060, \u0060enc_ptr\u0060, \u0060intern_row\u0060 and \u0060notebooks/bit_patterns.py:979\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/bit_patterns.py"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f82203426ee53c2d05244e08bdddf79be5c2dc371314e1ef4a8d34334843735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): profiling/analyze.py:240-246 | profiling/analyze_mt.py:227-232 \u2014 before extracting anything, compare \u0060profiling/analyze.py\u0060 and \u0060profiling/analyze_mt.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 122 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 \u0060profiling/analyze.py:240\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"profiling/analyze.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4028eb0ec96204951dfaaf38fce271f9e4c1858f9092c2157ef3733f0b423859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): profiling/analyze.py:314-318 | profiling/analyze_mt.py:309-313 \u2014 before extracting anything, compare \u0060profiling/analyze.py\u0060 and \u0060profiling/analyze_mt.py\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 122 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":"profiling/analyze.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7d816c161b6bcfb5c429f0b93e4887fbf225d6efe775dd0940a1fc1817b451"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/pretokenize/fast/mask.rs: src/pretokenize/fast/mask.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in MaskState::fill_spans_two_phase_impl at line 1189. 2 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-07..2026-08-05, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-07 17:11:21 -07:00\u0027 --until=\u00272026-08-05 17:11:21 -07:00\u0027 --full-history --no-merges -- src/pretokenize/fast/mask.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/mask.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c624b1bc3acc376c4e7844d45247415e8eec2b246b36f67241313c36a5037564"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bpe/mod.rs: src/bpe/mod.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in gigatoken::bpe::bpe_merge_symbols_ranked at line 994. 3 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-05-07..2026-08-05, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-07 17:11:21 -07:00\u0027 --until=\u00272026-08-05 17:11:21 -07:00\u0027 --full-history --no-merges -- src/bpe/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/mod.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc98d66aa8b7ad6ff69a9651e8fee3ca3de3d64f661ce3cf45830af6fd86b78b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/pretokenize/fast/r50k.rs: src/pretokenize/fast/r50k.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in gigatoken::pretokenize::fast::r50k::extended_masks at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-07..2026-08-05, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-07 17:11:21 -07:00\u0027 --until=\u00272026-08-05 17:11:21 -07:00\u0027 --full-history --no-merges -- src/pretokenize/fast/r50k.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/r50k.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1152ef4d4ae2774b5d14b46d5c0dd5beaf4cce1f026fdbc7632de888e24718be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bpe/sentencepiece.rs: src/bpe/sentencepiece.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in SentencePieceBPE::encode_units_impl at line 1250. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-07..2026-08-05, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-07 17:11:21 -07:00\u0027 --until=\u00272026-08-05 17:11:21 -07:00\u0027 --full-history --no-merges -- src/bpe/sentencepiece.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe/sentencepiece.rs"},"region":{"startLine":1250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9fee40c5181a6a7ac6ddb3ead94298bc406c32fc419448101b776ee4e202fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gigatoken/_cli.py: gigatoken/_cli.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _cli.bench at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-07..2026-08-05, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-07 17:11:21 -07:00\u0027 --until=\u00272026-08-05 17:11:21 -07:00\u0027 --full-history --no-merges -- gigatoken/_cli.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_cli.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"628e9f94c83344daf6d2fb8e667d018a681008b9bef658e30e941f3204e244ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/pretokenize/fast/cl100k_family.rs: src/pretokenize/fast/cl100k_family.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in gigatoken::pretokenize::fast::cl100k_family::family_extended_masks at line 281. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-07..2026-08-05, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-07 17:11:21 -07:00\u0027 --until=\u00272026-08-05 17:11:21 -07:00\u0027 --full-history --no-merges -- src/pretokenize/fast/cl100k_family.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd951592100ab6399b834f85e7d9c639cdb717cbd8b954fe91299e66dbf94c9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: gigatoken/_hf_compat.py: gigatoken/_hf_compat.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in HFCompat._check_call_args at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-07..2026-08-05, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-07 17:11:21 -07:00\u0027 --until=\u00272026-08-05 17:11:21 -07:00\u0027 --full-history --no-merges -- gigatoken/_hf_compat.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_hf_compat.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"56da90b61aea58323b11c02143bc882c7ccd637ffd7fd2c0851ec250bb0a0268"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(perf): There is a lot of contention on this map early in merging, since the updated pairs overlap a lot in the beginning. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bpe_train.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a04fb416894081fd5fcff04ad1200044d3e83034f82c556158b066a2d8351d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(marcelroed): Also handle the length 2 case \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/bit_patterns.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ed4de4febee24ad8d80f4a3e9eada58a4d5ddec5a74b8c40e04076c41f4ef4"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (33052 LoC, 124 module-visible types across 14 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42070d3c47a7342513aa13b4da40c6529d43d392d442134dddf61dc1bc4b031e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92152f59d948386da704111c8edae5211daa2ceb7952080415d988f2e267a75c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f94edcd003fd9850703747d587997e6695673516999e79db0c6cfab6725c87e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23ba6d958d2a100426a54c04367550f9b6fb5785723aaf10a7ab28b3b74b9dee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c57ff7ee4f5493fd19f9027d26752196d0f66f7a9bc394273afdf83bfd8064a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63622d9a529288adccc2d7927158c102b869922b24459814bf9751ea492c5e2b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b900da3b463d8bfbba8050a2026c39e4fabf3d2519c4736ca30e328d587be53"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6ee7be982482c966009b05ad2bf4bfc8adebb4878029dac6597393f9a8bc524"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"458bbd04949473b9960e3be7ecdf42aa5c5013515f78ca455526ac82ec94eb6c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44532687ec3f7ed6f6e417f1e44ba3c3c825a3b83e3ed408699d108d3d399f88"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"782834aac73dc3247a7a50e3063e613a418154041d4d23c506771fc001f07332"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"16f22f6091dbaeb93102cb01a32ab2c7e7f8362ce8622c5b1e1e7103c7e7d8f1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25f99693acc0330371459a3525e21a749a0a1fdbc3fd010528848ad13d9489cb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e785b075637103ebcc3b9f3cac7ac4a3ca9bc29d6112398e4717f7ddff928c4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be5294e1aca08f7ee4fce8d05ae1ca0ce0a1eb58fe6369901c46df388dfdb040"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0fcf1f6be3e788ee445c66598655834646935ed84056555964fdbbf45d5d942d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c402ac3524d0b09891e8a6aa7dec06a81c1077771ab91e1735e482e6919501a7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b61c3e9f19bea5fd9ff2c8962e0369165e004a96de529b44d1cc4ca2452242d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d591cff0aab2b21d5510b036f6f288ccbab3bcd185d03c2302732b7a14e624c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1bcc34a0c7fee8a03ddf95a9cf50db3345484ee6239b998b0af2f725d10a3cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fdbb761317b20b04b14f6b124febb14626d5ba41e431e4ef8f0732c759403088"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a56232001ed8a096d315fe90fac66c8f3386bd023e37e6a2f74ea87e05299f34"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90d059783ffeed98bd163b86625292b3d0849bc795af5b070d284a8955cd51c2"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","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":"0017dc996d10a9dc3143b5430da72a47d2dcd54d757593a77ab5022920e8c27d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e3c4eaa39758cc2634c4496ca3a9ccb8f8bbad630ee3e06f4d8b0e6a23d624d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1784a083c0781931af3d87a10eec211572ff63296bf857f9e16bc94c1414b3ec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb84a6359738485ddaae17670e8f5ce73126ea92d2f8e0c118fda84c3532de66"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70b032383bf69709d3d628ae718e81d0e280595c4d88c2245be0914e2819fe83"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72bedb81048e2bd7b6e5486360c2c56c94c5221c443cd6b1b2d9e5d61da24cd1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a405983cf1622eb55ce96fcdc04d820b7655bcb6bbe3cbf95c629aab33ec002"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1726efba827cae9b8e05d5eeb666a92a3268b98f556526aab0e2cc7276eef356"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbf68f8b4ed9afc2c0f2e7e35715b9b3ff2649869a791c816fc5aefe9ff2caa8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17aafa96c343660eca6e32cf09253cd630f958265bcfd5fe86cf37a851fa7766"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ed059458dc0d864f79fffc2c8cd3f09ac2213f256b255ba1e07734350228541"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"617af74879b3fe685c10e0e9ba279c3fa54016f70cd412e49e19f59830ea23f3"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09eef8b6625b25738f8700358b71be29a093fcfe59905926f2178ad3d178132f"},"properties":{"dependency":{"package":"pillow","version":"12.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112405","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4333","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c39221e7a57c94c8668f293a52beb2217070a9b1a940bee5edd4b6b0b226af4b"},"properties":{"dependency":{"package":"certifi","version":"2026.6.17","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f268873f65bdaa9fa0eb6931555627e85a8ff8143ca35ae482b4a7d5ea5ae3e9"},"properties":{"dependency":{"package":"urllib3","version":"2.7.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4175","PYSEC-2026-4176","PYSEC-2026-4177"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be7ea98490c00ce4d5641edd01ea423b5ade93491e33da602a74e9c7718f05ac"},"properties":{"dependency":{"package":"pymdown-extensions","version":"10.21.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3609","PYSEC-2026-3654"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1cd5edb55bbbb627ab2f3a485a1a65f2b7d9e94a298b940d9d0c04d4a4bc987f"},"properties":{"dependency":{"package":"filelock","version":"3.29.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"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":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.13","advisory":"RUSTSEC-2026-0382","aliases":["[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"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":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","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":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","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":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","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":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","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":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","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":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","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":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","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":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","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":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","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":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","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":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","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":"d7481fb93c86b503a82a3e06a3172c7e27c5da26b8a178702a1e8028944c7596"},"properties":{"dependency":{"package":"rustls","version":"0.23.42","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"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":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","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":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"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":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.16\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","reachability":{"kind":"unknown"}}}},{"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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"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":"P12","level":"warning","message":{"text":"Test suite runs only after the merge: \u0060wheels.yml\u0060 run(s) the test suite, but no workflow that runs tests is triggered by a pull request (or a merge queue) \u2014 so the suite reports on code that is already on the default branch. A red build there blocks nothing and the only remedy is a revert. Add the pull-request trigger to the workflow that runs your suite so the gate applies before the merge, not after it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"731ad560de6aa35d3e92103d5ad0fbec4c54f771b709281e852941847e03ef03"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 9438 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060am.hi != 0 || (scan \u003E= 1 \u0026\u0026 bytes[scan - 1] \u003E= 0x80) || (scan \u003E= 2 \u0026\u0026 bytes[scan - 2] \u003E= 0x80)\u0060 appears character-identically in 2 files \u2014 src/pretokenize/fast/cl100k_family.rs, src/pretokenize/fast/o200k_family.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"855c59e226ff24ee89d39411d9f53f7445dc7cacfbbc1450c7a1b4d1d79ce80f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes[scan - 1] \u003C 0x80 \u0026\u0026 (scan \u003C 2 || bytes[scan - 2] \u003C 0x80)\u0060 appears character-identically in 2 files \u2014 src/pretokenize/fast/cl100k_family.rs, src/pretokenize/fast/o200k_family.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef8d57de0d2080bfc41d18ed21a866467f11e8550b7e7ae3a206a429ea3ef79"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_letter(b) || is_digit(b) || is_ascii_ws(b)\u0060 appears character-identically in 3 files \u2014 src/pretokenize/fast/mod.rs, src/pretokenize/fast/o200k_family.rs, src/pretokenize/fast/qwen3_5.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"baffe09318ad70d2a3f25b933a5b108a3da21074453d9585e9720da9cadcd406"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060vmaxvq_u8(hi_any) != 0 || (scan \u003E= 1 \u0026\u0026 bytes[scan - 1] \u003E= 0x80) || (scan \u003E= 2 \u0026\u0026 bytes[scan - 2] \u003E= 0x80)\u0060 appears character-identically in 2 files \u2014 src/pretokenize/fast/cl100k_family.rs, src/pretokenize/fast/o200k_family.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/pretokenize/fast/cl100k_family.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf74d25a8c8ca276307f1b1c6eb58c0e7e650bd8f432c79f062c0a0c6439e17"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/data_view.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"066dbb512af4b7049385fa1db5adfd43629f41726fb866197fc555d842a72374"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"notebooks/data_view.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2664991beec5a7e11d0fa7e037a5a06fcb02f326f9c2a9b10472551d0f1c53c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"gigatoken/_hf_compat.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a8b5ca3bfcea68a0f2df70e5d2d8c691d493f93f35f15499e2c6c0b169c1da"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-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":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-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":60,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}