{"$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":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"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":"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":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"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":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"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":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"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":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"PENMANT5Tokenizer._fix_and_make_graph (cyclomatic 75): PENMANT5Tokenizer._fix_and_make_graph has cyclomatic complexity 75 (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":"hanlp/components/amr/seq2seq/dataset/tokenization_t5.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"43684b52b46ecc98f58cfd5ac175813aea8b44cfda390cb9ca56b409f603d7c4"}},{"ruleId":"D1","level":"warning","message":{"text":"AMRBartTokenizer._fix_and_make_graph (cyclomatic 74): AMRBartTokenizer._fix_and_make_graph has cyclomatic complexity 74 (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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f827c6923a16b05912fa0d25f0054532da7a19cbd6617eb0fc51c6487784fdf"}},{"ruleId":"D1","level":"warning","message":{"text":"PENMANBartTokenizer._fix_and_make_graph (cyclomatic 74): PENMANBartTokenizer._fix_and_make_graph has cyclomatic complexity 74 (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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61f3f971817b27164252d75d8121826e70f44efa930baaee1e8ca28089008e5"}},{"ruleId":"D1","level":"warning","message":{"text":"Document.to_pretty (cyclomatic 57): Document.to_pretty has cyclomatic complexity 57 (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":"plugins/hanlp_common/hanlp_common/document.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f9fc2193636ccd3ddef0eae5b22ed3e8500792ebc421e89f9ec9d9c6dfa812"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformerSequenceTokenizer.__call__ (cyclomatic 55): TransformerSequenceTokenizer.__call__ has cyclomatic complexity 55 (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":"hanlp/transform/transformer_tokenizer.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e6450ff0761391c70aa91945941f23507baccbf853afd6da2456c649e2056d"}},{"ruleId":"D1","level":"warning","message":{"text":"BartDecoder.forward (cyclomatic 41): BartDecoder.forward has cyclomatic complexity 41 (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":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"791552bd4c4c29eac93744b4d6e6f78db939302c21fea039c451f8dbc98f593f"}},{"ruleId":"D1","level":"warning","message":{"text":"postprocessing._reconstruct_graph_from_nodes (cyclomatic 40): postprocessing._reconstruct_graph_from_nodes has cyclomatic complexity 40 (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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce326672212a609f9c79aebdc8e27e0017bfecdb833e21dbc8f07558ba96dc7"}},{"ruleId":"D1","level":"warning","message":{"text":"postprocessing.decode_into_node_and_backreferences_without_space (cyclomatic 40): postprocessing.decode_into_node_and_backreferences_without_space has cyclomatic complexity 40 (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":"hanlp/components/amr/seq2seq/dataset/postprocessing.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"001dcc8cc4d51d97b469c28c6e94599df3b3e0f391d8434f283dedf94d4b40bd"}},{"ruleId":"D1","level":"warning","message":{"text":"postprocessing._reconstruct_graph_from_nodes (cyclomatic 40): postprocessing._reconstruct_graph_from_nodes has cyclomatic complexity 40 (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":"hanlp/components/amr/seq2seq/dataset/postprocessing.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84739247aa5aa38a4d8c036955845d01c7fed59ff91e8898d864bb20e861a41"}},{"ruleId":"D1","level":"warning","message":{"text":"postprocessing.decode_into_node_and_backreferences (cyclomatic 36): postprocessing.decode_into_node_and_backreferences has cyclomatic complexity 36 (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":"hanlp/components/amr/seq2seq/dataset/postprocessing.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d80c64afaef183fea6eb55cc96ccc1fff3932e26d9b81fde79e3959b624ac0"}},{"ruleId":"D1","level":"warning","message":{"text":"CoNLL_Transformer_Transform.batched_inputs_to_batches (cyclomatic 35): CoNLL_Transformer_Transform.batched_inputs_to_batches 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":"hanlp/transform/conll_tf.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"6769197081cbbf0c34c5c9405f9f14e1ca0c7c274240616be522671a9d32ac21"}},{"ruleId":"D1","level":"warning","message":{"text":"component_util.load_from_meta_file (cyclomatic 35): component_util.load_from_meta_file 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":"hanlp/utils/component_util.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f60717c78c71a17c1d60ef59ab993b76da4bcfbcbc315760850e8106c281c6"}},{"ruleId":"D1","level":"warning","message":{"text":"postprocessing.decode_into_node_and_backreferences (cyclomatic 33): postprocessing.decode_into_node_and_backreferences has cyclomatic complexity 33 (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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"af75912ab5abf5c225568f8f8896d82cfd4f91938c0b892ccd0d1a19391ce295"}},{"ruleId":"D1","level":"warning","message":{"text":"txt_tf.extract_ngram_features (cyclomatic 33): txt_tf.extract_ngram_features has cyclomatic complexity 33 (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":"hanlp/transform/txt_tf.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5be6be325f954133b1168a09968e1c5042aeb9c4abea98177bf590ba15aefa3"}},{"ruleId":"D1","level":"warning","message":{"text":"TorchComponent.fit (cyclomatic 30): TorchComponent.fit 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":"hanlp/common/torch_component.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c96173bc47c725d2ca509ee8a9416e0afe156912a7c65f3a5ef2fa17300d61e"}},{"ruleId":"D1","level":"warning","message":{"text":"BartEncoder.forward (cyclomatic 26): BartEncoder.forward has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2970a278edfde7903b9bb25fa942e9c87123ba34ef480bcb5d52629aecead2a"}},{"ruleId":"D1","level":"warning","message":{"text":"chu_liu_edmonds.chu_liu_edmonds (cyclomatic 26): chu_liu_edmonds.chu_liu_edmonds has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/chu_liu_edmonds.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f4107e6f70e56662a56f6cd4013b875bc20f2f5c5e9fce7a18dc1692aefa53"}},{"ruleId":"D1","level":"warning","message":{"text":"visualization.pretty_tree_horizontal (cyclomatic 26): visualization.pretty_tree_horizontal has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_common/hanlp_common/visualization.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a9fe091a9b7e4cff9eaddec43152b7e4f4d48ad1e702d3ca5741436d734c7a"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiTaskLearning.predict (cyclomatic 25): MultiTaskLearning.predict 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":"hanlp/components/mtl/multi_task_learning.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6098d1902f76c56241d7b7a3c5518d16b03ff105a25e42e7dd7356b6ab90ea2"}},{"ruleId":"D1","level":"warning","message":{"text":"english_tokenizer.tokenize_english (cyclomatic 25): english_tokenizer.tokenize_english 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":"hanlp/utils/lang/en/english_tokenizer.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f882b6a4db1be7d32a4e6f7de8a7f4a5683d80f06d037a0602c7da956b694314"}},{"ruleId":"D1","level":"warning","message":{"text":"TorchComponent.to (cyclomatic 24): TorchComponent.to 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":"hanlp/common/torch_component.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ff5f7b78402ad11dcaa8a0c9c5804f15b9b4d4182354fd07022ecbe999325f"}},{"ruleId":"D1","level":"warning","message":{"text":"AMRLinearizer._linearize (cyclomatic 24): AMRLinearizer._linearize 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":"hanlp/components/amr/seq2seq/dataset/linearization.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d799dc7551863fea829d2da26ac2d6caf070e50c85cb3cd1af9ace1c20c704"}},{"ruleId":"D1","level":"warning","message":{"text":"io_util.uncompress (cyclomatic 24): io_util.uncompress 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":"hanlp/utils/io_util.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"14122a51fb384af606bc65b4b27e4f0057ae799db3595ea13be13461839b6064"}},{"ruleId":"D1","level":"warning","message":{"text":"hotpotqa.build_graph (cyclomatic 23): hotpotqa.build_graph 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":"hanlp/datasets/qa/hotpotqa.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d75486daf67d3f786d4a9b74ffa2f10399f97700d3492cbd39892ae896eae49"}},{"ruleId":"D1","level":"warning","message":{"text":"io_util.get_resource (cyclomatic 23): io_util.get_resource 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":"hanlp/utils/io_util.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c74204b8be81755d4b0ec1e337546a039026d8c5e4a1c18ce039f7146b221eb"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphRepair.remove_redundant_edges (cyclomatic 23): GraphRepair.remove_redundant_edges 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":"plugins/hanlp_common/hanlp_common/amr.py"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"a635c41210f4c5f804415ef56b0e0c4446b7d60828e0d62ed01d7dec4a92baef"}},{"ruleId":"D1","level":"warning","message":{"text":"span_util.is_transition_allowed (cyclomatic 22): span_util.is_transition_allowed 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":"hanlp/utils/span_util.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"532d5c2d7b77c7c2d3d7e78b1a3875bdaaa5e6e976604ff98adfd436dda44e19"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformerNamedEntityRecognizer.tag_to_span (cyclomatic 20): TransformerNamedEntityRecognizer.tag_to_span 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":"hanlp/components/ner/transformer_ner.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd82f3521d9634cba67f04b148c19e36e2696a48fe1b80a84e98ca8b5cbbffa"}},{"ruleId":"D1","level":"warning","message":{"text":"conll.read_conll (cyclomatic 20): conll.read_conll 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":"hanlp/components/parsers/conll.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f6fd934cef2f2382434973a69e30c86bc0a29b76b816102f56229acffc85c1"}},{"ruleId":"D1","level":"warning","message":{"text":"amr.batchify (cyclomatic 20): amr.batchify 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":"hanlp/datasets/parsing/amr.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"49be7e6f44f20e59b1a71ce9ab11f136809b7dd9abbefa8b05aec4e09ecd791b"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformerSequenceTokenizer.__init__ (cyclomatic 20): TransformerSequenceTokenizer.__init__ 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":"hanlp/transform/transformer_tokenizer.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93b2ba0738e0f222c56ae20ec647ca613ecd875f652a51db805f74267d18520"}},{"ruleId":"D1","level":"warning","message":{"text":"AMRGraph.get_list_data (cyclomatic 20): AMRGraph.get_list_data 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":"plugins/hanlp_common/hanlp_common/amr.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"a061d6d5249584c54f1f65118d811eef5a3f6df2964e2f88d0c8cbd6263b9479"}},{"ruleId":"D1","level":"warning","message":{"text":"ontonotes_loader.make_coref_instance (cyclomatic 19): ontonotes_loader.make_coref_instance 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":"hanlp/datasets/srl/loaders/ontonotes_loader.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96d4f7e7169dce03bc774dbcd111ccddf58ee61861c67f6b9bdd23f11c7f5ae"}},{"ruleId":"D1","level":"warning","message":{"text":"AMRGraph.from_prediction (cyclomatic 19): AMRGraph.from_prediction 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":"plugins/hanlp_common/hanlp_common/amr.py"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2a29d7550b8dbcad30b9a6c7c2c7dd1c2a57378d57ebc9ac1a4df7b0886469"}},{"ruleId":"D1","level":"warning","message":{"text":"KerasComponent.fit (cyclomatic 18): KerasComponent.fit 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":"hanlp/common/keras_component.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff240f36fb67a99e8819b9c33f97758f35a3bf6e68b97f886247b4af3c77d0c6"}},{"ruleId":"D1","level":"warning","message":{"text":"BartForSequenceClassification.forward (cyclomatic 18): BartForSequenceClassification.forward 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":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1f23b0c64f035c74dc4869225d9a15808c6f226285a9d6a5cd9a57fb5377cd"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformerEncoder.__init__ (cyclomatic 18): TransformerEncoder.__init__ 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":"hanlp/layers/transformers/encoder.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdd759b44d74ec9e7a2e7121964663d6d182381824d3a9718bb044e61110f3e"}},{"ruleId":"D1","level":"warning","message":{"text":"BiaffineDependencyParser.build_vocabs (cyclomatic 17): BiaffineDependencyParser.build_vocabs has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/biaffine/biaffine_dep.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"742a1e2cd6c04ec7b1e7677ae1778e90cf941a0ae488468716e056eefb27cbfa"}},{"ruleId":"D1","level":"warning","message":{"text":"lemma_edit.apply_lemma_rule (cyclomatic 17): lemma_edit.apply_lemma_rule 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":"hanlp/components/parsers/ud/lemma_edit.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2deff125226b74c061867ecc9535b9a1210bd5fc6a4f1d1afcad26a7fd6b2a5d"}},{"ruleId":"D1","level":"warning","message":{"text":"Word2VecEmbeddingTF.__init__ (cyclomatic 17): Word2VecEmbeddingTF.__init__ 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":"hanlp/layers/embeddings/word2vec_tf.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb16f7bd8e717dc5995eab5142ac85ab3a7a91aaeb28ddfab5a616e632ca8a6"}},{"ruleId":"D1","level":"warning","message":{"text":"sequence_labeling.end_of_chunk (cyclomatic 17): sequence_labeling.end_of_chunk has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (sequence_labeling.start_of_chunk) 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":"hanlp/metrics/chunking/sequence_labeling.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d412e3d885cb5e00a8c3ef51200bd3b9a4732ba2e2925cc7c3426a7ae889fbb"}},{"ruleId":"D1","level":"warning","message":{"text":"sequence_labeling.start_of_chunk (cyclomatic 17): sequence_labeling.start_of_chunk has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (sequence_labeling.end_of_chunk) 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":"hanlp/metrics/chunking/sequence_labeling.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc9f2448d444ec4a4d86762a1d6378cb27f58b1aec1d4e37156f8dbed7dff8c"}},{"ruleId":"D1","level":"warning","message":{"text":"KerasComponent.evaluate (cyclomatic 16): KerasComponent.evaluate 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":"hanlp/common/keras_component.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ed654fab3bdc2a3c35191a5f5a8ea84d97c14f35389fede6c1fbd098063192"}},{"ruleId":"D1","level":"warning","message":{"text":"TorchComponent.evaluate (cyclomatic 16): TorchComponent.evaluate 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":"hanlp/common/torch_component.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d5e910960730d4dbd2c99643d62e69464adc541936e32b650419341b2c747d"}},{"ruleId":"D1","level":"warning","message":{"text":"AMRBartTokenizer.tokenize_amr (cyclomatic 16): AMRBartTokenizer.tokenize_amr 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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"046610d41b46e3a85ff66e7cf44469b6363fccc9b5320fc8a3425a33fecdf442"}},{"ruleId":"D1","level":"warning","message":{"text":"AMRT5Tokenizer.tokenize_amr (cyclomatic 16): AMRT5Tokenizer.tokenize_amr 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":"hanlp/components/amr/seq2seq/dataset/tokenization_t5.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b4529b483c90ee1c66a6becc604446e50349d0d38b185d838ed0ad07e65326"}},{"ruleId":"D1","level":"warning","message":{"text":"NgramSentenceBoundaryDetector.predict (cyclomatic 16): NgramSentenceBoundaryDetector.predict 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":"hanlp/components/eos/ngram.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"18088e241c550f3fbe2305e9e64b521bd77e59555c3de598ee5eda757e3ebb86"}},{"ruleId":"D1","level":"warning","message":{"text":"inference_utils._dp_decode_non_overlapping_spans (cyclomatic 16): inference_utils._dp_decode_non_overlapping_spans 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":"hanlp/components/srl/span_rank/inference_utils.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4dbb8624984dfb7cfaecb335e340d08d42c41bf60b5fefac08e5973fb68b54"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformerTaggingTokenizer.tag_to_span (cyclomatic 16): TransformerTaggingTokenizer.tag_to_span 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":"hanlp/components/tokenizers/transformer.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"624dea31f987b6d705b52075a0dd3ca075d4a6e0c6b6992ff3572a8390618b50"}},{"ruleId":"D1","level":"warning","message":{"text":"util.index_word2vec_with_vocab (cyclomatic 16): util.index_word2vec_with_vocab 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":"hanlp/layers/embeddings/util.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d0d2e2046d9e4e989de510434a1ddbfa5914c0cd9003fb820853091109639f"}},{"ruleId":"D1","level":"warning","message":{"text":"CoNLL_SDP_Transform.file_to_inputs (cyclomatic 16): CoNLL_SDP_Transform.file_to_inputs 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":"hanlp/transform/conll_tf.py"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8059fb4fb96f995fce811b51302a2510fad2d4770e42ec1cd516d5aba29dd0"}},{"ruleId":"D1","level":"warning","message":{"text":"io_util.split_file (cyclomatic 16): io_util.split_file 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":"hanlp/utils/io_util.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c79653d603d54283686bcdb6d702743db26a7b418d4421ff129d9d31ea2a58"}},{"ruleId":"D2","level":"warning","message":{"text":"Document.to_pretty (cognitive 201): Document.to_pretty has cognitive complexity 201 (threshold 15). Drivers by points: if/else 35 (130 pts), loops 18 (64 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 143). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_common/hanlp_common/document.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7557bf1b4c01fae65d829c5123b86ed3490f0329e9682c72b66fc272037f260"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformerSequenceTokenizer.__call__ (cognitive 162): TransformerSequenceTokenizer.__call__ has cognitive complexity 162 (threshold 15). Drivers by points: if/else 52 (124 pts), loops 8 (29 pts), ternaries 2 (5 pts), boolean chains 4 (nesting depth added 96). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/transformer_tokenizer.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf30d7bfd7cc47f95d247dff5bb51f22cfc13f0cdb6fb3bc199925c2a5ae7bf7"}},{"ruleId":"D2","level":"warning","message":{"text":"PENMANT5Tokenizer._fix_and_make_graph (cognitive 143): PENMANT5Tokenizer._fix_and_make_graph has cognitive complexity 143 (threshold 15). Drivers by points: if/else 47 (118 pts), loops 11 (16 pts), boolean chains 9 (nesting depth added 76). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/tokenization_t5.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29d1b1940f273ee3974796a104ad701a6953b2249db272a57b234672feeac64"}},{"ruleId":"D2","level":"warning","message":{"text":"AMRBartTokenizer._fix_and_make_graph (cognitive 142): AMRBartTokenizer._fix_and_make_graph has cognitive complexity 142 (threshold 15). Drivers by points: if/else 46 (117 pts), loops 11 (16 pts), boolean chains 9 (nesting depth added 76). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91973f5790bc35e0cab845ce8521cac4644c10ba98e147d090a9ab1ba9f700d"}},{"ruleId":"D2","level":"warning","message":{"text":"PENMANBartTokenizer._fix_and_make_graph (cognitive 142): PENMANBartTokenizer._fix_and_make_graph has cognitive complexity 142 (threshold 15). Drivers by points: if/else 46 (117 pts), loops 11 (16 pts), boolean chains 9 (nesting depth added 76). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e32c8ebd5c27f8a0d10f976db3fc843dbc729d9b61d40ea10deeaf24acbda1"}},{"ruleId":"D2","level":"warning","message":{"text":"CoNLL_Transformer_Transform.batched_inputs_to_batches (cognitive 114): CoNLL_Transformer_Transform.batched_inputs_to_batches has cognitive complexity 114 (threshold 15). Drivers by points: loops 14 (50 pts), if/else 18 (38 pts), ternaries 7 (26 pts) (nesting depth added 75). 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":"hanlp/transform/conll_tf.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22ad283281ea42c26ca72fe7aa0bb21aad6730f39525eb1c8cb9de42f011d62"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiTaskLearning.predict (cognitive 66): MultiTaskLearning.predict has cognitive complexity 66 (threshold 15). Drivers by points: if/else 13 (42 pts), loops 10 (22 pts), boolean chains 2 (nesting depth added 41). 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":"hanlp/components/mtl/multi_task_learning.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"07296200442df8cbb4fa473cf940a3175986cd14bc035500c0826a3363a0cbeb"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformerNamedEntityRecognizer.tag_to_span (cognitive 66): TransformerNamedEntityRecognizer.tag_to_span has cognitive complexity 66 (threshold 15). Drivers by points: if/else 11 (35 pts), loops 7 (28 pts), boolean chains 3 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/ner/transformer_ner.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8d1183f92530a901031e16320023047238cdea4a0efcea90df580e28d763d3"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphRepair.remove_redundant_edges (cognitive 66): GraphRepair.remove_redundant_edges has cognitive complexity 66 (threshold 15). Drivers by points: if/else 11 (40 pts), loops 8 (23 pts), boolean chains 3 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_common/hanlp_common/amr.py"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"064a4e7ece307566706270039d9271f44e0739e1c77bc0d48e21a4dcb2d72fca"}},{"ruleId":"D2","level":"warning","message":{"text":"postprocessing._reconstruct_graph_from_nodes (cognitive 64): postprocessing._reconstruct_graph_from_nodes has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (50 pts), boolean chains 11, loops 2 (3 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbddbb30cebfe08928291696d8833db1c603195f13a72adbce6d086323a0d0ce"}},{"ruleId":"D2","level":"warning","message":{"text":"BartDecoder.forward (cognitive 64): BartDecoder.forward has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (30 pts), ternaries 16 (27 pts), boolean chains 5, loops 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":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fea3228f733d241ba85b2f2875c1c3af9bc96eb69b0dfa248f8c65d95879dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"postprocessing._reconstruct_graph_from_nodes (cognitive 64): postprocessing._reconstruct_graph_from_nodes has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (50 pts), boolean chains 11, loops 2 (3 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/postprocessing.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9fbc9d1289a59738d05993e8df211d133c197ff27acb2109f8cabfcf888618"}},{"ruleId":"D2","level":"warning","message":{"text":"component_util.load_from_meta_file (cognitive 64): component_util.load_from_meta_file has cognitive complexity 64 (threshold 15). Drivers by points: if/else 23 (39 pts), error handling 8 (16 pts), ternaries 1 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 29). 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":"hanlp/utils/component_util.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9576324b13f1e668d7fe8c46cdb9e1dc9c0633edab2c27408cfdc32530d86567"}},{"ruleId":"D2","level":"warning","message":{"text":"AMRLinearizer._linearize (cognitive 62): AMRLinearizer._linearize has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (44 pts), loops 8 (16 pts), boolean chains 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/linearization.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd1784e5dccb5f48b1ead6e479e88da48efb023ebf1f6ba31faece4d1d0428b"}},{"ruleId":"D2","level":"warning","message":{"text":"TorchComponent.to (cognitive 59): TorchComponent.to has cognitive complexity 59 (threshold 15). Drivers by points: if/else 14 (45 pts), loops 2 (7 pts), error handling 1 (5 pts), boolean chains 2 (nesting depth added 40). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/torch_component.py"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd75fa44dd6a1fbc93250d6273a90fd14906d61de12dd44862c9dc333bce9d7"}},{"ruleId":"D2","level":"warning","message":{"text":"postprocessing.decode_into_node_and_backreferences_without_space (cognitive 59): postprocessing.decode_into_node_and_backreferences_without_space has cognitive complexity 59 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 7 (17 pts), boolean chains 12, ternaries 5 (8 pts), error handling 1 (2 pts) (nesting depth added 23). 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":"hanlp/components/amr/seq2seq/dataset/postprocessing.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41968f88f0576f02dc6fea34e2a29b572a8250d0c732a527ca5cb00c9710590"}},{"ruleId":"D2","level":"warning","message":{"text":"io_util.uncompress (cognitive 58): io_util.uncompress has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (37 pts), ternaries 5 (16 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/utils/io_util.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79eb24d5639332addaed0042da51c3fccd695ffbe3191e231897b81e6a24a63"}},{"ruleId":"D2","level":"warning","message":{"text":"txt_tf.extract_ngram_features (cognitive 57): txt_tf.extract_ngram_features has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 13 (35 pts), boolean chains 13, if/else 5 (9 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/txt_tf.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e46fef6ffccde7f052887fc58b0d2d4eb2eec83ade23548d668594c577bde76"}},{"ruleId":"D2","level":"warning","message":{"text":"postprocessing.decode_into_node_and_backreferences (cognitive 55): postprocessing.decode_into_node_and_backreferences has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 7 (17 pts), boolean chains 8, ternaries 5 (8 pts), error handling 1 (2 pts) (nesting depth added 23). 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":"hanlp/components/amr/seq2seq/dataset/postprocessing.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2143eb1bf6583615d0bd2b90bd2f27dc45fbb5d808b3f01afb76cfedbe169847"}},{"ruleId":"D2","level":"warning","message":{"text":"english_tokenizer.tokenize_english (cognitive 53): english_tokenizer.tokenize_english has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 8 (20 pts), boolean chains 4, ternaries 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":"hanlp/utils/lang/en/english_tokenizer.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3572b5796a0c612ff67f2757e1ed26bfd4032c889a57de9bae8c641089165b"}},{"ruleId":"D2","level":"warning","message":{"text":"postprocessing.decode_into_node_and_backreferences (cognitive 51): postprocessing.decode_into_node_and_backreferences has cognitive complexity 51 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 7 (17 pts), ternaries 5 (8 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 23). 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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e56bc85324c30569ef5303513fd2d718fa566f50c4cad13709374d1306cd83e"}},{"ruleId":"D2","level":"warning","message":{"text":"chu_liu_edmonds.chu_liu_edmonds (cognitive 51): chu_liu_edmonds.chu_liu_edmonds has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 11 (17 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/chu_liu_edmonds.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b73a43da3a81022a4ed706f19cb431920815ef2766d19a3f1131b79b8a0595"}},{"ruleId":"D2","level":"warning","message":{"text":"conll.read_conll (cognitive 49): conll.read_conll has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (35 pts), error handling 1 (5 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/conll.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e0c7650cf055e7ea420f298e2cf67c2e4718d652ed2d5a97871c718cf28341"}},{"ruleId":"D2","level":"warning","message":{"text":"CoNLL_SDP_Transform.file_to_inputs (cognitive 48): CoNLL_SDP_Transform.file_to_inputs has cognitive complexity 48 (threshold 15). Drivers by points: if/else 7 (24 pts), ternaries 4 (16 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 33). 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":"hanlp/transform/conll_tf.py"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc17d8abe2254c81105cd74e4090e575b65b4381d9256a91ec76e447020aeec6"}},{"ruleId":"D2","level":"warning","message":{"text":"visualization.pretty_tree_horizontal (cognitive 48): visualization.pretty_tree_horizontal has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 8 (15 pts), ternaries 3 (5 pts), boolean chains 4 (nesting depth added 23). 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":"plugins/hanlp_common/hanlp_common/visualization.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ab4f040a3f2564716128d23ce54ab7dd085f6d2a5446fd49406468efd6c3cb"}},{"ruleId":"D2","level":"warning","message":{"text":"hotpotqa.build_graph (cognitive 47): hotpotqa.build_graph has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 7 (10 pts), ternaries 3 (9 pts), boolean chains 3 (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":"hanlp/datasets/qa/hotpotqa.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c1cba1105d0adffd85b63c6781185cd528ebbc8d0fb5261a23b2f3a789f2fa"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformerTaggingTokenizer.tag_to_span (cognitive 46): TransformerTaggingTokenizer.tag_to_span has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 6 (18 pts) (nesting depth added 30). 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":"hanlp/components/tokenizers/transformer.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"64674ef104adadbfd85a5c3404db93d44cc475036333d6109c0918cd3756ea54"}},{"ruleId":"D2","level":"warning","message":{"text":"inference_utils._dp_decode_non_overlapping_spans (cognitive 44): inference_utils._dp_decode_non_overlapping_spans has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 6 (17 pts), boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_rank/inference_utils.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ddd28ff8b65434b32c6d541bc97f5b87017fbc641330fcda3162883003dee7"}},{"ruleId":"D2","level":"warning","message":{"text":"ontonotes_loader.make_coref_instance (cognitive 44): ontonotes_loader.make_coref_instance has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 6 (15 pts), boolean chains 1, ternaries 1 (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":"hanlp/datasets/srl/loaders/ontonotes_loader.py"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ddeafd0a773ec3d84bd38a4da1087e5982728212a2cb4ee9df70cf24ca22f6"}},{"ruleId":"D2","level":"warning","message":{"text":"semdep_eval.sdp_eval (cognitive 42): semdep_eval.sdp_eval has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 4 (10 pts), boolean chains 1 (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":"hanlp/metrics/parsing/semdep_eval.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"884b112d4903be63c2cda7a033e7606f4ccb72782c95f7f269adee2d08bf5feb"}},{"ruleId":"D2","level":"warning","message":{"text":"BartEncoder.forward (cognitive 39): BartEncoder.forward has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (22 pts), ternaries 7 (13 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"076b4d72f17041bca686b1631d17c0560d8623f35c4c7f8345e9e294f42883d4"}},{"ruleId":"D2","level":"warning","message":{"text":"amr.batchify (cognitive 39): amr.batchify has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 4 (10 pts), ternaries 5 (6 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/parsing/amr.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba97a972c7e99a9109b4e97596a0140b2741874eefd309d7104451fcce908aaa"}},{"ruleId":"D2","level":"warning","message":{"text":"TorchComponent.fit (cognitive 38): TorchComponent.fit has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 8, ternaries 4 (7 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":"hanlp/common/torch_component.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"37455aa4bf462b4303aadd7397ccad32b56096af40e568099bf54a31528dfd8c"}},{"ruleId":"D2","level":"warning","message":{"text":"srl_eval_utils.compute_srl_f1 (cognitive 38): srl_eval_utils.compute_srl_f1 has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 5 (12 pts), boolean chains 2 (nesting depth added 23). 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":"hanlp/components/srl/span_rank/srl_eval_utils.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef040756331e19c3956099ef7f0a1de72a7d22c4dca29d000a29cf701c6b0de8"}},{"ruleId":"D2","level":"warning","message":{"text":"io_util.get_resource (cognitive 38): io_util.get_resource has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 5 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/utils/io_util.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f9b7957720d9690e437218bbddf8bfcba117afe10feec0abc1c15b186da206"}},{"ruleId":"D2","level":"warning","message":{"text":"PadSequenceDataLoader.pad_data (cognitive 37): PadSequenceDataLoader.pad_data has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 3 (9 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/dataset.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6730974cf695b05e1fb3cd3058c3afa2664f995db59425381178139bd3b66cde"}},{"ruleId":"D2","level":"warning","message":{"text":"lemma_edit.apply_lemma_rule (cognitive 37): lemma_edit.apply_lemma_rule has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 5 (11 pts), ternaries 2 (5 pts), error handling 1 (2 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":"hanlp/components/parsers/ud/lemma_edit.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e0b3a38fcf85081bc9755a03ad264768540efaaacb2863cec4d8b7e3e7bcd8"}},{"ruleId":"D2","level":"warning","message":{"text":"io_util.download (cognitive 35): io_util.download has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (29 pts), error handling 2 (5 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/utils/io_util.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"227ccaf3fd5bfc83c5e4fe52d518438c11de905daae3d5b51fa3234d347eb40e"}},{"ruleId":"D2","level":"warning","message":{"text":"RAdam.step (cognitive 34): RAdam.step has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/optim.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"694bcf64123b8be7a87b897796f48c7dd3af280fe47e69f146f385daf670ff59"}},{"ruleId":"D2","level":"warning","message":{"text":"AMRGraph.from_prediction (cognitive 34): AMRGraph.from_prediction has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 5 (7 pts), boolean chains 2, error handling 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":"plugins/hanlp_common/hanlp_common/amr.py"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc798fc10f8223963401dac024ed822c7cdd5ec5c1beb2af0542e53d7a0c1e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Document.__init__ (cognitive 32): Document.__init__ has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_common/hanlp_common/document.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"80133e7de6e9a89a5c78dbf942b8f7b719cf0f6cba5cb5dd59def2bf6684922f"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiTaskLearning.fit_dataloader (cognitive 31): MultiTaskLearning.fit_dataloader has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (27 pts), ternaries 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/multi_task_learning.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c3e416b40fc7da3f6c5bc9c49d26daddc9e2aed377a28595addda8bd180210"}},{"ruleId":"D2","level":"warning","message":{"text":"AMRGraph.get_list_data (cognitive 31): AMRGraph.get_list_data has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 6 (10 pts), boolean chains 1, ternaries 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_common/hanlp_common/amr.py"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23ce84c2b1a8b26710f1ad955fada82428918c7bc3af93fb730a8a3655a84a5"}},{"ruleId":"D2","level":"warning","message":{"text":"Ontonotes._conll_rows_to_sentence (cognitive 29): Ontonotes._conll_rows_to_sentence has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/srl/loaders/ontonotes_loader.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23d98492436a17f65b7e01bdfa47d82521a98acc80dff7e5aa2ce3124135697"}},{"ruleId":"D2","level":"warning","message":{"text":"span_util.to_bioul (cognitive 29): span_util.to_bioul has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/utils/span_util.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dadb68b719cd9520d3da3f74850a7e406074ce48173ce1d3bbaa1752bdd17ab"}},{"ruleId":"D2","level":"warning","message":{"text":"NgramSentenceBoundaryDetector.predict (cognitive 28): NgramSentenceBoundaryDetector.predict has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 6 (11 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":"hanlp/components/eos/ngram.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86cb34efbdba93eae03f2cded1eb380322aec7fd1b739e654449bf29ffe0178"}},{"ruleId":"D2","level":"warning","message":{"text":"_ctb_utils.make_ctb_tasks (cognitive 28): _ctb_utils.make_ctb_tasks has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 3 (11 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 16). 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":"hanlp/datasets/parsing/loaders/_ctb_utils.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"997fcdcb4ea55388eebef547d97df1a61a908a921bcd21b45c199bf06d8cec05"}},{"ruleId":"D2","level":"warning","message":{"text":"_utils.convert_jsonlines_to_IOBES (cognitive 28): _utils.convert_jsonlines_to_IOBES has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (14 pts) (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":"hanlp/datasets/srl/ontonotes5/_utils.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"68904750212c209d300f9a3af6864205b99623f91bf96ad3dcd9eb881c68c547"}},{"ruleId":"D2","level":"warning","message":{"text":"BiaffineNamedEntityRecognizer.get_pred_ner (cognitive 27): BiaffineNamedEntityRecognizer.get_pred_ner has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 3 (10 pts), boolean chains 3 (nesting depth added 13). 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":"hanlp/components/ner/biaffine_ner/biaffine_ner.py"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5254bd9d3765ac2b1609aca7e040f48aa35b5ec8b276e506dd0443dfd613b608"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonNERDataset.load_file (cognitive 27): JsonNERDataset.load_file has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (6 pts) (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":"hanlp/datasets/ner/loaders/json_ner.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b390cb858aa45a4cb3a2b9fbe5351eaa8ca683e0a320b7c02eee7d0ae1469cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformerEncoder.__init__ (cognitive 27): TransformerEncoder.__init__ has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 3, loops 1 (2 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":"hanlp/layers/transformers/encoder.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b7ef84a350e3a8abd18d04d088bdddfaf90fd15909c364bf4b152ab6ed4fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformerSequenceTokenizer.__init__ (cognitive 27): TransformerSequenceTokenizer.__init__ has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 3 (5 pts), boolean chains 3 (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":"hanlp/transform/transformer_tokenizer.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"96de2d44380ec92bd179382a73e572889f2e1863bee7a150e95507c9354e44ac"}},{"ruleId":"D2","level":"warning","message":{"text":"io_util.generate_words_tags_from_tsv (cognitive 27): io_util.generate_words_tags_from_tsv has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 1 (4 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/utils/io_util.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c6f56b26eacfc9f8260c5b8754e75d2f2e01158bc161d02cea215004120a8d"}},{"ruleId":"D2","level":"warning","message":{"text":"span_util.is_transition_allowed (cognitive 27): span_util.is_transition_allowed has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 8 (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":"hanlp/utils/span_util.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7293db8cb79008e723be2bff6b994ffa494a93c4dd70e268e5180aee2eaa512a"}},{"ruleId":"D2","level":"warning","message":{"text":"BiaffineDependencyParser.build_vocabs (cognitive 26): BiaffineDependencyParser.build_vocabs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 8). 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":"hanlp/components/parsers/biaffine/biaffine_dep.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e028a7928f32406fbee659c34235c92428ad181f86177f2010d59e9eb84edc7c"}},{"ruleId":"D2","level":"warning","message":{"text":"_utils.handle_line (cognitive 26): _utils.handle_line has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (5 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/srl/ontonotes5/_utils.py"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"904af29ae0ed0dc97f66982665e0cc417de6ae301900d08337f56012694af390"}},{"ruleId":"D2","level":"warning","message":{"text":"CoNLL_SDP_Transform.batched_inputs_to_batches (cognitive 26): CoNLL_SDP_Transform.batched_inputs_to_batches has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 3 (8 pts), ternaries 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/conll_tf.py"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb7bdf8fb039b7deee55f1a479040f7f45cacc97ed1a241536a0a31ec9b263e"}},{"ruleId":"D2","level":"warning","message":{"text":"io_util.split_file (cognitive 26): io_util.split_file has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 6 (9 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":"hanlp/utils/io_util.py"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6b5c5cc059ed12d3e8bc78f8d9cb5b54428c79fd3e1a58d450c63ce333f8f9"}},{"ruleId":"D2","level":"warning","message":{"text":"util.collapse_json (cognitive 26): util.collapse_json has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_common/hanlp_common/util.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c334a089aca1993933701127ec2b621f6a1b68db94a61a807787b38f888c70"}},{"ruleId":"D2","level":"warning","message":{"text":"PadSequenceDataLoader.__init__ (cognitive 25): PadSequenceDataLoader.__init__ has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 1 (2 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":"hanlp/common/dataset.py"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b0743c28c65948c662ccb942adb415518f0285596a7a8c6c717e0c09db4666"}},{"ruleId":"D2","level":"warning","message":{"text":"EncoderWithContextualLayer.__init__ (cognitive 25): EncoderWithContextualLayer.__init__ has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (25 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":"hanlp/components/parsers/biaffine/biaffine_model.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8916f2763c5b1f964fe585d4a67fa2fb2d00797c7ccfc27231732ebed72b22"}},{"ruleId":"D2","level":"warning","message":{"text":"SpanRankingSemanticRoleLabeler.decode_output (cognitive 25): SpanRankingSemanticRoleLabeler.decode_output has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (9 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_rank/span_rank.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"657e98e8068dc99289f79380ae022eeab228f1f240671bbeb9b601ed1520ddb6"}},{"ruleId":"D2","level":"warning","message":{"text":"srl_eval_utils.print_to_conll (cognitive 25): srl_eval_utils.print_to_conll has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (11 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":"hanlp/components/srl/span_rank/srl_eval_utils.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43c2205932777bc07718813143a7b1b4ef11d3b3b67c25e238f7392e07bbe7a"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformerTaggingTokenizer.spans_to_tokens (cognitive 25): TransformerTaggingTokenizer.spans_to_tokens has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/tokenizers/transformer.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c194507b5f2202dea58d19801734e850f03ab818d8129f46f103017ca1ae827c"}},{"ruleId":"D2","level":"warning","message":{"text":"SentenceBoundaryDetectionDataset.load_file (cognitive 25): SentenceBoundaryDetectionDataset.load_file has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (4 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/eos/eos.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e189168420d8c5db9ef6e711487a6997b6300332e587dc8e473fce595b389cb"}},{"ruleId":"D2","level":"warning","message":{"text":"CoNLL2012SRLDataset.load_file (cognitive 25): CoNLL2012SRLDataset.load_file has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (9 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/srl/loaders/conll2012.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ccdd550bc0d180586c0c8d99e1d8a66770621b3031cd39a006eb005209e369"}},{"ruleId":"D2","level":"warning","message":{"text":"KerasComponent.fit (cognitive 24): KerasComponent.fit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 4 (6 pts), boolean chains 3, error handling 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":"hanlp/common/keras_component.py"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"334c0d0cd3435216e483ced4f636da77d92602658810c7776ae9759ca8aaf736"}},{"ruleId":"D2","level":"warning","message":{"text":"dataset.dfs_linearize_constituency (cognitive 24): dataset.dfs_linearize_constituency has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/dataset.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1ad004f37e7eb67347e0d10acd5256e942cc4d7c4c1f6bb77ce6a4047818bc"}},{"ruleId":"D2","level":"warning","message":{"text":"dataset.dfs_linearize_tokenize_with_linguistic_structures (cognitive 24): dataset.dfs_linearize_tokenize_with_linguistic_structures has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 5 (9 pts) (nesting depth added 14). 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":"hanlp/components/amr/seq2seq/dataset/dataset.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dec16012bc0bdc0a3a65c7534f4f41741cac5b3d37a7f1875759887c35834d5"}},{"ruleId":"D2","level":"warning","message":{"text":"BiaffineDependencyParserTF.train_loop (cognitive 24): BiaffineDependencyParserTF.train_loop has cognitive complexity 24 (threshold 15). Drivers by points: loops 9 (17 pts), if/else 3 (7 pts) (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":"hanlp/components/parsers/biaffine_parser_tf.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"611ed224b8b0ef15c1cefae630635c32526f3a9ff1f1e3dcf576400c5c2c97f8"}},{"ruleId":"D2","level":"warning","message":{"text":"transformer_tokenizer.convert_examples_to_features (cognitive 24): transformer_tokenizer.convert_examples_to_features has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 5 (10 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":"hanlp/transform/transformer_tokenizer.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"593cf708512755210c6bbf02d2f33a01f879ca8f0a4b10d9cab616d736628367"}},{"ruleId":"D2","level":"warning","message":{"text":"KerasComponent.evaluate (cognitive 23): KerasComponent.evaluate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (4 pts), ternaries 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":"hanlp/common/keras_component.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b359ff4082eb3e3f0ec9d99d9ebb701fb425109f33aeabcd40ec5d2def59b6"}},{"ruleId":"D2","level":"warning","message":{"text":"BartForSequenceClassification.forward (cognitive 23): BartForSequenceClassification.forward has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, ternaries 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":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bce333eada833672abe793207d57e47845c1a6cb5a6b9b10f21906635472ee"}},{"ruleId":"D2","level":"warning","message":{"text":"lemma_edit.min_edit_script (cognitive 23): lemma_edit.min_edit_script has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 4, 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":"hanlp/components/parsers/ud/lemma_edit.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"27314c4bf1ada231f9fe4d83dfbb91dce7d8fbe207541b457ac781689ebad3bf"}},{"ruleId":"D2","level":"warning","message":{"text":"lemma_edit.gen_lemma_rule (cognitive 23): lemma_edit.gen_lemma_rule has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 4 (7 pts), loops 4 (7 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":"hanlp/components/parsers/ud/lemma_edit.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2c38052e28eb745106dff0afa1bab810e0fc96ac04504012d94dd63a93465f"}},{"ruleId":"D2","level":"warning","message":{"text":"SpanRankingSemanticRoleLabeler.evaluate_dataloader (cognitive 23): SpanRankingSemanticRoleLabeler.evaluate_dataloader has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 6 (10 pts) (nesting depth added 13). 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":"hanlp/components/srl/span_rank/span_rank.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdad5a76a3c960c67bbe1fe8950d00dd5f245df96a4ef9d832850031c54f7b3"}},{"ruleId":"D2","level":"warning","message":{"text":"util.index_word2vec_with_vocab (cognitive 23): util.index_word2vec_with_vocab has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (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":"hanlp/layers/embeddings/util.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"757db2a7792b40d66bda7211c0f0495c1a9d8c6f6878bf3148c345f9de6a11be"}},{"ruleId":"D2","level":"warning","message":{"text":"utils_tf.convert_examples_to_features (cognitive 23): utils_tf.convert_examples_to_features has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 5 (10 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":"hanlp/layers/transformers/utils_tf.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40c84b0bd536c266a49417ecedaf2c172eaddd64fc89b66fb68c4ac5caf6f39"}},{"ruleId":"D2","level":"warning","message":{"text":"Document.to_dict (cognitive 23): Document.to_dict has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 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":"plugins/hanlp_common/hanlp_common/document.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dad9b600d454289be2fc393c2381936af383b1e19e408bcc21196b4ac8af71"}},{"ruleId":"D2","level":"warning","message":{"text":"Seq2seq_AMR_Parser._init_new_embeddings (cognitive 22): Seq2seq_AMR_Parser._init_new_embeddings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (5 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":"hanlp/components/amr/seq2seq/seq2seq_amr_parser.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc282b70d41b033317be1f4d928b7f70fbb19fc4aa87ac1b846164a77e7d414"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiTaskLearning.build_dataloader (cognitive 22): MultiTaskLearning.build_dataloader has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/multi_task_learning.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43bc2c40c2e5afbdf6e139142efe81b372f0adec2936e81efc6ecd7ca9051a0"}},{"ruleId":"D2","level":"warning","message":{"text":"EncoderWithContextualLayer.forward (cognitive 22): EncoderWithContextualLayer.forward has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (22 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":"hanlp/components/parsers/biaffine/biaffine_model.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6298443bce590f578dd33caf02621278413727dea4c542e737d8d6572d9b8630"}},{"ruleId":"D2","level":"warning","message":{"text":"BiaffineSemanticDependencyParser.cache_dataset (cognitive 22): BiaffineSemanticDependencyParser.cache_dataset has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (5 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":"hanlp/components/parsers/biaffine/biaffine_sdp.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e6b4efd4176fed29692299771ae02a5cdf2bbc18ee744ace2291ea579f6f3b"}},{"ruleId":"D2","level":"warning","message":{"text":"semeval15.unpack_deps_to_head_deprel (cognitive 22): semeval15.unpack_deps_to_head_deprel has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (8 pts), ternaries 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/parsing/semeval15.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4f1c0adc28a5019e7d25193e263ea17cb005bba34ea30c7f14040085361a52"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.transformer_encode (cognitive 22): utils.transformer_encode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (21 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":"hanlp/layers/transformers/utils.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6fcc863367fd546afbcdf4cbbb12ee3b1fa9851d01f3a3283576c9c35124cc"}},{"ruleId":"D2","level":"warning","message":{"text":"CoNLL_SDP_Transform.fit (cognitive 22): CoNLL_SDP_Transform.fit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (4 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":"hanlp/transform/conll_tf.py"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"322fc777319988e9c41843a8a5452490d006ab0bfe784c63e9db915f661a235d"}},{"ruleId":"D2","level":"warning","message":{"text":"english_tokenizer.split_contractions (cognitive 22): english_tokenizer.split_contractions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/utils/lang/en/english_tokenizer.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a62972a5eab7481453ee0fafc2e73e1b7200da1fa66b16ec5b0426ded287675"}},{"ruleId":"D2","level":"warning","message":{"text":"TorchComponent.evaluate (cognitive 21): TorchComponent.evaluate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 4). 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":"hanlp/common/torch_component.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"473e208c525bd1069754528a2a13ed158561efa7e00edd8db878ce147edc8a9a"}},{"ruleId":"D2","level":"warning","message":{"text":"read_and_process.dfs_linearize (cognitive 21): read_and_process.dfs_linearize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/preprocess/read_and_process.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"195bb53bf55b4c995f2f955980c7efb70b23b05344c0151aeccb48d1f9ea6083"}},{"ruleId":"D2","level":"warning","message":{"text":"AMRBartTokenizer.tokenize_amr (cognitive 21): AMRBartTokenizer.tokenize_amr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, 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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"8701971f9436ba37d2ee700ea0628806028afe6a44450e56bd1c6f7f578b66cf"}},{"ruleId":"D2","level":"warning","message":{"text":"PENMANBartTokenizer._get_nodes_and_backreferences (cognitive 21): PENMANBartTokenizer._get_nodes_and_backreferences has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a3b11f6847e6d0701bd237de7b8aca124ea60138c350893f41cadaa5e9c1cc"}},{"ruleId":"D2","level":"warning","message":{"text":"AMRT5Tokenizer.tokenize_amr (cognitive 21): AMRT5Tokenizer.tokenize_amr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, 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":"hanlp/components/amr/seq2seq/dataset/tokenization_t5.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8e6cadf048815074ac8ecfd5bce6d0cd3d805515b7e94e9ba5defe774d06c6"}},{"ruleId":"D2","level":"warning","message":{"text":"PENMANT5Tokenizer._get_nodes_and_backreferences (cognitive 21): PENMANT5Tokenizer._get_nodes_and_backreferences has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/tokenization_t5.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f2b7b7b787d40fee527f166bc1910586d56537673bbf06014adf421b05bbcc"}},{"ruleId":"D2","level":"warning","message":{"text":"Pipe.predict (cognitive 21): Pipe.predict has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 1 (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":"hanlp/components/pipeline.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43450a652f73d58d1dcb733da6258a6d36524d04f7301a5336aef097e6a32c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Word2VecEmbeddingTF.__init__ (cognitive 21): Word2VecEmbeddingTF.__init__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (3 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":"hanlp/layers/embeddings/word2vec_tf.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9378e0049e9d04ee39bd4119099c2517dbd2f06a11c6bb9432fd39b290653cff"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.transformer_sliding_window (cognitive 21): utils.transformer_sliding_window has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 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":"hanlp/layers/transformers/utils.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb20b1ccf552084a4db83e5dcf766d20ccea8a3d791307de25976e5852b561b"}},{"ruleId":"D2","level":"warning","message":{"text":"TrieDict.merge_batch (cognitive 21): TrieDict.merge_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (10 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":"plugins/hanlp_trie/hanlp_trie/dictionary.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"513fb813c8f5eb6f33459c24cd4c398b5a654ee42030f94440dbe2716f789520"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformerClassifier.build_dataloader (cognitive 20): TransformerClassifier.build_dataloader has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (3 pts), boolean chains 2 (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":"hanlp/components/classifiers/transformer_classifier.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8b7de62bd133937e0a29b32fb837e40b814a9c8869c09e871e3272923f8fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"inference_utils.greedy_decode (cognitive 20): inference_utils.greedy_decode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (9 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":"hanlp/components/srl/span_rank/inference_utils.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e72d268802551b2ad3fa19247a33a5393a05c6dbd051eaf6a6095fab8c994ec"}},{"ruleId":"D2","level":"warning","message":{"text":"LanguageModelDataset.load_file (cognitive 20): LanguageModelDataset.load_file has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/lm/loaders/lm_dataset.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0c8cde30c0bca67e52422ebcf0b12c022b75222704f54c7efb1061f4749237"}},{"ruleId":"D2","level":"warning","message":{"text":"_utils.filter_data (cognitive 20): _utils.filter_data has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (7 pts), boolean chains 3 (nesting depth added 7). 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":"hanlp/datasets/srl/ontonotes5/_utils.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa0a721e07432ddaddb9e5b5c23743dcd97028bc0913bcf8ab49fd3dbbe1903"}},{"ruleId":"D2","level":"warning","message":{"text":"string_util.split_long_sentence_into (cognitive 20): string_util.split_long_sentence_into has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 2 (3 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":"hanlp/utils/string_util.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed27762c7bf358b0a456ce11d3a5b7dd77512663fb94cb98835f2ac4ce44ce95"}},{"ruleId":"D2","level":"warning","message":{"text":"Document.translate (cognitive 20): Document.translate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_common/hanlp_common/document.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"44504670c7426d1077fbe9e2f2014470b3f3d2820d45e872e50d07277705e313"}},{"ruleId":"D2","level":"warning","message":{"text":"PadSequenceDataLoader.tensorize (cognitive 19): PadSequenceDataLoader.tensorize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (4 pts), boolean chains 3, 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":"hanlp/common/dataset.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"2507e6eea36aa397c6354ce39e32330da313377e49c453ea972eee41b8bbae5c"}},{"ruleId":"D2","level":"warning","message":{"text":"BART_AMR_Parser.evaluate_dataloader (cognitive 19): BART_AMR_Parser.evaluate_dataloader has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (3 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":"hanlp/components/amr/amrbart/bart_amr_parser.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3316e298bf5ca6618b43d07bb258d36628f7d09f5aff590b2148e5812e430c"}},{"ruleId":"D2","level":"warning","message":{"text":"Seq2seq_AMR_Parser.evaluate_dataloader (cognitive 19): Seq2seq_AMR_Parser.evaluate_dataloader has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 1 (3 pts), loops 2 (3 pts), ternaries 1 (3 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":"hanlp/components/amr/seq2seq/seq2seq_amr_parser.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43c6fef99a8125b8d33b00c21820f611c9ff6cfc6d1e0f2a8eb9af76a93db10"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformerClassifierHF.predict (cognitive 19): TransformerClassifierHF.predict has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/classifiers/transformer_classifier_hf.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eda5d1eb639d92d5f4ae82b22381b384ff6b85e1ed7c0706ee6c71a3f4f7293"}},{"ruleId":"D2","level":"warning","message":{"text":"NgramSentenceBoundaryDetector.build_vocabs (cognitive 19): NgramSentenceBoundaryDetector.build_vocabs has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 4 (7 pts) (nesting depth added 10). 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":"hanlp/components/eos/ngram.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e98df126803161257933fb64a8bc011e93b58409a1ef80fbc6af6a2c8e81273"}},{"ruleId":"D2","level":"warning","message":{"text":"BiaffineDependencyParserTF.evaluate_dataset (cognitive 19): BiaffineDependencyParserTF.evaluate_dataset has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 7 (9 pts) (nesting depth added 6). 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":"hanlp/components/parsers/biaffine_parser_tf.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d034e9c53eea4d8958188143c9c6065bd10bf34ec4cfd7b896abcac7b8ae7804"}},{"ruleId":"D2","level":"warning","message":{"text":"SpanRankingSemanticRoleLabeler.format_dict_to_results (cognitive 19): SpanRankingSemanticRoleLabeler.format_dict_to_results has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (16 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":"hanlp/components/srl/span_rank/span_rank.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b6dba178b05ff29fa9a845d9a1a0f0526b3b15a937030f4ea2784ca551ef9d"}},{"ruleId":"D2","level":"warning","message":{"text":"srl_eval_utils.evaluate_retrieval (cognitive 19): srl_eval_utils.evaluate_retrieval has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), 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":"hanlp/components/srl/span_rank/srl_eval_utils.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"311cbc627c37e9b3a34a52b798c683c2eae9495b12deda725f8a5b6746a7c2b2"}},{"ruleId":"D2","level":"warning","message":{"text":"util_tf.build_embedding (cognitive 19): util_tf.build_embedding has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/layers/embeddings/util_tf.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be32b4c28027d26525418b32ca35ddb22d3c5822ce10acd3ea0756d01b3eb7a"}},{"ruleId":"D2","level":"warning","message":{"text":"conlleval.evaluate_iobes (cognitive 19): conlleval.evaluate_iobes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, 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":"hanlp/metrics/chunking/conlleval.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16c8de583fca1a3e99884c49ce3892551db2f6291cb8fee31897c3bd3ee2c6a"}},{"ruleId":"D2","level":"warning","message":{"text":"TableTransform.file_to_inputs (cognitive 19): TableTransform.file_to_inputs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), 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":"hanlp/transform/table_tf.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"43af9b8a1c1fcd15814c05aaced6e38cb904be299cb09700b7eddd85c644f397"}},{"ruleId":"D2","level":"warning","message":{"text":"span_util.bio_tags_to_spans (cognitive 19): span_util.bio_tags_to_spans has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, 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":"hanlp/utils/span_util.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72d96e8db07d31485b4bda6d443eae115b7caabb0fb185fb91afa91bb860a7b"}},{"ruleId":"D2","level":"warning","message":{"text":"CoNLLSentence.from_str (cognitive 19): CoNLLSentence.from_str has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (5 pts), loops 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":"plugins/hanlp_common/hanlp_common/conll.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8feb81dc93206256457f8fca21803b3643e28c45dba24c80bfdd8d5b9b7ae3a"}},{"ruleId":"D2","level":"warning","message":{"text":"Vocab3D.__call__ (cognitive 18): Vocab3D.__call__ has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96250464242a10af432ae206942ba17ffd75cbb93d737a6df6ffccb12b66179"}},{"ruleId":"D2","level":"warning","message":{"text":"AMRBartTokenizer.tokenize_amr (cognitive 18): AMRBartTokenizer.tokenize_amr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f9f472c52b97645f1e660d9639350738f9dfa6e0bfc0da80f1b090bccaa9ec"}},{"ruleId":"D2","level":"warning","message":{"text":"alg_tf.tarjan (cognitive 18): alg_tf.tarjan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (6 pts) (nesting depth added 11). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/alg_tf.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e44bed226241603b96e74fab8785efcb05ae8d015550d4fb34053c6ed982a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"alg.tarjan (cognitive 18): alg.tarjan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (6 pts) (nesting depth added 11). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/biaffine_tf/alg.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe7d2ead0cbd97fb7d91ad7a54cd5f55c4fc9ed1b2beec75f227714d02e09d5"}},{"ruleId":"D2","level":"warning","message":{"text":"amr.make_batch_for_squeeze (cognitive 18): amr.make_batch_for_squeeze has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 3 (6 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/parsing/amr.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6a841a47049ea70a61b51d8664984ff4d95a68fd82dcdc92a5ab5abc49196c"}},{"ruleId":"D2","level":"warning","message":{"text":"amr.linearize (cognitive 18): amr.linearize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 6 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/parsing/amr.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a421f65f89e0992148427ca9e966b52b4226a9783e686c2be27cfdd3787b4992"}},{"ruleId":"D2","level":"warning","message":{"text":"KerasComponent.build (cognitive 17): KerasComponent.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 1 (4 pts), boolean chains 1, ternaries 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":"hanlp/common/keras_component.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc7bf832a9aaf592c588cc0ab9c1b5c66dce7e734a2e190650435ede16256b9"}},{"ruleId":"D2","level":"warning","message":{"text":"BiaffineDependencyParser.predictions_to_human (cognitive 17): BiaffineDependencyParser.predictions_to_human has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (7 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/biaffine/biaffine_dep.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e1bd318c9bc15317b4ddd20ad5c5b220a1c90666cefef4999448075c752217"}},{"ruleId":"D2","level":"warning","message":{"text":"UniversalDependenciesDecoder.forward (cognitive 17): UniversalDependenciesDecoder.forward has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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":"hanlp/components/parsers/ud/ud_model.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06b80ed736bf26ab11baf52800a3532f420871aa0dda00d18e73e318cd26852"}},{"ruleId":"D2","level":"warning","message":{"text":"conll_dataset.get_sibs (cognitive 17): conll_dataset.get_sibs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 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":"hanlp/datasets/parsing/loaders/conll_dataset.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66b69bccc8c7c6b2c16ada3cfb2ea63db5ce850ad8cd49475f4bcbfadb7388c"}},{"ruleId":"D2","level":"warning","message":{"text":"CoNLL_DEP_Transform.inputs_to_samples (cognitive 17): CoNLL_DEP_Transform.inputs_to_samples has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), ternaries 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":"hanlp/transform/conll_tf.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca21326da68f5c797e6e8e804e1eace58433d881f9de7dffe2473714b91dbcd"}},{"ruleId":"D2","level":"warning","message":{"text":"CoNLL_DEP_Transform.XY_to_inputs_outputs (cognitive 17): CoNLL_DEP_Transform.XY_to_inputs_outputs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 1 (4 pts), loops 2 (3 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":"hanlp/transform/conll_tf.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d933c0662e692c1bd5ef6d123bf41c1115a46ada369d99ddb2f8df8b75414f0b"}},{"ruleId":"D2","level":"warning","message":{"text":"CoNLL_DEP_Transform.fit (cognitive 17): CoNLL_DEP_Transform.fit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (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":"hanlp/transform/conll_tf.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e209f214fe81024c8e6d3f78acc658e1715a35356ad675941af71b9cb2faea"}},{"ruleId":"D2","level":"warning","message":{"text":"span_util.bioul_tags_to_spans (cognitive 17): span_util.bioul_tags_to_spans has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (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. This shape REPEATS in the file: one other method here (span_util.iobes_tags_to_spans) 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":"hanlp/utils/span_util.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e006300a91bca74fa8900a7fbe9aafaba1308d46e027a0be1c71104e2780cf1"}},{"ruleId":"D2","level":"warning","message":{"text":"span_util.iobes_tags_to_spans (cognitive 17): span_util.iobes_tags_to_spans has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (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. This shape REPEATS in the file: one other method here (span_util.bioul_tags_to_spans) 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":"hanlp/utils/span_util.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e3500a0351d2f817c67bcdaf09aab968032e872c854befa500617ff5bc6a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"conll.isprojective (cognitive 17): conll.isprojective 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":"plugins/hanlp_common/hanlp_common/conll.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12a896ba11a428ce76cc8813b0098823b7e31120ab1a31999283fa59f72865c"}},{"ruleId":"D2","level":"warning","message":{"text":"TupleTrieDict.parse_longest (cognitive 17): TupleTrieDict.parse_longest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (4 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":"plugins/hanlp_trie/hanlp_trie/dictionary.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e780ce731dc37518acd110dc2c69cbfa42af34bddabf29f337c4f8dcced3df90"}},{"ruleId":"D2","level":"warning","message":{"text":"Trie.parse_longest (cognitive 17): Trie.parse_longest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (4 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":"plugins/hanlp_trie/hanlp_trie/trie.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdb6012530fd12e0203e965bbc3b42aa84c928229faaeaa4fc55dfad5ac3d29"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformerTextTransform.inputs_to_samples (cognitive 16): TransformerTextTransform.inputs_to_samples has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (5 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":"hanlp/components/classifiers/transformer_classifier_tf.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ad9e9460b038d62a59cacf3112d5e569f9b83117db0b7cb5a3ea383b4cab44"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiTaskLearning.build_optimizer (cognitive 16): MultiTaskLearning.build_optimizer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (6 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/multi_task_learning.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0d13f4fc4423ff1aab0b860374487666ebd5f189763faf8d38071efcef1a99"}},{"ruleId":"D2","level":"warning","message":{"text":"chu_liu_edmonds._find_cycle (cognitive 16): chu_liu_edmonds._find_cycle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 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":"hanlp/components/parsers/chu_liu_edmonds.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8149c5d7f9f5db30c8d6cbd029835de1baa22155f520f6033c93c0ecd4503aa"}},{"ruleId":"D2","level":"warning","message":{"text":"parse_alg.tarjan (cognitive 16): parse_alg.tarjan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (6 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":"hanlp/components/parsers/parse_alg.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55155ed26a2c504c688135b4935d358db4b224b2867132b41c9719ed2fe771e"}},{"ruleId":"D2","level":"warning","message":{"text":"parse_alg.add_secondary_arcs_by_preds (cognitive 16): parse_alg.add_secondary_arcs_by_preds has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (5 pts), boolean chains 2, error handling 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":"hanlp/components/parsers/parse_alg.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15040ece23ee7862489006b3273d7cacf9c58a168e8cb8482562740a11ca8a2"}},{"ruleId":"D2","level":"warning","message":{"text":"udify_util.get_ud_treebank_files (cognitive 16): udify_util.get_ud_treebank_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 4 (7 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":"hanlp/components/parsers/ud/udify_util.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4bb75cbcdf21e5337337feea1609fe1a496387683d730cd187272abc7c7172"}},{"ruleId":"D2","level":"warning","message":{"text":"srl_eval_utils.compute_span_f1 (cognitive 16): srl_eval_utils.compute_span_f1 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (srl_eval_utils.compute_unlabeled_span_f1) 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":"hanlp/components/srl/span_rank/srl_eval_utils.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a1ec5fcc5eb462da6ce863bac2965860e4d9d1718f4ea0efc37e56c960d60d"}},{"ruleId":"D2","level":"warning","message":{"text":"srl_eval_utils.compute_unlabeled_span_f1 (cognitive 16): srl_eval_utils.compute_unlabeled_span_f1 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (srl_eval_utils.compute_span_f1) 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":"hanlp/components/srl/span_rank/srl_eval_utils.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"41acc8dc1e286fe3f5154cb672bfc36f7b24a644ae47ca6983842de2dbaf1556"}},{"ruleId":"D2","level":"warning","message":{"text":"json_ner.prune_ner_tagset (cognitive 16): json_ner.prune_ner_tagset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/ner/loaders/json_ner.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ade22c91cc80e31b2ff06e3dc215c07051f01c5072591adea31080d55d3b9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ontonotes_loader._canonicalize_clusters (cognitive 16): ontonotes_loader._canonicalize_clusters has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), 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":"hanlp/datasets/srl/loaders/ontonotes_loader.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3846b46ae7d56957888618e3d7734fbaabb87bf5b7fa078bed4232ae134e1e07"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentState.finalize (cognitive 16): DocumentState.finalize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), 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":"hanlp/datasets/srl/ontonotes5/_utils.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"365f76e87ff89e05891caff1305e6cc3fb03c0bd614908c21ad9bd43192bdc0b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkingDataset._generate_chars_tags (cognitive 16): ChunkingDataset._generate_chars_tags has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), boolean chains 2 (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":"hanlp/datasets/tokenization/loaders/chunking_dataset.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9a2dc0a97c211eb332d1379f982de483952b20e70087f070e729b55ab24eea"}},{"ruleId":"D2","level":"warning","message":{"text":"sequence_labeling.end_of_chunk (cognitive 16): sequence_labeling.end_of_chunk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. 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. This shape REPEATS in the file: one other method here (sequence_labeling.start_of_chunk) 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":"hanlp/metrics/chunking/sequence_labeling.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c6ca5c748706f59e25d6d8a1483f1915cc78ba0f356a378562ff8ef85c05cb"}},{"ruleId":"D2","level":"warning","message":{"text":"sequence_labeling.start_of_chunk (cognitive 16): sequence_labeling.start_of_chunk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. 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. This shape REPEATS in the file: one other method here (sequence_labeling.end_of_chunk) 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":"hanlp/metrics/chunking/sequence_labeling.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6705f621bf31dec08de1c14204f5dc7140822d2492f096d966fb3693536b96"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphRepair.remove_unknown_nodes (cognitive 16): GraphRepair.remove_unknown_nodes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_common/hanlp_common/amr.py"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cb4dab8056ae72bbee5911e61744201fa7b70143275fcd34cc28f41b1afd0e"}},{"ruleId":"D2","level":"warning","message":{"text":"util.infer_space_after (cognitive 16): util.infer_space_after has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 pts), 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":"plugins/hanlp_common/hanlp_common/util.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0622a340d5157866f55a2603b75db7fc731922b6c2e97e91b2c271b01af16c80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ud/ud210.py: FileTooLong \u2014 1006 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 506 over it, 2.01\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":"hanlp/datasets/parsing/ud/ud210.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba5192b5e0b4cb72506f965267112220bbff10a57ea3e9a661d660cfbc1493c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ud/ud27.py: FileTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 342 over it, 1.68\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":"hanlp/datasets/parsing/ud/ud27.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf1eab7e993c0b938ad70bfa0d5b1688af107c93f08d0f3956edb82a223337d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform/conll_tf.py: FileTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 188 over it, 1.38\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":"hanlp/transform/conll_tf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"005c50b44b75e0d3cb3523c77d8b2a101da74492fe72fd383844c5cb7cc41914"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mtl/multi_task_learning.py: FileTooLong \u2014 683 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 183 over it, 1.37\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":"hanlp/components/mtl/multi_task_learning.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fd947e4c2a19f12214fc08bace75f8c432fa7fbe843741688353ad618fc901"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model_interface/modeling_bart.py: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 179 over it, 1.36\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":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87a23c685c0818679bee9eca66de01dce40549520217d62ca9852455a9ac3be"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: KerasComponent: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"618cde5432ada0cc1e849d3c83847c82f7707a820ba456e629aa799b4b9824af"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MultiTaskLearning: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\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":"hanlp/components/mtl/multi_task_learning.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c512e5a2a25e00b402f091cc4608810b150d16fdc16923790967e5e45dffe9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BiaffineDependencyParser: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\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":"hanlp/components/parsers/biaffine/biaffine_dep.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b8968c98c01504f9aa6f1f9c18003ed79c07ef2b0caf0f099520a77312961f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataset/tokenization_bart.py: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 63 over it, 1.13\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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a4eea674ff88d1a2422e5a3f183d6806fb7cfdf2af84039d7712369bc55f64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataset/tokenization_t5.py: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/tokenization_t5.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cf4bf09d7eecd81265ad9592ec509eae94c19ac9efca87f1f2a84c1c10a862"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: utils/io_util.py: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 54 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/utils/io_util.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffb0f226f0833418a56e4fe048a055d037fc76693e8486e4858bbbfe63e69c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ontonotes5/_utils.py: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 48 over it, 1.10\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":"hanlp/datasets/srl/ontonotes5/_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8089a2fd86bbfa6a7c190900edf7e5d9c9a882ff1528715db4d785b6c6c2a318"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HanLPClient: 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":"plugins/hanlp_restful_java/src/main/java/com/hankcs/hanlp/restful/HanLPClient.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dbdc1834af0ded0f1cc18eefcc9f89e9c9687848eb4c14ee1cd70598b5182e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: biaffine/biaffine_dep.py: FileTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 16 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":"hanlp/components/parsers/biaffine/biaffine_dep.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c711b195fdcd8412d02a990d9365ae0fe1bd88e132aa621587458825c6cb47b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform/transformer_tokenizer.py: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 7 over it, 1.01\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":"hanlp/transform/transformer_tokenizer.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91f45a9f699a34c355d18418fa1b693649871ba532afd780d39a6d2ec492f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 268 shared lines): hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:176-448 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:356-633 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:349-628 \u2014 These 3 members are variants of one another: a block of 268 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cab01b7366ebe50b8c548369cdb3f7a8b7167a56f30133fcf9f9eb95854abfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 17 shared lines): hanlp/components/amr/amrbart/common/postprocessing.py:279-311 | hanlp/components/amr/seq2seq/dataset/linearization.py:145-168 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:407-439 \u2014 These 3 members are variants of one another: a block of 17 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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6ad48d52216f36f3801ccc9a1f2eda0fb111316d70927e3559623967983680"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (113 shared lines): hanlp/components/amr/seq2seq/dataset/postprocessing.py:32-188 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:192-357 \u2014 These two members are variants of one another: 113 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":"hanlp/components/amr/seq2seq/dataset/postprocessing.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac11e56423c9ca4ca1df8334e56a8c863a18708125a82fc1d9d6dbaddaf345ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (82 corresponding lines): hanlp/components/parsers/alg_tf.py:175-256 | hanlp/components/parsers/biaffine_tf/alg.py:175-256 \u2014 These two members are one piece of code written twice and then edited apart: 82 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/alg_tf.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"896df7f52fe97ee842a0691e77aa3e6c8dd51631fe99cba9d47333907e68fc54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:266-280 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:257-273 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"29112c0fd7f703a5ed0e7ae94d89af83f469de44d6e4ba0acf893ba149bd7aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:67-81 | hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:84-95 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:88-102 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:107-118 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:80-94 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:99-107 \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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"369c586953fcf8942d033ee89ceb2d3c790aecb2f129d2bf81551e1b7d25a163"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): hanlp/components/amr/seq2seq/seq2seq_amr_parser.py:141-175 | hanlp/components/parsers/constituency/crf_constituency_parser.py:49-78 | hanlp/components/parsers/ud/ud_parser.py:216-245 | hanlp/components/srl/span_bio/span_bio.py:91-120 | hanlp/components/sts/transformer_sts.py:82-99 | hanlp/components/taggers/tagger.py:71-99 \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":"hanlp/components/amr/seq2seq/seq2seq_amr_parser.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22e1ff41979a1ce5648ecd390aa4f7fc47f402a119b86807c7f71a601c105a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1334-1391 | hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1482-1559 | hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1609-1682 | hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1747-1872 \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":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8d7910ac2a314f02a8cf7a8d6a856d1086c054d71c2d6e74eb2588fd611fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:224-254 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:636-671 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:214-245 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:631-669 \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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c396a363be8b833c7abb5584606ae682c58a8e2dd245303e6994ec1bdb24b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): hanlp/components/parsers/alg_tf.py:34-87 | hanlp/components/parsers/biaffine_tf/alg.py:34-87 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/alg_tf.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7292759b9b1b6a20c1a8e19438695b9ec86574f39c212e7040e68d7ea32c57ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (118 corresponding lines): hanlp/layers/transformers/utils_tf.py:33-150 | hanlp/transform/transformer_tokenizer.py:578-695 \u2014 These two members are one piece of code written twice and then edited apart: 118 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/layers/transformers/utils_tf.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9009761a76760f6fc6ae3bedaece4dd493bbaa94974a3e4c60fad3d93e0d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 42\u002B corresponding lines): hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:98-139 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:126-179 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:115-169 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 42 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b11d83522efdb6b897717d76d6fd9aae980f3879e0f39d2488307e4486ae834"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): hanlp/components/srl/span_rank/highway_variational_lstm.py:79-117 | hanlp/components/srl/span_rank/highway_variational_lstm.py:207-250 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_rank/highway_variational_lstm.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2470adf2c1d46d155369cdcb42a5ca40412bb8ef79fb7c81f0bfc696732a92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): hanlp/components/amr/amrbart/bart_amr_parser.py:173-205 | hanlp/components/amr/seq2seq/seq2seq_amr_parser.py:224-257 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/bart_amr_parser.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c0389d39816f7872055af5be9b723474ff3a5f4cae54557910f6d83fe846fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): hanlp/components/amr/amrbart/common/postprocessing.py:455-485 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:577-607 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4cd668139e98aae462cefe250c5ec4d291c34879c8698d344619a898a1fc33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): hanlp/datasets/ner/loaders/json_ner.py:35-89 | hanlp/datasets/srl/loaders/conll2012.py:92-142 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/ner/loaders/json_ner.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"923ccb20fb7971bec9eb909b639241a693c1391e80475047367133cd164d47d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): hanlp/components/amr/amrbart/preprocess/read_and_process.py:51-79 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:296-325 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:289-318 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/preprocess/read_and_process.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f8d29a9693ced2d87c21223e2e658da1d9c77cdea01afea96fcb1beda84280"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): hanlp/components/parsers/constituency/crf_constituency_parser.py:93-116 | hanlp/components/parsers/ud/ud_parser.py:260-282 | hanlp/components/srl/span_bio/span_bio.py:135-155 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1845bcb45405c7c36ccc989eda5936fbea7acf164936882aeaf3ca06eddb51b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): hanlp/transform/conll_tf.py:256-281 | hanlp/transform/conll_tf.py:679-709 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/conll_tf.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2164ec1e1f595bc3584eb15ed6e279c3635f8fbd46bb91a40146ec3c26e697c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): hanlp/utils/span_util.py:317-385 | hanlp/utils/span_util.py:391-447 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/utils/span_util.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82e6559682d69539837c8e0de742afe47b6038f6922a29ecab347ad69262b63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): hanlp/datasets/parsing/ud/ud210.py:20-34 | hanlp/datasets/parsing/ud/ud23.py:10-26 | hanlp/datasets/parsing/ud/ud27.py:20-34 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/parsing/ud/ud210.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b5438ccc128835c5d56b9f55aaed08fc805bbe516244a28278c20b070f0e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): hanlp/components/parsers/constituency/crf_constituency_parser.py:184-203 | hanlp/components/taggers/tagger.py:115-138 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84ff47b574c8e6ab1c6d78f87f979933fafc1c7fb6b7a6d1886f8d95d1b372f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): hanlp/components/classifiers/transformer_classifier.py:149-163 | hanlp/components/eos/ngram.py:108-122 | hanlp/components/ner/biaffine_ner/biaffine_ner.py:92-113 | hanlp/components/srl/span_rank/span_rank.py:91-110 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/classifiers/transformer_classifier.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c791ac5ff7ca068175645507d64dea54792add10db7842abef363d354460d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): hanlp/components/amr/amrbart/model_interface/modeling_bart.py:703-727 | hanlp/components/amr/amrbart/model_interface/modeling_bart.py:878-899 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"6504d3e78ea30f7e04c45b6e29192b6038407c2b59231e394c15c8c5b213f07d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): hanlp/components/eos/ngram.py:131-148 | hanlp/components/ner/biaffine_ner/biaffine_ner.py:125-147 | hanlp/components/sts/transformer_sts.py:103-127 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/eos/ngram.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3156362f9418cb7f74f25af6f27bf8a02f1e1d22630576ea901e6fa201882538"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): hanlp/components/rnn_language_model_tf.py:38-51 | hanlp/components/taggers/rnn_tagger_tf.py:34-44 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/rnn_language_model_tf.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae4db19a01cde157b1cfb3df19640510cd05d91700ac64d08a8ee0860096ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): hanlp/components/amr/amrbart/bart_amr_generation.py:35-45 | hanlp/components/amr/amrbart/bart_amr_parser.py:38-49 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/bart_amr_generation.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccd465d2fc7ab39afc9c52a36a675f59ebd2d6cb331d72902ad2d66f04c6c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): hanlp/components/distillation/losses.py:90-107 | hanlp/components/distillation/losses.py:111-131 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/distillation/losses.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd1d59d7d1f9ed4d0f0869a508f334090c9481379dfbe06154007bafd887407"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): hanlp/components/distillation/losses.py:44-61 | hanlp/components/distillation/losses.py:65-86 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/distillation/losses.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52e6eff8359667b108ac3c272a1c3b0f740279ed2c0799aadd7f65d7df5213d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): hanlp/components/amr/amrbart/bart_amr_generation.py:84-103 | hanlp/components/amr/amrbart/bart_amr_parser.py:85-104 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/bart_amr_generation.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadbc2346495b9b265ffe1257c553b5a5d4b3110ad2c37937254a9f7aa261b61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): hanlp/components/srl/span_rank/layer.py:314-325 | hanlp/components/srl/span_rank/layer.py:329-341 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_rank/layer.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cb68b4796c5826a2ca2a789f04d552abad03011113b4c1a19dcc555ab140bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): hanlp/components/classifiers/transformer_classifier.py:170-189 | hanlp/components/taggers/rnn_tagger.py:88-106 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/classifiers/transformer_classifier.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"427e80bfadbded6d99f621e9399f1f507b65db3d36f2a71169d4e428faac257e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): plugins/hanlp_trie/hanlp_trie/dictionary.py:185-216 | plugins/hanlp_trie/hanlp_trie/trie.py:124-155 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_trie/hanlp_trie/dictionary.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31334a67457fadabd6569103f2f77c3416361d2b42f334b0ea2d941ad65ab11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): hanlp/components/parsers/ud/ud_parser.py:114-129 | hanlp/components/srl/span_bio/span_bio.py:357-369 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/ud/ud_parser.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ac81ea9c312e6a14adefbcb848a1b828628f9ea3b49e09ec8b9aeef29a9b4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): hanlp/components/mtl/tasks/ner/tag_ner.py:121-133 | hanlp/components/mtl/tasks/tok/tag_tok.py:97-114 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/tasks/ner/tag_ner.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"678083f674abda43a0c42b591609ab107c7ee9b911d47bf6e599d04339621019"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): hanlp/components/parsers/constituency/crf_constituency_parser.py:220-235 | hanlp/components/srl/span_bio/span_bio.py:252-267 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc048cd317ff1061f86e203033762685957c02776578d175750f70fed28fd0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): hanlp/components/parsers/constituency/crf_constituency_parser.py:238-256 | hanlp/components/parsers/ud/ud_parser.py:156-180 | hanlp/components/srl/span_bio/span_bio.py:293-309 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc3b355369ab5ddd1bd980e1f9cdf8f8d14c582054ddd47c964159a68e4681a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): hanlp/components/ner/biaffine_ner/biaffine_ner.py:48-64 | hanlp/components/srl/span_rank/span_rank.py:49-66 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/ner/biaffine_ner/biaffine_ner.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f457ec95c29695d01434190d2c36344242a14b7ad97654a2393ae95ca2f3d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): hanlp/metrics/chunking/conlleval.py:295-306 | hanlp/metrics/chunking/conlleval.py:312-329 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/metrics/chunking/conlleval.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3942e4e8a1cdd74143e2aeb345452c8bf5ab8be6c986e74b7d813ea675062ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): hanlp/components/amr/seq2seq/seq2seq_amr_parser.py:381-397 | hanlp/components/ner/biaffine_ner/biaffine_ner.py:233-250 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/seq2seq_amr_parser.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e0d52f8f9d18c136ab0bdb9f06534c26eb118b13d56db68685924b310c8e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): hanlp/components/classifiers/transformer_classifier_tf.py:160-174 | hanlp/layers/transformers/utils_tf.py:155-170 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/classifiers/transformer_classifier_tf.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad284f4912fd2878a6293d8958dbc45998c1b9a612f14392d5468965a4c8116b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): hanlp/common/vocab.py:15-40 | hanlp/common/vocab_tf.py:15-33 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e4d22dc4fc88b3e6a38d20e49486c594bd9c16902cc939080b02e2b7cd889d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): hanlp/common/vocab.py:245-258 | hanlp/common/vocab.py:477-502 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb76a4c58519fad82c4763015d29bf255d2fb8b6f682802657e0d2c45731b748"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): hanlp/components/mtl/tasks/constituency.py:87-99 | hanlp/components/mtl/tasks/sdp.py:116-128 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/tasks/constituency.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c139c0f35ee6d7b00fd9496052b28957a7a30587fbf8118d0d1d54d77d2d985"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): hanlp/components/parsers/biaffine/structual_attention.py:104-115 | hanlp/layers/dropout.py:24-60 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/biaffine/structual_attention.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d3c39fec37df98704de4dc087d02b06c43c207cc70a95820556ac01b95c734"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): hanlp/layers/embeddings/char_cnn_tf.py:21-30 | hanlp/layers/embeddings/char_rnn_tf.py:18-27 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/layers/embeddings/char_cnn_tf.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"768967c6e251ba5b6d705b4d221a8d80deace5804debbc60ae92db919e9e414b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): hanlp/common/vocab.py:47-65 | hanlp/common/vocab_tf.py:40-50 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae537fbbe4d76250f673fcc7348a57ad06a96828d5527443ba0f0919a30a1821"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): hanlp/datasets/coref/loaders/conll12coref.py:17-48 | hanlp/datasets/srl/loaders/ontonotes_loader.py:206-230 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/coref/loaders/conll12coref.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1a7d6581e2b7c253e350ad0cddeb297a6d7f07420f4381955a6e0d649e0429"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): hanlp/components/parsers/biaffine_tf/layers.py:109-118 | hanlp/layers/dropout.py:131-140 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/biaffine_tf/layers.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9aebb18e5302a61573ba2c582ddab3fbd52f56be610abd305d0a295ebd0d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): hanlp/components/parsers/biaffine/biaffine.py:78-98 | hanlp/components/parsers/biaffine_tf/layers.py:37-47 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/biaffine/biaffine.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaf1f64d7a7246bd4eb0e1f14c462e37bd7f1a2ff9896c62d9bad9d81e8e929"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): hanlp/components/parsers/constituency/crf_constituency_parser.py:314-322 | hanlp/components/srl/span_rank/span_rank.py:356-369 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fd772b1181670a4731d4ac37738fd96af4d340025942251879611147c63fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): hanlp/transform/conll_tf.py:204-208 | hanlp/transform/conll_tf.py:772-776 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/conll_tf.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"67186e8408bc85ff948c329d3a12180c3f2dae3fd551db5165f87523c27cc0fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): hanlp/optimizers/adamw/__init__.py:36-71 | hanlp/optimizers/adamw/optimization.py:69-95 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/optimizers/adamw/__init__.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed6577879fd3e943dfd99ff40ae7aee9b38d839be8c1a5a83d42f9d1134798c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): hanlp/components/mtl/tasks/ner/biaffine_ner.py:81-91 | hanlp/components/mtl/tasks/srl/bio_srl.py:69-77 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/tasks/ner/biaffine_ner.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d52d81f77180eae81c6f7dcf6cd7aba78beadfaef233e545c5a428d3167fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): hanlp/common/dataset.py:44-62 | hanlp/common/dataset.py:65-85 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/dataset.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598f65e29cbd7cefde9a80cc9f7703a8d5e9a38826a22bcf95bb25929962d70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): hanlp/components/ner/biaffine_ner/biaffine_ner_model.py:28-41 | hanlp/components/srl/span_rank/span_ranking_srl_model.py:480-492 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/ner/biaffine_ner/biaffine_ner_model.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6e317a193dd635a6ce91f3cfbfe7179d01809789c5ef01961d46d4ac96c91c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): hanlp/transform/conll_tf.py:294-303 | hanlp/transform/conll_tf.py:383-390 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/conll_tf.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a63bb09cc0e7be1d5b37c510eb134336384b94dc3923a68f9b9352b16013821"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): hanlp/common/vocab.py:76-93 | hanlp/common/vocab_tf.py:61-68 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc0ded197dae66e0b5b7a568189c792a629ddae0e274f3b6bccf694b9f80965"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): hanlp/components/parsers/biaffine/biaffine_dep.py:488-495 | hanlp/components/parsers/biaffine_parser_tf.py:188-195 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/biaffine/biaffine_dep.py"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab46d272fa8fe4be8c51146895a52e892e40f6c5dee9572dec290971c0330a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): hanlp/utils/log_util.py:108-112 | hanlp/utils/log_util.py:116-120 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/utils/log_util.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66bef7c1183e0748381440a37003235565db4863e1dd65f6f6e7132583414d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): hanlp/components/parsers/ud/tag_decoder.py:80-93 | hanlp/components/parsers/ud/tag_decoder.py:96-107 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/ud/tag_decoder.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f55147b55c6af32480adaf2a3c06681e5ccb9ccb7e89999bebff9793385f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): hanlp/components/tokenizers/tok_tf.py:81-85 | hanlp/transform/txt_tf.py:197-201 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/tokenizers/tok_tf.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3da25bd48b1c0a9ad384f3973e528bce4ededac2b44ab474f76717458ce5c62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): hanlp/components/mtl/tasks/srl/bio_srl.py:109-117 | hanlp/components/srl/span_bio/span_bio.py:205-213 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/tasks/srl/bio_srl.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b1e66dc52c3cb6a9f58413abbba04e92e5fa515f2ed0e6185068c0f6af5ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): hanlp/components/srl/span_rank/layer.py:69-75 | hanlp/components/srl/span_rank/layer.py:78-81 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_rank/layer.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2a9613264c72cc91a52e89a0e35cde027d6fc62cf23bf5bfa84bea24e2197e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): hanlp/metrics/chunking/bmes_tf.py:35-42 | hanlp/metrics/f1.py:22-28 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/metrics/chunking/bmes_tf.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eae71f88e91041925381cbb18483972a38876cc7dfdba5b90e35a01a06974cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 7\u002B corresponding lines): plugins/hanlp_restful_java/src/main/java/com/hankcs/hanlp/restful/HanLPClient.java:202-209 | plugins/hanlp_restful_java/src/main/java/com/hankcs/hanlp/restful/HanLPClient.java:219-225 | plugins/hanlp_restful_java/src/main/java/com/hankcs/hanlp/restful/HanLPClient.java:337-345 | plugins/hanlp_restful_java/src/main/java/com/hankcs/hanlp/restful/HanLPClient.java:420-427 | plugins/hanlp_restful_java/src/main/java/com/hankcs/hanlp/restful/HanLPClient.java:453-460 | plugins/hanlp_restful_java/src/main/java/com/hankcs/hanlp/restful/HanLPClient.java:525-533 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_restful_java/src/main/java/com/hankcs/hanlp/restful/HanLPClient.java"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dfb7e09cd2d1ae17f351ed9ef7775e15fcc3f81a64697a657b45d5eab173de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): hanlp/components/parsers/biaffine_tf/layers.py:81-88 | hanlp/layers/dropout.py:82-89 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/biaffine_tf/layers.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6178be3842c645f0bd2b566c1006bfd77c9d1d3c2539bec31497d767e197b60b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): hanlp/common/vocab.py:106-124 | hanlp/common/vocab.py:388-397 | hanlp/common/vocab_tf.py:85-92 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"031c6845a58fee8a612f7e600cd8d7c46bd1c535cd0b058994366756f0f4775e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): hanlp/layers/embeddings/char_cnn.py:124-130 | hanlp/layers/embeddings/char_rnn.py:93-98 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/layers/embeddings/char_cnn.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4fe556f5900dbfdf16dcd57aa96eb5651b81720a82984e9d4b781c50af0e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): hanlp/transform/tsv_tf.py:134-140 | hanlp/transform/text_tf.py:80-85 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/tsv_tf.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"956b3756fdccfcb45862abadebf49523bf3670e0990c98e27700f40fed815dfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): hanlp/common/keras_component.py:177-181 | hanlp/common/transform.py:115-125 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"51514f907f683352196660355b9affe862ec20355079836dae08aa73d7fbd9de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): hanlp/components/parsers/biaffine/biaffine.py:66-72 | hanlp/components/parsers/biaffine_tf/layers.py:27-33 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/biaffine/biaffine.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b5577626b5cd3fdb0f17e9755f5e5b6d8772c6c6f0633a46f4bc5820cd749b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): hanlp/common/vocab.py:225-242 | hanlp/common/vocab_tf.py:174-178 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fdb9756be4e71be45fdb5074edc097f9ac0ade18ae7c1cf4d0e56c4f369ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): hanlp/components/classifiers/transformer_classifier_tf.py:183-186 | hanlp/components/taggers/transformers/transformer_tagger_tf.py:68-71 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/classifiers/transformer_classifier_tf.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ccead88452c7f4b73c68adbcc9a90b95fb3660ffe83bc9ddb03d033e281248"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): hanlp/common/vocab.py:169-172 | hanlp/common/vocab_tf.py:124-127 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3633ce8a698ea0f3c81cad544f168eda02a28f792cad409e48d707ef0c67521a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): hanlp/common/transform.py:245-246 | plugins/hanlp_common/hanlp_common/configurable.py:38-45 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/transform.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8f092af514a0dfe438c2d03b06440187e4edd40caf1441887f4c75219b0486"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): hanlp/components/ner/ner_tf.py:49-53 | hanlp/components/taggers/rnn_tagger_tf.py:61-65 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/ner/ner_tf.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7082a4a5f9fb7caa42e7fd19572f5090ddd199050a90ca17c206c1c677eb41ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): hanlp/common/vocab.py:276-288 | hanlp/common/vocab_tf.py:204-208 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0992469374a2273fef65076078a5aa9dff68c4ce83d76533cf916c4c80ab10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): hanlp/components/mtl/tasks/ud.py:139-144 | hanlp/components/parsers/ud/ud_parser.py:303-308 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/tasks/ud.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"942ec915350530cae82d1c2bfe0553e33ce7a3bd780d445776a7327df95ae951"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): hanlp/components/ner/transformer_ner.py:40-43 | hanlp/components/tokenizers/transformer.py:103-106 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/ner/transformer_ner.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"88426773d894c43a8f135c8a7b2db1941c794b1c2ab964cc4e3484849cf8d694"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:82-85 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:74-77 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac8651ce99b30da93003586d37befcb61add43591fd8efc963fb5993343c1cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): hanlp/common/vocab.py:261-273 | hanlp/common/vocab_tf.py:195-201 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f85e0b78eee8536aa12fb6a4eb4b185662e679e1878a3cb4d4d0c71014364c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): hanlp/common/vocab.py:291-302 | hanlp/common/vocab_tf.py:211-216 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a779839783b3fc8fc99ae3abfcfabbe2ead4db7627b10f5cd57e8341704e26e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): hanlp/common/vocab.py:133-147 | hanlp/common/vocab_tf.py:101-107 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9845a9fe57d3a644a59bee3cf159e68fbab1e7e5483ecde82889634018dff186"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): hanlp/components/ner/biaffine_ner/biaffine_ner_model.py:19-22 | hanlp/components/srl/span_rank/highway_variational_lstm.py:12-15 | hanlp/components/srl/span_rank/span_ranking_srl_model.py:14-17 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/ner/biaffine_ner/biaffine_ner_model.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c0013220b545682b163a52f102aad1da7613aabf232d270d107dfb87ff88f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): hanlp/components/parsers/biaffine/biaffine_dep.py:351-355 | hanlp/components/parsers/biaffine/structual_attention.py:202-206 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/biaffine/biaffine_dep.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec523b2fe9352dba4f0e9148d3f2bbb95ab6c406412c9d2e144c9fcf3625d1d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 5\u002B corresponding lines): hanlp/layers/crf/crf_layer_tf.py:56-62 | hanlp/layers/embeddings/char_cnn_tf.py:49-56 | hanlp/layers/embeddings/char_rnn_tf.py:55-61 | hanlp/layers/embeddings/concat_embedding.py:49-53 | hanlp/layers/embeddings/contextual_string_embedding_tf.py:114-120 | hanlp/layers/embeddings/word2vec_tf.py:167-174 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/layers/crf/crf_layer_tf.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"25073b692b1504aba9c9060c1f4d5d813ed5ac6897c2294ec93cee7909d2ef4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): hanlp/components/mtl/tasks/dep.py:101-104 | hanlp/components/mtl/tasks/sdp.py:102-105 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/tasks/dep.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be70bf22bbdbcee7286e5afee257e4cd42eb7351dcc9d63667c418e1cd9ae6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): hanlp/transform/text_tf.py:43-46 | hanlp/transform/tsv_tf.py:102-105 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/text_tf.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d18a27f3de23079f533aace915d219000bdc84145e82dfc5dd186e5c4685065"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): hanlp/common/vocab.py:127-130 | hanlp/common/vocab_tf.py:95-98 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b2139b1a74af402a97168c8b1b39bbd68acffabdea775fc8fa07d855a237ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:202-203 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:192-193 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ef33de7bf5ae962b6be2d25a06be87ab90d27de1943833d94fcf7db5f0ba45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): hanlp/components/mtl/tasks/ner/tag_ner.py:28-31 | hanlp/components/mtl/tasks/pos.py:27-36 | hanlp/components/mtl/tasks/tok/tag_tok.py:28-30 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/tasks/ner/tag_ner.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4de621d1905f5c1e3ffd5a4c1e179d04e41b7c19bcc4a9bae76bdaaf02500d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): hanlp/components/mtl/tasks/dep.py:107-108 | hanlp/components/mtl/tasks/sdp.py:108-109 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/tasks/dep.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3359e9bd1a8ea8f0796ced5194c1614e11c996b027f7940da12ab644164eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): hanlp/components/mtl/tasks/dep_2nd.py:76-77 | hanlp/components/mtl/tasks/sdp.py:88-89 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/tasks/dep_2nd.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d838a6cc788eb03295e8016102023e5dd5fb5ff0495be9169512d8753674187"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:39-41 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:40-42 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"42142df0209c6188646770e9e3f0a7d0d4099f2ab945fb7aef4c6a74dcfc13ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (209 lines \u00D7 3): hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:211-419 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:392-600 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:387-595 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/model_interface/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 334 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:211\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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e806da54b32e483ef78fb17462506d67031776c9bc78dce09b696f841ee4da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (83\u201390 lines \u00D7 3): hanlp/components/amr/amrbart/common/postprocessing.py:130-219 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:95-177 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:264-346 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/common/postprocessing.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/postprocessing.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 290 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5203710be5ecbc033646aeab690e5cec49b4e5e1aed82cde97c8f6710179a155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (69 lines \u00D7 2): hanlp/layers/transformers/utils_tf.py:82-150 | hanlp/transform/transformer_tokenizer.py:627-695 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/layers/transformers/utils_tf.py:82\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":"hanlp/layers/transformers/utils_tf.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eaeb1f4217aaafb5df33fadaaaa546b87a7c4af662e074530768e69cc039d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): hanlp/layers/transformers/utils_tf.py:33-79 | hanlp/transform/transformer_tokenizer.py:578-624 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/layers/transformers/utils_tf.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4772b66fd01e10f3fb99233e3fde0f76b7cab3966a33b2f21f8e30e8098ef2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): hanlp/utils/span_util.py:468-509 | hanlp/utils/span_util.py:515-556 \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":"hanlp/utils/span_util.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6113bf4e34901e61fe75b3eef86a9e166ea3b56ef363826df8eefd8286e0115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): hanlp/components/amr/amrbart/common/postprocessing.py:78-112 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:47-81 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/common/postprocessing.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/postprocessing.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 290 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"693735ddf4b9f6d32cd4e9930f4ff90e445d06e8812968837facfe019846676a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 3): hanlp/components/parsers/alg_tf.py:122-154 | hanlp/components/parsers/biaffine_tf/alg.py:122-154 | hanlp/components/parsers/parse_alg.py:42-74 \u2014 before extracting anything, compare \u0060hanlp/components/parsers/alg_tf.py\u0060 and \u0060hanlp/components/parsers/biaffine_tf/alg.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"hanlp/components/parsers/alg_tf.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5445c89d92adf94e3de58b5642c9cf78f5f934a8b3157b15098eeee38808cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201331 lines \u00D7 3): hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:422-448 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:603-633 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:598-628 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/model_interface/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 334 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:422\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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc26ae6e2cf2acc2509b9b1ebd1e63015a20326e97eae012f14f95cf89e5f95b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 3): hanlp/components/parsers/alg_tf.py:190-219 | hanlp/components/parsers/biaffine_tf/alg.py:190-219 | hanlp/components/parsers/parse_alg.py:188-217 \u2014 before extracting anything, compare \u0060hanlp/components/parsers/alg_tf.py\u0060 and \u0060hanlp/components/parsers/biaffine_tf/alg.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/alg_tf.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"583ae179fbd13fe701de5899f602577be791cfa83add96ca6fd73efdd8d4d37d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): hanlp/components/parsers/alg_tf.py:260-289 | hanlp/components/parsers/biaffine_tf/alg.py:260-289 \u2014 before extracting anything, compare \u0060hanlp/components/parsers/alg_tf.py\u0060 and \u0060hanlp/components/parsers/biaffine_tf/alg.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"hanlp/components/parsers/alg_tf.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d23ca084703679046bbd4c24ec1591d568767024d409d0c313140b2712c9275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): hanlp/metrics/chunking/sequence_labeling.py:84-111 | hanlp/metrics/chunking/sequence_labeling.py:115-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/metrics/chunking/sequence_labeling.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0db721f8dc2267475c42f0d3cc7cf24e2c479e82271575858e95c9fc0a6622"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): hanlp/components/amr/amrbart/common/postprocessing.py:489-514 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:611-636 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/common/postprocessing.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/postprocessing.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 290 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96bc5a9002be9027d2aa4348f855859cf2a3863d28fc74cf9ff6be22f69c888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3): hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:451-475 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:328-352 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:321-345 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/model_interface/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 334 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ee401d86196d3d3207b39bd1d8ec9f6175805e7b5bb10a72167b653a42baf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): hanlp/components/parsers/alg_tf.py:95-118 | hanlp/components/parsers/biaffine_tf/alg.py:95-118 | hanlp/components/parsers/parse_alg.py:15-38 \u2014 before extracting anything, compare \u0060hanlp/components/parsers/alg_tf.py\u0060 and \u0060hanlp/components/parsers/biaffine_tf/alg.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/alg_tf.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a734c2d88b7502428e9b826387b679604ee8b7b2e25462ee14a6352d0d4dc3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): hanlp/components/amr/amrbart/common/postprocessing.py:254-274 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:379-402 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/common/postprocessing.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/postprocessing.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 290 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e170971b0330843cacecc6a8a502c393f87ff0c6ee8cd202d07fbb09dd9e773a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:153-176 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:143-166 \u2014 before extracting anything, compare \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 488 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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e97de08b3ebe2ffd265b2589f138b7019c91b86622cf9cc417e59ef80996b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): hanlp/components/srl/span_rank/srl_eval_utils.py:105-127 | hanlp/components/srl/span_rank/srl_eval_utils.py:131-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_rank/srl_eval_utils.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c430afc9e5efca7feba7944c1fad6ffea34323b6aa5d8586d50bd4104f7e1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:188-209 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:369-390 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:364-385 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/model_interface/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 334 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:360\u0060 calls \u0060Graph\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:365\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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9e241721521c2858ed69f057af11e5769f020573f39de2eb268b668b2935ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): hanlp/components/amr/amrbart/common/postprocessing.py:291-311 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:419-439 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/common/postprocessing.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/postprocessing.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 290 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a03b81895181c9cae32084561eedfeb3ff5b813887db8f24ecb8c3b4ca0b92c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201321 lines \u00D7 4): hanlp/components/parsers/alg_tf.py:34-54 | hanlp/components/parsers/alg_tf.py:76-77 | hanlp/components/parsers/biaffine_tf/alg.py:34-54 | hanlp/components/parsers/biaffine_tf/alg.py:76-77 \u2014 before extracting anything, compare \u0060hanlp/components/parsers/alg_tf.py\u0060 and \u0060hanlp/components/parsers/biaffine_tf/alg.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060hanlp/components/parsers/alg_tf.py:54\u0060 calls \u0060abs\u0060, \u0060expand_dims\u0060 and \u0060hanlp/components/parsers/alg_tf.py:77\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":"hanlp/components/parsers/alg_tf.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6cc7d34d58f8b299546b7aba71e07e7234954a1928ba45c20b41779463c236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): hanlp/components/amr/amrbart/preprocess/read_and_process.py:57-76 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:302-321 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:295-314 \u2014 before extracting anything, compare \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 488 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":"hanlp/components/amr/amrbart/preprocess/read_and_process.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5c5d6ea2153ffbe61eda1d6fe9d23370c000c564bfcace99b66ed80716e31b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): hanlp/components/parsers/ud/udify_util.py:77-92 | hanlp/components/parsers/ud/udify_util.py:237-256 \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. 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":"hanlp/components/parsers/ud/udify_util.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"65657762e5f8a4cb878bdd6bc11d803fc7fbee7d3b416d264041e4ffd65c5e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): hanlp/transform/conll_tf.py:147-165 | hanlp/transform/conll_tf.py:581-600 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/conll_tf.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fae847f3ed5973d4abe92453fc580bd48983c2a6096b3c6425fc770a48498e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): hanlp/components/amr/seq2seq/dataset/postprocessing.py:32-50 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:192-210 \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":"hanlp/components/amr/seq2seq/dataset/postprocessing.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"803d8482759eac453f6e36e2ee68b60c431c0f9b72d11f3fb02eff9a24f7543a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): hanlp/components/amr/amrbart/common/postprocessing.py:457-482 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:579-604 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/common/postprocessing.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/postprocessing.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 290 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6931b56f281df3ea2c147b384088f4945f38983d1e65c1427d14d2a2e3fbcd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): hanlp/components/amr/amrbart/common/postprocessing.py:279-295 | hanlp/components/amr/seq2seq/dataset/linearization.py:145-161 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:407-423 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/common/postprocessing.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/postprocessing.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 290 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"7119ddeea583282f333a6a46cce8ba5ad93e115ead7ad090797369b51f82428b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 3): hanlp/components/parsers/alg_tf.py:221-256 | hanlp/components/parsers/biaffine_tf/alg.py:221-256 | hanlp/components/parsers/parse_alg.py:139-174 \u2014 before extracting anything, compare \u0060hanlp/components/parsers/alg_tf.py\u0060 and \u0060hanlp/components/parsers/biaffine_tf/alg.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"hanlp/components/parsers/alg_tf.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa88fb2d616902f0a59d38e391e5bbe3a121fbaeca544b4ef2ca6cdceffb078"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): hanlp/components/amr/amrbart/common/postprocessing.py:234-250 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:361-375 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/common/postprocessing.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/postprocessing.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 290 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcb7b553f91e4048047624282d70541efc1860fc821f8a287bafee58c6844f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1497-1512 | hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1624-1640 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1497\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":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53425d95c823a1413419d88c0f7e43e656e00ca8888f7e12bcea1ecb9dc986f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): hanlp/components/parsers/constituency/crf_constituency_parser.py:56-73 | hanlp/components/taggers/tagger.py:76-93 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc98ba81e9ed4d2b4bb1e3740044a75830b2c285aa31b4a81adee0f621b5ecf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): hanlp/transform/conll_tf.py:456-472 | hanlp/transform/conll_tf.py:556-572 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060hanlp/transform/conll_tf.py:555\u0060 calls \u0060adjust_tokens_for_transformers\u0060 and \u0060hanlp/transform/conll_tf.py:455\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":"hanlp/transform/conll_tf.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3983d7d8690468ab8e0d1a5c8a398b9115c99418748ab1b2d9653b19a61f85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): hanlp/components/amr/amrbart/bart_amr_generation.py:88-103 | hanlp/components/amr/amrbart/bart_amr_parser.py:89-104 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/bart_amr_generation.py\u0060 and \u0060hanlp/components/amr/amrbart/bart_amr_parser.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/components/amr/amrbart/bart_amr_generation.py:88\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"hanlp/components/amr/amrbart/bart_amr_generation.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd7e4bb598d4b265d92ed1d3322a0dfa6985eefc8ef1212ae73c552073cfc8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1351-1366 | hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1494-1509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1351\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":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e825f7ceb9c320e78ac632a1a958dfa35e7071143cb6184b842603b67eb7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1353-1367 | hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1496-1510 | hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1623-1637 \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 \u0060hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1353\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4ee35190ba44e63dc2a61901b15299a7ca42ad5f33bba1929ff8367444ff4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:52-66 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:54-68 \u2014 before extracting anything, compare \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 488 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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be34bfca55eda1585fc610cc066970914e4cc8f2f6ac3d9a95baf84b5075146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:137-151 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:127-141 \u2014 before extracting anything, compare \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 488 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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c365d837eedbaca6b5fec319992d37926f95412cdc138e34c4eaca71b5aa830d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:236-249 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:653-666 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:227-240 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:650-663 \u2014 before extracting anything, compare \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 488 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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2e06c86a235d18a7a832c3813354b0c895cb0fdb40243b8ea55d09325b069c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:206-221 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:196-211 \u2014 before extracting anything, compare \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 488 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 \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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd0bf80484df8a4a866646e6aab9bb80ec8841b19baeb57236152459c9f0d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): hanlp/components/parsers/constituency/crf_constituency_parser.py:63-75 | hanlp/components/parsers/ud/ud_parser.py:230-242 | hanlp/components/srl/span_bio/span_bio.py:105-117 | hanlp/components/taggers/tagger.py:83-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. 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":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b440e78b676decaa83ccd11f3e10aa67814452063017e1ce3c5183d204eb58af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): hanlp/components/amr/amrbart/preprocess/read_and_process.py:34-46 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:266-278 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:257-269 \u2014 before extracting anything, compare \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 488 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":"hanlp/components/amr/amrbart/preprocess/read_and_process.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"995c831464cdaee004fd1605456398dabfdaf7d1c146d68f57d2ebe561b723aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): hanlp/components/amr/amrbart/bart_amr_parser.py:193-205 | hanlp/components/amr/seq2seq/seq2seq_amr_parser.py:245-257 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"hanlp/components/amr/amrbart/bart_amr_parser.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9001bef09115d52536e42e02047fdf17b146f231d70f2b82c6d8ac1d31e3fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): hanlp/components/amr/amrbart/common/postprocessing.py:40-52 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:16-28 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/common/postprocessing.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/postprocessing.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 290 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d63ba1166f978f5ea9c48256190c73f2efe59438f3855cfb6db08f859bc3ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1357-1369 | hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1840-1854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1357\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":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"0574ebd23c98b7eec2ca78c3d9db5c99b92e5a582c32586ba521efd087ddff95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): hanlp/components/ner/biaffine_ner/biaffine_ner.py:52-64 | hanlp/components/srl/span_rank/span_rank.py:54-66 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/components/ner/biaffine_ner/biaffine_ner.py:52\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060hanlp/components/ner/biaffine_ner/biaffine_ner.py:67\u0060 calls \u0060use_transformer\u0060 and \u0060hanlp/components/srl/span_rank/span_rank.py:68\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":"hanlp/components/ner/biaffine_ner/biaffine_ner.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd540cbebddac7539138014ba6c7a2bca3c8ed375a96cb7195e26cdee40c7aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): hanlp/components/amr/amrbart/bart_amr_parser.py:131-142 | hanlp/components/amr/seq2seq/seq2seq_amr_parser.py:276-283 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/components/amr/amrbart/bart_amr_parser.py:131\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":"hanlp/components/amr/amrbart/bart_amr_parser.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f5c2c18d8f55ba22e355b36ad91bb121cab1aafb36cb78b4282e1e6076466e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): hanlp/components/amr/amrbart/model_interface/modeling_bart.py:785-796 | hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1010-1021 \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":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bf27a3bda5a45e4f0e21871aba69a0656e36c3c9d08f0d5584d05c45b3a31a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): hanlp/components/classifiers/transformer_classifier_hf.py:25-36 | hanlp/components/classifiers/transformer_regression_hf.py:25-36 \u2014 before extracting anything, compare \u0060hanlp/components/classifiers/transformer_classifier_hf.py\u0060 and \u0060hanlp/components/classifiers/transformer_regression_hf.py\u0060 as WHOLE FILES: 91% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"hanlp/components/classifiers/transformer_classifier_hf.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"985c6d074a8ff8e872549444b0046c1d25c04eaafbbba4091c705ca6c093f885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): hanlp/components/ner/biaffine_ner/biaffine_ner.py:101-112 | hanlp/components/srl/span_rank/span_rank.py:99-110 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/components/ner/biaffine_ner/biaffine_ner.py:101\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":"hanlp/components/ner/biaffine_ner/biaffine_ner.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad875c11e84a8da69cc2881ab7a90f98b8a2ab276f19f49f1d7cac5b8e3f5f02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): hanlp/metrics/chunking/conlleval.py:296-306 | hanlp/metrics/chunking/conlleval.py:313-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/metrics/chunking/conlleval.py:296\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":"hanlp/metrics/chunking/conlleval.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade09095ce3ba1e2249c3e343a78160effdccff45815a68fa40ac95733dbc4e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): hanlp/components/amr/amrbart/common/postprocessing.py:88-98 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:57-67 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:222-232 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/common/postprocessing.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/postprocessing.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 290 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7482d6aa13d2f68595c4d446e3b065d43b1ce840d9b432abda0eb46537098b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): hanlp/datasets/parsing/ud/ud210.py:22-33 | hanlp/datasets/parsing/ud/ud23.py:15-26 | hanlp/datasets/parsing/ud/ud27.py:22-33 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/datasets/parsing/ud/ud210.py:22\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/parsing/ud/ud210.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"76aa5939a4b693fbdc88c41295027a4e787b30a9416f83e4ca503c8ee69f2c39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hanlp/common/vocab.py:55-65 | hanlp/common/vocab_tf.py:40-50 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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, \u0060hanlp/common/vocab.py:50\u0060 calls \u0060token\u0060 and \u0060hanlp/common/vocab_tf.py:39\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":"hanlp/common/vocab.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9f64ff218ac8f3206c24e35fab9a9c77caf3bf69ad91a807e39382e1b06c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:283-293 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:276-286 \u2014 before extracting anything, compare \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 488 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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03ad7088ee0002b0a6d3c80bd8a95a1a325713cdbee43537092c7dad06c6bbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hanlp/components/ner/biaffine_ner/biaffine_ner.py:133-143 | hanlp/components/sts/transformer_sts.py:112-122 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060hanlp/components/sts/transformer_sts.py:123\u0060 calls \u0060zero_grad\u0060 and \u0060hanlp/components/ner/biaffine_ner/biaffine_ner.py:144\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":"hanlp/components/ner/biaffine_ner/biaffine_ner.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5af6dc09149d28ace11471ddacc1544da28ce80b7b291d713b25dcec3a477e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hanlp/components/srl/span_rank/highway_variational_lstm.py:24-34 | hanlp/components/srl/span_rank/highway_variational_lstm.py:126-136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_rank/highway_variational_lstm.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad63c0e31a8828a7d77cf918abf5ffbf768908822aaeb637223a24fe164db775"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hanlp/datasets/coref/loaders/conll12coref.py:33-43 | hanlp/datasets/srl/loaders/ontonotes_loader.py:216-226 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/datasets/coref/loaders/conll12coref.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f0da8f7a88beaa54e50eadcab844bb7c82a51aaaf23896c85fc5ff82f60053"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): hanlp/components/amr/amrbart/common/postprocessing.py:348-357 | hanlp/components/amr/amrbart/common/postprocessing.py:418-427 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:476-485 | hanlp/components/amr/seq2seq/dataset/postprocessing.py:541-550 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/common/postprocessing.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/postprocessing.py\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 290 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62955b2f7c71fbb116a58f8c0282972a26634766a65ce42606d1acfa71b277c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:176-185 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:356-365 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:349-358 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/model_interface/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 334 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:360\u0060 calls \u0060Graph\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:367\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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b02501e4f0b1c1b877e714d74808a2cd7022391d1b897ad44b00f7004f2e78b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): hanlp/components/parsers/biaffine/biaffine_dep.py:208-217 | hanlp/components/parsers/constituency/crf_constituency_parser.py:58-65 | hanlp/components/taggers/tagger.py:78-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/biaffine/biaffine_dep.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c996e7ce7241012225725ed622048ea31cbecaacece773b54f79458c3ab828"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): hanlp/common/vocab.py:245-254 | hanlp/common/vocab.py:486-495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d0453d41796f41a349e40ebdcc214d225cdc7324cbab0015099855a114c110"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): hanlp/components/mtl/tasks/lem.py:85-95 | hanlp/components/mtl/tasks/pos.py:122-132 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"hanlp/components/mtl/tasks/lem.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dd00b99a573d11b9dd520b25985ea699bf8ddca7fcedf1094cb6ff84ed824e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): hanlp/components/srl/span_rank/highway_variational_lstm.py:67-76 | hanlp/components/srl/span_rank/highway_variational_lstm.py:195-204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_rank/highway_variational_lstm.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9079e210ee6ade9d4c9f68072e840987bc6751c87079ad0662dc0251d173e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): hanlp/transform/conll_tf.py:257-266 | hanlp/transform/conll_tf.py:679-688 \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":"hanlp/transform/conll_tf.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac4c4b089a309b9b7a99631c7325070bbc569f009cb748cf17c0722b430eedd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:25-33 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:26-34 \u2014 before extracting anything, compare \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 488 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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37a581b00a0613d405494e6aa3d44e16e0fa9512364ca35d04b5da54dcab861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): hanlp/components/parsers/alg.py:139-145 | hanlp/components/parsers/alg.py:629-637 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060hanlp/components/parsers/alg.py:628\u0060 calls \u0060new_zeros\u0060 and \u0060hanlp/components/parsers/alg.py:138\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":"hanlp/components/parsers/alg.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"163df027ccdadc724c5cb8dfa983927cd47937befad9776b103cdd5189128ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hanlp/components/parsers/alg.py:618-626 | hanlp/components/parsers/constituency/treecrf.py:178-186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/alg.py"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be3c38354f0f10f98b766030df51ef237fa023900d028232716a00245c73d54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hanlp/components/parsers/constituency/crf_constituency_parser.py:227-235 | hanlp/components/srl/span_bio/span_bio.py:259-267 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"35eabd8daf1b4bd398aad2d209cc16d30c25b40381f9dcd1f933bdfc34fe77ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hanlp/components/srl/span_rank/highway_variational_lstm.py:55-63 | hanlp/components/srl/span_rank/highway_variational_lstm.py:183-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_rank/highway_variational_lstm.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fceb126f3fbfd5aa639254c2b246118aa10fa0174c48b67fbe5c7af258a79bbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hanlp/metrics/parsing/semdep_eval.py:81-89 | hanlp/metrics/parsing/semdep_eval.py:92-100 \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":"hanlp/metrics/parsing/semdep_eval.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"401a4f605b7cc82d34f6a4e1e5a93cc4235270024f352e70c08a870c482d9060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hanlp/transform/conll_tf.py:412-420 | hanlp/transform/conll_tf.py:752-760 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/conll_tf.py"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c90a348bf746a0c4f841134364bbcdf86cd4870fb71bb6a870c44081a5855a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hanlp/transform/conll_tf.py:434-442 | hanlp/transform/conll_tf.py:543-551 \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":"hanlp/transform/conll_tf.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"512c6fc0262d031cacb4bb03160342239bcedc1565f51b1877190b5f05d37e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hanlp/transform/tsv_tf.py:31-39 | hanlp/transform/txt_tf.py:141-149 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"hanlp/transform/tsv_tf.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3d425cd9ee4b465e44ea287341ba9ec8d4c63ead8e40326d2b8bb2a87ee64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hanlp/transform/txt_tf.py:28-36 | hanlp/utils/span_util.py:18-26 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"hanlp/transform/txt_tf.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"831ac64746b6326a3c2215a71ff665f933f885c0738daaba4f629f47248f0c3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:68-81 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:89-102 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:81-94 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/model_interface/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 334 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0e1a3af9d02b71c177c7df58624a48925985348ba609883a3ac8b20daf2fe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hanlp/components/amr/amrbart/bart_amr_parser.py:184-191 | hanlp/components/amr/seq2seq/seq2seq_amr_parser.py:236-243 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/bart_amr_parser.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce7a20ec4253e9ee5b6273bb5e219f5e2b6f365ef49df26d8391ca540cd9648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201311 lines \u00D7 6): hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:67-73 | hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:85-95 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:88-94 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:108-118 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:80-86 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:100-104 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/model_interface/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 334 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:105\u0060 calls \u0060findall\u0060, \u0060extend\u0060, \u0060tokenize\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:118\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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e056abf03908786cf615eceb521e85e5183e848a6a83549635c0613332ccf96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): hanlp/components/mtl/tasks/dep.py:154-163 | hanlp/components/parsers/biaffine/biaffine_dep.py:566-575 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060batch\u0060 to \u0060Dict[str, Any]\u0060 in one and \u0060dict\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/tasks/dep.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac200c262e89ff5d6d124fc7e50292471eb733d801458a20cf92f155d65474c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hanlp/components/ner/biaffine_ner/biaffine_ner.py:175-182 | hanlp/components/srl/span_rank/span_rank.py:180-187 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/ner/biaffine_ner/biaffine_ner.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7cdebd2197938f5f8a5be39f3945904ce9fe49a787d7be0d8a95db675bd788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): hanlp/components/parsers/alg_tf.py:58-87 | hanlp/components/parsers/biaffine_tf/alg.py:58-87 \u2014 before extracting anything, compare \u0060hanlp/components/parsers/alg_tf.py\u0060 and \u0060hanlp/components/parsers/biaffine_tf/alg.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 204 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"hanlp/components/parsers/alg_tf.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b53c2de5a90d6604470d2b58f133c737fa981cf590706ea61d2155f3999b841"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hanlp/components/parsers/constituency/crf_constituency_parser.py:93-100 | hanlp/components/parsers/ud/ud_parser.py:260-267 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060hanlp/components/parsers/constituency/crf_constituency_parser.py:101\u0060 calls \u0060compute_loss\u0060 and \u0060hanlp/components/parsers/ud/ud_parser.py:268\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":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c84f2206cda730752a511ec92655a180c50beea022977b70bfcc87476aafdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hanlp/components/parsers/ud/ud_parser.py:59-66 | hanlp/components/srl/span_bio/span_bio.py:258-265 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/ud/ud_parser.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b85f352733426926fa8432804c046828225553fcbac322041d31fae39bf5bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): hanlp/components/amr/seq2seq/seq2seq_amr_parser.py:168-174 | hanlp/components/parsers/constituency/crf_constituency_parser.py:72-78 | hanlp/components/srl/span_bio/span_bio.py:114-120 | hanlp/components/taggers/tagger.py:92-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/seq2seq_amr_parser.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3328b2db567284175664f9276e68b831e377bb46d434620db9fe6763c0f36440"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): hanlp/components/parsers/constituency/crf_constituency_parser.py:49-55 | hanlp/components/parsers/ud/ud_parser.py:216-222 | hanlp/components/srl/span_bio/span_bio.py:91-97 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8a05d3d9e9d8c62a6c272f8c0e146dffcbfe49df53315cf579ef44e126d767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:229-235 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:219-225 \u2014 before extracting anything, compare \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 488 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:226\u0060 calls \u0060print_exc\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:236\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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34d6b2c6aa3562ff730dd730086319b3b47f5786521c4f8d2daa5047335fe29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hanlp/components/mtl/tasks/dep.py:123-130 | hanlp/components/mtl/tasks/ud.py:82-89 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/components/mtl/tasks/dep.py:123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060hanlp/components/mtl/tasks/dep.py:120\u0060 calls \u0060isinstance\u0060, \u0060CountdownTimer\u0060, \u0060cache_dataset\u0060 and \u0060hanlp/components/mtl/tasks/ud.py:81\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":"hanlp/components/mtl/tasks/dep.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a7932098e766b70ab424aeb665695b28485e0e2e715911583b6f257e6a6365"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hanlp/components/parsers/alg.py:292-298 | hanlp/components/parsers/constituency/treecrf.py:90-96 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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, \u0060hanlp/components/parsers/alg.py:290\u0060 calls \u0060new_tensor\u0060, \u0060unsqueeze\u0060 and \u0060hanlp/components/parsers/constituency/treecrf.py:88\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":"hanlp/components/parsers/alg.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"05998ab54a924518e043f759d5ba63024451db7b2c82b02dad67846a737e9298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hanlp/components/srl/span_rank/layer.py:280-286 | hanlp/components/srl/span_rank/layer.py:291-297 \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":"hanlp/components/srl/span_rank/layer.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8aa6e3da5e8cb05b0e471ea08655fdfb9788c6af037609d32edef9425dd25a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hanlp/layers/embeddings/char_cnn_tf.py:33-40 | hanlp/layers/embeddings/char_rnn_tf.py:30-37 \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":"hanlp/layers/embeddings/char_cnn_tf.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"555152ffaf175f27db49f3957ce5b8e5788f9632bada89c0fbee513921553d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hanlp/metrics/chunking/chunking_f1.py:119-127 | hanlp/metrics/chunking/conlleval.py:280-288 \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":"hanlp/metrics/chunking/chunking_f1.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec19da5b65d68efc96d4862b43a67f0d7f9300095b00bc77ba8c7151a72d0dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hanlp/metrics/chunking/sequence_labeling.py:174-180 | hanlp/metrics/chunking/sequence_labeling.py:373-379 \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":"hanlp/metrics/chunking/sequence_labeling.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7e6fe4c4f1ca326ed6c637ec00a5b712c8695728a77f06ad16aeabb1a8e3c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:101-107 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:134-140 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:124-130 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/model_interface/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 334 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f0e081f1c51259de67a4486194f49ea9597d32fa82dc177bd89f655f5750bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): hanlp/components/mtl/tasks/dep.py:156-161 | hanlp/components/mtl/tasks/sdp.py:156-161 | hanlp/components/parsers/biaffine/biaffine_dep.py:568-573 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060batch\u0060 to \u0060Dict[str, Any]\u0060 in one and \u0060dict\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/tasks/dep.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fde26c2e9bd268dca12a5eb484ba0e5d8d7505b304e66009bd0c77774bf750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1005-1010 | hanlp/components/amr/amrbart/model_interface/modeling_bart.py:1214-1219 \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":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"6232efa4c29b8721e3bff57661b1831d3bc5f01e564568b2dc9d006f7f80bcff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:190-199 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:180-189 \u2014 before extracting anything, compare \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 488 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 \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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"857874f375ee6ae2fd831027f6cdbb270c62b4badfa6bec770cdbfad381a7a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hanlp/metrics/chunking/bmes_tf.py:35-42 | hanlp/metrics/f1.py:22-27 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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. 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":"hanlp/metrics/chunking/bmes_tf.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece3138cf72f6454f3bb24bedce62130055275c64d74dbe66747448d65bf547e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hanlp/transform/conll_tf.py:56-61 | hanlp/transform/conll_tf.py:295-300 \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":"hanlp/transform/conll_tf.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ae5680ba566dc86ea7c1ac327d91c70a8013fc43f3e599d6213769923693be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): hanlp/components/parsers/constituency/crf_constituency_parser.py:51-55 | hanlp/components/parsers/ud/ud_parser.py:218-222 | hanlp/components/srl/span_bio/span_bio.py:93-97 | hanlp/components/sts/transformer_sts.py:82-86 | hanlp/components/taggers/tagger.py:71-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"755c40d271acc2c8ce2361d4a5ca84f95d400a4ebf26c0049c37e7697c9ddee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hanlp/components/amr/amrbart/bart_amr_generation.py:39-45 | hanlp/components/amr/amrbart/bart_amr_parser.py:43-49 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/bart_amr_generation.py\u0060 and \u0060hanlp/components/amr/amrbart/bart_amr_parser.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/components/amr/amrbart/bart_amr_generation.py:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/bart_amr_generation.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ad32c4db951856eef2c00922dbff45680f8314660b244557018918a052dd66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:117-121 | hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:150-154 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/model_interface/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 334 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hanlp/components/amr/amrbart/model_interface/tokenization_bart.py:117\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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d2927d4c1237e98a6f24bcead7070d6c28d65abfcf0db69ae4ef88a39fa681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hanlp/components/amr/seq2seq/dataset/tokenization_bart.py:182-186 | hanlp/components/amr/seq2seq/dataset/tokenization_t5.py:172-176 \u2014 before extracting anything, compare \u0060hanlp/components/amr/seq2seq/dataset/tokenization_bart.py\u0060 and \u0060hanlp/components/amr/seq2seq/dataset/tokenization_t5.py\u0060 as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 488 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 \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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a209d7fed5e50828ea7a76267f458f711c10ab21394c649d9418786ec757d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hanlp/components/amr/seq2seq/seq2seq_amr_parser.py:145-149 | hanlp/components/srl/span_bio/span_bio.py:95-99 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/seq2seq_amr_parser.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bbd980270cba062aa661a1a497990b1322d4f26d5a06812b9c6312ccebc770"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hanlp/components/distillation/losses.py:52-56 | hanlp/components/distillation/losses.py:77-81 \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":"hanlp/components/distillation/losses.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f38704d946d78221ba9f5c3ebcdbac5f4a1812d0dde77e356cd9e77bd2954b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hanlp/layers/embeddings/char_cnn_tf.py:25-29 | hanlp/layers/embeddings/char_rnn_tf.py:21-25 \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":"hanlp/layers/embeddings/char_cnn_tf.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77eeabdeacaf1a33215137aaeedd851eb4c3cdf49188a665229301d239006ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2): hanlp/components/amr/amrbart/common/penman_interface.py:37-80 | hanlp/components/amr/amrbart/preprocess/penman_interface.py:37-80 \u2014 \u0060hanlp/components/amr/amrbart/common/penman_interface.py\u0060 and \u0060hanlp/components/amr/amrbart/preprocess/penman_interface.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 44 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/common/penman_interface.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"db20fd46d590dd5713d865e6734f3b4898eb9cf408ce4f8674c863dda3925a92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hanlp/common/keras_component.py:372-377 | hanlp/components/taggers/transformers/transformer_tagger_tf.py:75-83 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"hanlp/common/keras_component.py"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2932c55ab3831a8ff9de7864f7fc71f733440f864a1fca6fdb2b7a823e344a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hanlp/common/vocab.py:68-73 | hanlp/common/vocab_tf.py:53-58 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/vocab.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"408d2f6a560fb1c03c0cc0bc45f9910c27a6920bb5065436917e27425b757c39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hanlp/components/amr/amrbart/bart_amr_generation.py:67-74 | hanlp/components/amr/amrbart/bart_amr_parser.py:68-75 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/bart_amr_generation.py\u0060 and \u0060hanlp/components/amr/amrbart/bart_amr_parser.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"hanlp/components/amr/amrbart/bart_amr_generation.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1026cf697fcde1991859f453ddcb68bde72b4cc2d27f09617d15c111daf5080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hanlp/components/amr/amrbart/bart_amr_generation.py:125-130 | hanlp/components/amr/amrbart/bart_amr_parser.py:153-158 \u2014 before extracting anything, compare \u0060hanlp/components/amr/amrbart/bart_amr_generation.py\u0060 and \u0060hanlp/components/amr/amrbart/bart_amr_parser.py\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/bart_amr_generation.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc7ab704f650e37b2a26c70059fed74f3e077135abfbd4f2af2280cfcc16604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hanlp/components/mtl/tasks/dep.py:141-147 | hanlp/components/mtl/tasks/sdp.py:141-147 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/tasks/dep.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ade6d4137127c60fc14fa0d3e5d760536ba54f7e79652d5d991ca8d256f52f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hanlp/transform/txt_tf.py:19-24 | hanlp/utils/span_util.py:9-14 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"hanlp/transform/txt_tf.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14a1e8e3d4b7baa52653d04cb95b0250b59522439774535ebdc79d0ff7620b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hanlp/metrics/parsing/attachmentscore.py:29-34 | hanlp/metrics/parsing/labeled_score.py:11-16 \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":"hanlp/metrics/parsing/attachmentscore.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3d50a5205ec3e4b949804b13d3abbef103b8ddf7a43d5f56bbd68db908c4e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hanlp/metrics/parsing/labeled_f1.py:11-16 | hanlp/metrics/parsing/labeled_f1_tf.py:10-15 \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":"hanlp/metrics/parsing/labeled_f1.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0594ab0b2a7fd2d6b9cfce695396bc5316aa7e5e0a644bc95ca56b5ad2bbe573"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hanlp/components/amr/amrbart/model_interface/modeling_bart.py:333-339 | hanlp/components/amr/amrbart/model_interface/modeling_bart.py:453-459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/model_interface/modeling_bart.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebe09bfae4447b81190a290d1067932254331d41ea12e93e633d1a8d0d192c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hanlp/components/classifiers/transformer_classifier.py:149-157 | hanlp/components/eos/ngram.py:108-116 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/classifiers/transformer_classifier.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"204af58ebca38ff722714bdabf93857a361fcc5dea7ba6ce13fb12d2eff53ecd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hanlp/components/ner/biaffine_ner/biaffine_ner_model.py:95-99 | hanlp/components/srl/span_rank/span_ranking_srl_model.py:281-285 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/ner/biaffine_ner/biaffine_ner_model.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9943c70d64d99ca734c042f1bbd2c062d2a887ca4855c5994469187a744dfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hanlp/components/parsers/alg.py:655-660 | hanlp/components/parsers/constituency/treecrf.py:221-226 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/alg.py"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec775aacfb3773baacea61d800ffc70671b9ce6cc89f4a5a5ff72a875977478"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): hanlp/components/srl/span_rank/layer.py:318-323 | hanlp/components/srl/span_rank/layer.py:333-338 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060hanlp/components/srl/span_rank/layer.py:339\u0060 calls \u0060reverse\u0060 and \u0060hanlp/components/srl/span_rank/layer.py:324\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":"hanlp/components/srl/span_rank/layer.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d53ebd22d9caf27523d24472cc341aa4fe0d60db88a1aeb6b85f8e65ba6bda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): plugins/hanlp_restful_java/src/main/java/com/hankcs/hanlp/restful/HanLPClient.java:421-427 | plugins/hanlp_restful_java/src/main/java/com/hankcs/hanlp/restful/HanLPClient.java:454-460 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_restful_java/src/main/java/com/hankcs/hanlp/restful/HanLPClient.java"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d873ca55d9603700e6a3f792c56e5156713040fb7ca36d769f13249c840570"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Transform (LCOM4 4): Transform\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/transform_tf.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe7dc97581be066960326c1326d2ee318f85c84ba2ea09d22042d66e10cdce2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Word2VecEmbeddingComponent (LCOM4 4): Word2VecEmbeddingComponent\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/layers/embeddings/word2vec.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4262aa06fa88797d4bce3d4b28c34e99a30714954c8bdfa48b243eb320c09128"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CoNLLTransform (LCOM4 4): CoNLLTransform\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/conll_tf.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"312440ec8c70fc7ac8107096835b7cab722ec51094d189334ed125c2f0c602a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: This doesn\u0027t work with rust tokenizers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/utils/lang/ja/bert_tok.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b822763719354b70820c74a1fb777a969608474f1e0b6b5ddf60c117689404c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: other fields should be properly handled too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/transformer_tokenizer.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a2425f26843c175d23bae0d1a2fce7af7c71e88c8376835a6bf493980b2ef5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: optimize ngram generation using https://www.tensorflow.org/api_docs/python/tf/strings/ngrams"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/transform/txt_tf.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8849bff2d269e9dba3b2dadc66a5f68ca5b4df7c77e606a89bfe24166f66a02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: split token type ids in transformer_sliding_window if token type ids are not always 1 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/layers/transformers/utils.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fd0daf1c93fa3e2cf74710fb08fc23d828eece99bb17124cd329d56990b127"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Wrap functions in @tf.function once \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/layers/crf/crf_tf.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a111671ca8a5ca26d354299d7d1c21dcfddc55c656060d50eb6fcd6466e6d4d5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: scalar index error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_rank/srl_eval_utils.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4347a0342367a8ad97da71bc45d21abe53dc3631eed84bafd9b65cac9df63ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this is an ugly patch due to the fact that BART tokenizer splits after \u0027:\u0027 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/postprocessing.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18f3f3c238aa2e8028f173855d3866508bcd1f9f8d01a5dbccbfcd5e2a69704"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this is an ugly patch due to the fact that BART tokenizer splits after \u0027:\u0027 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/dataset/postprocessing.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b094c7ff0c2eb6a6c222dbfb8ead59f9f59411ad3748d1491712854020a53520"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: this is an ugly patch due to the fact that BART tokenizer splits after \u0027:\u0027 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6089159205b7f21757cef915f0156c25f9ff1faac3393e6c2b6e46ab5821d200"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 5 project(s) overshoot their size bounds, lowering Project Cohesion to 6.0/10. The most over is \u0060(repository root)\u0060 (44235 LoC, 480 module-visible types across 67 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":"D27","level":"note","message":{"text":"Scattered collaborators: 56 % of calls cross a namespace and only 26 % of collaborators are co-located \u2014 group each feature\u0027s code into a vertical slice so a call\u0027s collaborators sit together."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5aad4a4530bac3928d3a065a664be89d023ecfc865f9bf79ac05754b3bffe322"}},{"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":"160a4a290399ee838f274e0da3636a29e286ea685e448ee1a97f1e471659af4a"},"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":"b71a62c8134840c6807c489ede44a1c77bfdc0c47eba4d7f19609786ed4bad45"},"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":"297e2dc3edbe7550fb5cf405d1867a07a632d24da3f54adebefe08e5187565f5"},"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":"16baa82dced408d8f49ff54acdf1a5121fa826c3732e6800ab79ad56fd1448d2"},"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":"03620e7d1970b5faf4ef0ea63c6aa391c606ca834d1add21c519d9d415022555"},"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":"2baf3daf366177a4af1763b41dabf26d222688b39fd570ee20fe42ba810bad97"},"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":"369202f9cc156d21ae83845991cca9e1862f178644640693c471150918d33db0"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"d578cdf86ad04cbaf94e1de469936041ed7053f3dc0f97cce8ee505b5808d082"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"fa5b43d5063966ee3b89c1a0604f4bc3f5158041cce84d94cf5916a30bade6f5"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"6bd6a5d933661b3071ce2d3b64b780abe0a5944af244265d5925573f4c9b9449"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"6d7fc0b14af8577469a9079345bb0214cfbde8c2fd5dcb0a95d8a959b3f210cf"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"ccc36c566a901115864d4b1cca6abfb7e763474bd607dd74235825679b6d6a75"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05: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":"617488ac0a1cc5cb2765909cab094948ab526992063dc14cd2477f847fdaffda"},"taxa":[{"id":"CWE-502","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":"7f5272cfd6eb7ad3afac59146d89af84e7d4f477bc2d375066addc336b6e5958"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"c97547d63b152bd8bd2c62c8fc5dad52e30406a20f6da41b8233cbb169fc9ea3"},"taxa":[{"id":"CWE-502","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":"83c5db3cef1be33416a752d82e5b12f31bf3f24bcd20a531d7d4c5e0d3c5e64e"},"taxa":[{"id":"CWE-502","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":"2f853a51792b4ef34762118c77e529fdcc7244e33f1d17d5264d0bb766cc6dcb"},"taxa":[{"id":"CWE-502","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":"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":"62a29d23560c7546987ea48190bbf61cef89d4b9b6791087e3524056c42b1391"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"780a9fb42da935684bc1b19ef065aefca81705dafca91a122a2853c31a9864df"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"522fe588d8d7c2ac662ee33b775eef61ec439f5db057d9addc9200234a51c21e"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1e6dba5c0c90d08b35690f9a43ee9d14aed0d80a23385cef6ff94d9c189dfa9c"},"properties":{"dependency":{"package":"com.fasterxml.jackson.core:jackson-databind","version":"2.14.1","advisory":"[GHSA redacted]","aliases":["[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]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: __init__.py \u2194 setup.py: \u0060plugins/hanlp_restful/hanlp_restful/__init__.py\u0060 and \u0060plugins/hanlp_restful/setup.py\u0060 change together 100% of the time (16 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are \u0060007f29f9\u0060 Support coarse tokenization of Japanese; \u0060bf77f509\u0060 Release \u0060sentiment_analysis\u0060 APIs; \u00609d0f8804\u0060 Release \u0060abstractive_summarization\u0060 APIs \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_restful/hanlp_restful/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ce93452511cef944437ba260ea12e8289f36d7d261d13c971eb579d8e4a29b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: version.py \u2192 transformer.py, transformer_tokenizer.py, setup.py: \u0060hanlp/version.py\u0060 changes together with 3 other files \u2014 \u0060hanlp/components/tokenizers/transformer.py\u0060, \u0060hanlp/transform/transformer_tokenizer.py\u0060, \u0060setup.py\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/version.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f432a1d089aebc823bd386245cc344e20aab745deb9837f4cabe545d490021"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: document.py \u2194 setup.py: \u0060plugins/hanlp_common/hanlp_common/document.py\u0060 and \u0060plugins/hanlp_common/setup.py\u0060 change together 68% of the time (15 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u00607aeb0fc5\u0060 Support XPOS for CoNLL-U; \u0060c01f4f64\u0060 Fix \u0060dep\u0060 key of \u0060to_pretty\u0060; \u00607f7d7b62\u0060 Fix printing dummy root constituent \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_common/hanlp_common/document.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da45d18e1573d8cdc92d47b90ee83fd120ca0ad305bb530da1792e3d2fc5c8a2"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 1 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":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/unit-tests.yml"},"region":{"startLine":6}}}],"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: \u0060dictionary is not None and not isinstance(dictionary, DictInterface)\u0060 appears character-identically in 4 files \u2014 hanlp/components/mtl/tasks/tok/tag_tok.py, hanlp/components/ner/transformer_ner.py, hanlp/components/taggers/tagger.py, hanlp/components/tokenizers/transformer.py. 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":"hanlp/components/mtl/tasks/tok/tag_tok.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"061b820db8db63a75adc39ffb061a3c9da432d055b87f2a4f84246a44aba5671"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060edge_index is None or edge_index == (l - 1)\u0060 appears character-identically in 2 files \u2014 hanlp/components/amr/amrbart/common/postprocessing.py, hanlp/components/amr/seq2seq/dataset/postprocessing.py. 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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c3ca1ce1f2e7343f49e2328659c6eb811c760f4469d91956dbe6fdcacceb48"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060gradient_accumulation and gradient_accumulation \u003E 1\u0060 appears character-identically in 9 files \u2014 hanlp/components/amr/seq2seq/seq2seq_amr_parser.py, hanlp/components/mtl/multi_task_learning.py, hanlp/components/ner/biaffine_ner/biaffine_ner.py, hanlp/components/parsers/constituency/crf_constituency_parser.py. 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":"hanlp/components/amr/seq2seq/seq2seq_amr_parser.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f10ed8231bb30f754597989e1b9ef19d7b604fca55705b8c5fdc001a7dbf07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(fol, str) and (fol.startswith(\u0027:\u0027) or (fol == \u0027)\u0027))\u0060 appears character-identically in 3 files \u2014 hanlp/components/amr/amrbart/model_interface/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_t5.py. 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"13134fa3cc83d4650dc318877e2aab55a9de994744dedfa79906f317dbef1b3c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(nxt, str) and nxt.startswith(\u0027\u003Cpointer:\u0027)\u0060 appears character-identically in 3 files \u2014 hanlp/components/amr/amrbart/model_interface/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_t5.py. 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a67e77b61dc054b09324a805cc47ec1d05795bde306d2cf9489cd5b3eb22be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(tokens[-1], str) and rex_spc.match(tokens[-1])\u0060 appears character-identically in 2 files \u2014 hanlp/components/amr/amrbart/common/postprocessing.py, hanlp/components/amr/seq2seq/dataset/postprocessing.py. 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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfe3784ea8517336dda75d3c1cfb7edb4a1592b6f53f914664e69c090554db6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(v, dict) and \u0027classpath\u0027 in v\u0060 appears character-identically in 2 files \u2014 hanlp/common/torch_component.py, plugins/hanlp_common/hanlp_common/configurable.py. 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":"hanlp/common/torch_component.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e168ec49b9b9616b7023ef9d962705079513430a8da2173a1a9909fb441484"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(recats) == 2 and recats[0] in self.recategorizations and (\u0027_\u0027 \u002B recats[1]) in self.encoder\u0060 appears character-identically in 3 files \u2014 hanlp/components/amr/amrbart/model_interface/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_t5.py. 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fffe7cb61d700570c97e536882fddd134d059852ef176df06cbff7fb99fca95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lst == \u0027(\u0027 and linearized_nodes[i \u002B 1] == \u0027/\u0027\u0060 appears character-identically in 2 files \u2014 hanlp/components/amr/seq2seq/dataset/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_t5.py. 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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"57530a7fddcfcc022b48f0c7a56a84004af54699ed116e27d2028b7aa49587b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.startswith(\u0027\u0022\u0027) and n.endswith(\u0027\u0022\u0027) and len(n) \u003E 2\u0060 appears character-identically in 2 files \u2014 hanlp/components/amr/amrbart/common/postprocessing.py, hanlp/components/amr/seq2seq/dataset/postprocessing.py. 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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"d050183e52917bbbefcc0c7dd40e2a6dc056363e543b7abbc90b52126768c236"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.startswith(\u0027\u003C\u0027) and n.endswith(\u0027\u003E\u0027) and (not n.startswith(\u0027\u003Cpointer:\u0027))\u0060 appears character-identically in 3 files \u2014 hanlp/components/amr/amrbart/model_interface/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_t5.py. 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98f62f3e9c76431cfd7c31010e0fefb9b6cfe7b194e4b0be96a063e229d4649"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.startswith(\u0027\u0022\u0027) and node.endswith(\u0027\u0022\u0027)\u0060 appears character-identically in 3 files \u2014 hanlp/components/amr/amrbart/model_interface/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_t5.py. 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd5adc7c459b790c50d211d619f2d59ec6e4873bc45d616bb219c2c7d718d1b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060old is None or not tf.reduce_all(c == old)\u0060 appears character-identically in 2 files \u2014 hanlp/components/parsers/alg_tf.py, hanlp/components/parsers/biaffine_tf/alg.py. 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":"hanlp/components/parsers/alg_tf.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c5cc451cbc5394a9ab3523a554e8edbf2407d6c03886fbcb58895485431520"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060piece.startswith(\u0027\u0022\u0027) and piece.endswith(\u0027\u0022\u0027)\u0060 appears character-identically in 3 files \u2014 hanlp/components/amr/amrbart/preprocess/read_and_process.py, hanlp/components/amr/seq2seq/dataset/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_t5.py. 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":"hanlp/components/amr/amrbart/preprocess/read_and_process.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"173589123035249ea1bd275dcde8cca609260efe4c86d39321ea63f449e178bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060piece.startswith(\u0027\u0022\u0027) or piece.startswith(\u0027\u0022\u0027) or \u0027\u0022\u0027 in piece.strip(\u0027\u0022\u0027)\u0060 appears character-identically in 3 files \u2014 hanlp/components/amr/amrbart/model_interface/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_t5.py. 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"62474eda7792b52f2e80c3c9060f0ae86eafbfb0e319728d69cb026af1fbdb88"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._classify(next) == \u0027VAR\u0027 and next in remap and (i \u003C len(nodes) - 1) and nodes[i \u002B 1] != \u0027/\u0027\u0060 appears character-identically in 2 files \u2014 hanlp/components/amr/seq2seq/dataset/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_t5.py. 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":"hanlp/components/amr/seq2seq/dataset/tokenization_bart.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"55991125f6c8099b9a43e6b5d02cc4dc36c66a1f50d6b68a5d831f7d5e66036b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tok.endswith(\u0027\u0022\u0027) and (not tok.startswith(\u0027\u0022\u0027))\u0060 appears character-identically in 2 files \u2014 hanlp/components/amr/amrbart/common/postprocessing.py, hanlp/components/amr/seq2seq/dataset/postprocessing.py. 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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6ce7155b3d888121bd2bf3fb97aefdbe074c405547b61aa8b5ddd4e1b5390a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tok.startswith(\u0027\u0022\u0027) and (not tok.endswith(\u0027\u0022\u0027))\u0060 appears character-identically in 2 files \u2014 hanlp/components/amr/amrbart/common/postprocessing.py, hanlp/components/amr/seq2seq/dataset/postprocessing.py. 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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa746d08d41421ba1d9ee434db52fa17de0b4d6a2a3591d6c3f2eeba8d29bf5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tokk.startswith(\u0027\u0022\u0027) and tokk.endswith(\u0027\u0022\u0027)\u0060 appears character-identically in 3 files \u2014 hanlp/components/amr/amrbart/model_interface/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_t5.py. 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42dd029c31c0580d6c18651f950a32ebd2310382977515a812a1a5a2bdc493b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tokk.startswith(\u0027:\u0027) and tokk.endswith(\u0027-of\u0027)\u0060 appears character-identically in 3 files \u2014 hanlp/components/amr/amrbart/model_interface/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_t5.py. 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a53233d83aa454c664ade64139d9122deb37df543eb40698a3dba87b76a96b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tokk.startswith(\u0027\u003C\u0027) and tokk.endswith(\u0027\u003E\u0027)\u0060 appears character-identically in 3 files \u2014 hanlp/components/amr/amrbart/model_interface/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_bart.py, hanlp/components/amr/seq2seq/dataset/tokenization_t5.py. 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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd2a86707028bb5a7f838e067f2884216163c8e1101d2083798a0426b34e5de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v1 in name_vars and rel.startswith(\u0027:op\u0027)\u0060 appears character-identically in 2 files \u2014 hanlp/components/amr/seq2seq/dataset/linearization.py, hanlp/components/amr/seq2seq/dataset/postprocessing.py. 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":"hanlp/components/amr/seq2seq/dataset/linearization.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8398deeb78b5816d86e5d79ea60e8434521065269340c7adaa2339750102e9be"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060from_config\u0060 is public and takes \u0060config: dict\u0060 from its caller, and it calls itself at line 27 (\u0060self.from_config\u0060) with a piece of \u0060config\u0060 (and at line 32) \u2014 and nowhere in \u0060from_config\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060from_config\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugins/hanlp_common/hanlp_common/configurable.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"852bc41f3abebb6599e7fb0d55c7b9a5e85151c083fd65ac1ab9333d64cd3c6f"}},{"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":"plugins/hanlp_restful_java/src/main/java/com/hankcs/hanlp/restful/HanLPClient.java"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cc78653ed1bcf452907b4c6dd1b7bc7b4b85405b33fede40c2cbc3819a90dc"}},{"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":"hanlp/utils/component_util.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"734b85a9969bfee4f57298b9c54c49e6dc845012450c21f406024cbfa3b621c0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\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":"hanlp/utils/component_util.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"159345c7f816eda6ec3cf1e2b696b5957a16c3e4b7d2fb2615cddb551a7b898b"}},{"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":"hanlp/utils/component_util.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab48f2dc720a50e31b99b1f9b17dd0b0c4dfd610f04e3b5bdc2e9644b9041afe"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\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":"hanlp/utils/io_util.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb40d64a5820aaf67bb3202c6ffe54a0e511f5311016362be825b6e4357bced"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\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":"hanlp/optimizers/adamw/optimization.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c7e021a7b4bb55c70ee84a5c96548ff059198d3d4ba3a609df12f33bb3bb14"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\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":"hanlp/components/parsers/ud/lemma_edit.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1d60c698829802a6ba81abf071b8c7ec64dd594e89cef3087b3bf1f993f404"}},{"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":"hanlp/components/amr/seq2seq/seq2seq_amr_parser.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"da301b413f3536c927e5d1426c8d44c3888404c5b09224eb044d1e748e955d3c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\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":"hanlp/components/amr/seq2seq/dataset/postprocessing.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10b7bdb2f58dcff3d88c757bef92fef3934241fb72c325a279b38f327797437"}},{"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":"hanlp/components/amr/seq2seq/dataset/postprocessing.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49c86f430a62887ba89d3084ae259e8927ec1656f222ed675f98fe5df0e6dff"}},{"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":"hanlp/components/amr/amrbart/bart_amr_parser.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc3821f828199ce35a6eee3e81defa954b3278275f236a2a5191289db4cfa74"}},{"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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d115f7ad5252611766153b1b9e6105913677d613f0bf894ad21dc5f411be815"}},{"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":"hanlp/components/amr/amrbart/model_interface/tokenization_bart.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bab1f68e697adaac00d1634e76728ea38f998861597d8e2e958859f494f94b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except\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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92befc9ba6da022da3c4ffd1e31dc0cda8953f912ffdb1b67c3a92ba3e7a886"}},{"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":"hanlp/components/amr/amrbart/common/postprocessing.py"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc2ec55cd49f09ee82279500ceb7bdb501bf6d442b493e93a754fda2080a6db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 381 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/utils/io_util.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d004fd0859e46ca18b35326d6755132c2a7dda800cb5ff3cfaea492841c3f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 52 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/taggers/rnn_tagger.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"16611d3d37d8383fefe01eb9dad81555224e50fa0f825e4214da14d763062db2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 76 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/taggers/rnn_tagger.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1de3e4c0659f5027f81c790c094923c0b8f34d89b9496bb5ca6a97f72ef204"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 77 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/taggers/rnn_tagger.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"af39333932834b4820bf91027a1b485ebe82453ddd3c16c18465e1cabace06a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 75 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/taggers/tagger.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"774ca257185c0a58c1615f4faa9bf233b61dd9d89a8bcd91c557a6d49d89bb4c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 96 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/taggers/tagger.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"be96aee9e7f32d717a935f7047139ef80b2dd26d8ddf470d7018b78341d2424f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 97 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/taggers/tagger.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de5824834f2f25026206b97d683decc5368c93841f152189e6bf069a943972c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 98 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/taggers/tagger.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c0a01e2be27297fc4b1e0d6697fefeada7feb80227c84cfb18c8a423bfd629"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 160 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/taggers/transformers/transformer_tagger.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33a7f235cccb7d1f04ad65cc48d09083955d4978b2b3df52b5fdadd26ac20b8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 181 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/taggers/transformers/transformer_tagger.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d55d7502a5ad0ab03dad90adef42e2dcc237cb21bd6e6a84657a025e90966fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 86 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/sts/transformer_sts.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d38e85c11109e3ddc10bef3347a2144a691d5ae728ecbfd931b5d83a674fe0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 98 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/sts/transformer_sts.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7b13356c2bb9a593f6f1b94eddcbf68cc798923ff356702a29028bffb7324f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 97 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_rank/span_rank.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"057c3c0a8bb1122e06d76e746da44c5860b1a2fb9e5a86389824139d697d9f41"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 97 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_bio/span_bio.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"53550895a1469fbeaba69d0f6f82a402d80821bf8a9c8ec563de4a253d7d5878"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 118 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_bio/span_bio.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d62b7bbc7023ce67da33fc287a885abcadbce02b54f3286895ebf0757410025"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 119 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_bio/span_bio.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"de61de5937e5f379bc2403805b0bfa48cf16193335f8611d152b91bc39c10fc3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 120 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_bio/span_bio.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48d0b890684d424b37bd7ceb40514c1f7ec0e32366a31fb3a4fc847de5427de"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 289 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/srl/span_bio/span_bio.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2aed02ade386b29bbb577fc4381885a7e554f277b549f293f03b69202e4445"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 222 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/ud/ud_parser.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"701653a3601efe32ef568d3b87a42fee4ef320682b0a7ab25b9a59566ed331c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 243 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/ud/ud_parser.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"668ba7745db5ddfb7fa6b21828f9e4df76f26bf32b2ff508d21b7e652f68b23c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 244 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/ud/ud_parser.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d34908806d8881fce64ad5a40ab2037af46c8d71c8b17a70ffd069b7d086846"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 245 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/ud/ud_parser.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f386a13f462b6f297360f593860d95e16133c1e6d0930466fb26b7ef80571c03"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 55 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"734f604af81fe579584ed707d9f1cd154f903f3b2c559455fe606d3e2d73eaf1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 76 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38ac990846c7d1e3d27a99fc383ec52f442af550665b42e85dad3f8b42a057a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 77 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"438cfc1aced0dde761a6179e93ec89cbb47dd1d82b99ba085e217bc1a8f69a04"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 78 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/parsers/constituency/crf_constituency_parser.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b9376d6610322393cf985580f64e726821117e062c7ab3e329b2ac724cdc41"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 98 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/ner/biaffine_ner/biaffine_ner.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e34ffffffff1842156b8405df6ffc68264163db99c299c89d7b23adf1ce32a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 148 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/multi_task_learning.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7663db257666485e31919a972587bae2d63d7fe356d5b47419fb3aa034a18fe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 286 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/multi_task_learning.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"9158a807636f458f1ec51abf20d6aad378fc51b73b3b986e027376f71ffcd2a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 307 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/mtl/multi_task_learning.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"65849bd316b18e5f7b66bf139f923bf7fec595ef0552322aeb1d2668bb1cf0d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 112 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/eos/ngram.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc543312db5a2ec0ef287fdf22a200818e86e905540c5db5cdf13b97850dc960"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 153 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/classifiers/transformer_classifier.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bab182e1de84c31b66c41b59a11eab0bbecd7595981ea8ad6db01cd50b8da3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 283 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/classifiers/transformer_classifier.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad93c7b2ad369ebd444fb4cbeed796df155c8d815c05f39142a7c03c7df1ace"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 147 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/seq2seq_amr_parser.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"92692ae57bb2c546254f1856b7b9942df4d2abf4cae5b8c46c651f6ac62f9db1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 172 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/seq2seq_amr_parser.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a68b0df142c621a0f2710f2ef76a3e578082670f5f938f877d5f5cafbc8382"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 173 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/seq2seq_amr_parser.py"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"290e2a5466e4b5ce7d8a6b1fe8c033843e170dad98da49e959ccffff76f66221"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 174 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/components/amr/seq2seq/seq2seq_amr_parser.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d13dc76288d9884d4c05018e5a7c618ad4f021703420a6d7d5ac0095b37e4e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 309 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/dataset.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9dd50f0a9532088b4dabf99a8e7c7e1560e8c04393160f573a09339ec81a9e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 304 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6f3d9ace02837811a8035d2a71d1c8a0b3cc98dc319978edb0839a16ef74cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 325 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea607f7fa2028312a45937e54bd0670f948b778e8bf5dbc6667b4ba1dc75054"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 349 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2a032da0638d4c3fcc80ed5e9ffa6dc9bf92cde4453fa1f15b93a5d5376d20"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 363 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fc06db3b55471939ab7eaf9e2a81809aa5445b8321479097d8f81049e62180"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 400 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb8cb64fc21e9103028e7df9424f8c96aa97c8272d77ef5c1f0004e3013b141"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 411 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a634811d5b1502d688a8a7bf8d30fc065f3e0646bf2991bc05f5fe394e9b01"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 505 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c196ebef6a7bbac4570799c69b4910cf5eb563a35673593296cf1121cebd302e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 507 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89a8114fae48d00c03ebb2dec44f513add2cbcf91540f9e39d0bff725cfed04"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 509 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ae2074849325e3d15e45f7610342c2f0ef4c47c75ac34db91e76955fa7f0a3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 511 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"f368204ac40e43b01e12cb31323a52048a49f1ad2e36662783077a39846b951e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 525 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/keras_component.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc815027f38fe65f63b4fd2319eae6c1d0c099a1496bc22b9303249b97ab601"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 257 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/torch_component.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b96d685d93ab81053548c1dac418363bc7118da2a8208981f7ab92edf301a5e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 270 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/torch_component.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fb71014165cfb9906d9435d7522ad6a9c96dd0d11e654b13917ff564477809"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 286 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/torch_component.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ad1124270558c81a2d370bed2eb753a2c0718aef620f2a847b6a6208d758a1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 501 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/torch_component.py"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"967e2b4e388aca9a57570b256c168cb10d50def0a084ee463823698efa9fe3cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 503 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/torch_component.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b17cab6bad4d9784e3a2f73433517dbd6fb320099ea14aba938982715c08c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 534 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/torch_component.py"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d2d8d7d417f78f279c16bdb1b4960c75b7b84850a21ccc2dad841acdd73d33"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 216 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hanlp/common/transform.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce04508fdca8afd4e6ccc274af20ea512795490ee95f322155b69e18eed1ba90"}},{"ruleId":"X5","level":"note","message":{"text":"Java packages are not null-marked everywhere: 0/2 of this repository\u0027s Java package directories are under a non-null default: a \u0060package-info.java\u0060 declaring \u0060@NullMarked\u0060 (JSpecify) or \u0060@NonNullApi\u0060, \u0060@ParametersAreNonnullByDefault\u0060, \u0060@NonNullByDefault\u0060, \u0060@DefaultQualifier(NonNull.class)\u0060; a \u0060module-info.java\u0060 declaring \u0060@NullMarked\u0060; every type in it \u0060@NullMarked\u0060; or a build that runs NullAway with the package in \u0060AnnotatedPackages\u0060, or the Checker Framework\u0027s \u0060NullnessChecker\u0060. Elsewhere every reference admits null and no checker warns on the dereference that throws a \u0060NullPointerException\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"419201f6fc7ba243aef2cfb154378641588a8190e6269cea04a7b48c3d343bd5"}}],"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-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.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-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.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-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-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.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"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"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-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":25,"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."]}]}