{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"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":"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":"ATNDeserializer.deserialize (cyclomatic 54): ATNDeserializer.deserialize has cyclomatic complexity 54 (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":"runtime/Java/src/org/antlr/v4/runtime/atn/ATNDeserializer.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fadf2c728fc956c944b226f904f1ed393200d60260068d1464aead37a6b9399"}},{"ruleId":"D1","level":"warning","message":{"text":"antlr.reduceToSingleOperationPerIndex (cyclomatic 40): antlr.reduceToSingleOperationPerIndex 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":"runtime/Go/antlr/v4/tokenstream_rewriter.go"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ea636ee3a76a83dd2c8f9850d3e5f065108c29740461df9cde2c9a328e4b77"}},{"ruleId":"D1","level":"warning","message":{"text":"GrammarTransformPipeline.integrateImportedGrammars (cyclomatic 39): GrammarTransformPipeline.integrateImportedGrammars has cyclomatic complexity 39 (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":"tool/src/org/antlr/v4/tool/GrammarTransformPipeline.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb925925fdf80ff195618ae0840a0541bc9e5f2b201cf482e08446896e609ef8"}},{"ruleId":"D1","level":"warning","message":{"text":"RewriteOperationArray.reduceToSingleOperationPerIndex (cyclomatic 33): RewriteOperationArray.reduceToSingleOperationPerIndex 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":"runtime/Swift/Sources/Antlr4/TokenStreamRewriter.swift"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"737c2cf0f84328da4a190d6828bb82d155cbbd8f7c1c3f03006faf415e6bc690"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.InlineSetRules (cyclomatic 31): ATNDeserializer.InlineSetRules has cyclomatic complexity 31 (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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"663b25f5f9ff80e91d3acb5103037777e1947380720f94188d0ec83e56aee912"}},{"ruleId":"D1","level":"warning","message":{"text":"CodeGenPipeline.process (cyclomatic 31): CodeGenPipeline.process has cyclomatic complexity 31 (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":"tool/src/org/antlr/v4/codegen/CodeGenPipeline.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e14bee03609dc14d898a3c9df0f04a0fbcd4a38d6f0a3469ca8a8fbef6ae6e6"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenStreamRewriter.reduceToSingleOperationPerIndex (cyclomatic 31): TokenStreamRewriter.reduceToSingleOperationPerIndex has cyclomatic complexity 31 (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":"runtime/JavaScript/src/antlr4/TokenStreamRewriter.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ec8c9a4dab90ef1aad71ee31c053ffffc1c846d67d256b1eb453a5ccb7b895"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictionContext.MergeArrays (cyclomatic 30): PredictionContext.MergeArrays 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":"runtime/CSharp/src/Atn/PredictionContext.cs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeee5d4f7314e995eea1e92aeea28e73a7a9f72b6db61658f9ba306edcb5ec69"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenStreamRewriter.reduceToSingleOperationPerIndex (cyclomatic 30): TokenStreamRewriter.reduceToSingleOperationPerIndex 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":"runtime/Java/src/org/antlr/v4/runtime/TokenStreamRewriter.java"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"637170e4d2fc9551ecf4f443a5be485d9ae91dcc6fccabef24001bcc4d9afb6f"}},{"ruleId":"D1","level":"warning","message":{"text":"antlr.mergeArrays (cyclomatic 30): antlr.mergeArrays 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":"runtime/Go/antlr/v4/prediction_context.go"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"427ea1a6cd15f6b1b3d5d104716f45a77b21336dbc89ee4eb4129c5914178455"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictionContextUtils.mergeArrays (cyclomatic 30): PredictionContextUtils.mergeArrays 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":"runtime/JavaScript/src/antlr4/context/PredictionContextUtils.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5d60ddd9a3986663734402d52f80518eed760e61ba13e2113fd10579661fc9"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenStreamRewriter.ReduceToSingleOperationPerIndex (cyclomatic 29): TokenStreamRewriter.ReduceToSingleOperationPerIndex has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/TokenStreamRewriter.cs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"986fb2a64d22e45a70b84b3ceadd84005d0e9aa271c9df22d79e1d06db53f0d8"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictionContext.mergeArrays (cyclomatic 29): PredictionContext.mergeArrays has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/PredictionContext.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"56848b5f9be5f55c21a4ef2a1a76b74ace5ce57bc6ad2054617af5f216b65513"}},{"ruleId":"D1","level":"warning","message":{"text":"ScopeParser._splitArgumentList (cyclomatic 28): ScopeParser._splitArgumentList has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/parse/ScopeParser.java"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6546ffdbb45349dfbf1076073ff0966b268278193101a79cbf1db00e69faaf"}},{"ruleId":"D1","level":"warning","message":{"text":"DOTGenerator.getDOT (cyclomatic 28): DOTGenerator.getDOT has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/tool/DOTGenerator.java"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"049b6e0cfd2b784c457a0bfb42a2c2fc05c08fcfba947c11fc54af404b8b7cc5"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictionContext.mergeArrays (cyclomatic 28): PredictionContext.mergeArrays has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/PredictionContext.java"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a8b11b4e588ef135c20b2fa81d030bb4b6f1129a25db5a0a30b76e6ef4a3cb"}},{"ruleId":"D1","level":"warning","message":{"text":"RuleDependencyChecker.CheckDependencies (cyclomatic 27): RuleDependencyChecker.CheckDependencies has cyclomatic complexity 27 (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":"runtime/CSharp/src/Misc/RuleDependencyChecker.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfae4055085fe9239e8137f0c23771b6416a4392121bda949c5ee1a98c18255a"}},{"ruleId":"D1","level":"warning","message":{"text":"TokenStreamRewriter._reduceToSingleOperationPerIndex (cyclomatic 27): TokenStreamRewriter._reduceToSingleOperationPerIndex has cyclomatic complexity 27 (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":"runtime/Python3/src/antlr4/TokenStreamRewriter.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a4076988bdbe022e88189d9c10416a4360f1f26bb47b8371d961f4ad13a8a1"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.computeReachSet (cyclomatic 26): ParserATNSimulator.computeReachSet 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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b001e57a683007063a5749e9c327f5bf779ce69b71c01c5c89f73625add6101"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictionContext.mergeArrays (cyclomatic 25): PredictionContext.mergeArrays 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":"runtime/Dart/lib/src/prediction_context.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"883fe9f57611cdcc9ffd779d0dac58fbbfa3e8adfd0c2041e49d8cf494c9ccf3"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.ComputeReachSet (cyclomatic 24): ParserATNSimulator.ComputeReachSet 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcee5f85a557fb6c6433ad75eee2cef118b65004ce2faaa0cd944a16b1ca4899"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNOptimizer.optimizeSets (cyclomatic 24): ATNOptimizer.optimizeSets 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":"tool/src/org/antlr/v4/automata/ATNOptimizer.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"77765767385b63e3caa0d015dcfdfb8ef45214c7386f73285df8f739bbdf90db"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.computeReachSet (cyclomatic 24): ParserATNSimulator.computeReachSet 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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f70345681851fe799c935c88d3b20b73e184e164b22abf262393de18bf3ba6"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.computeReachSet (cyclomatic 24): ParserATNSimulator.computeReachSet 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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11630a555aeda23eabdb8960519026e2f23df760dc803cfda2ee0ee822c265e"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.computeReachSet (cyclomatic 24): ParserATNSimulator.computeReachSet 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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ebc6c7fcfc14285e9264cebc5f353107caa89c75374b1641dde976bcd3c254"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.computeReachSet (cyclomatic 24): ParserATNSimulator.computeReachSet 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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"e041b489ffc07e54da4d2f09fbe31ab855f3b21a1c5afe92fda0fa5a4f42129c"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool.handleArgs (cyclomatic 23): Tool.handleArgs 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":"tool/src/org/antlr/v4/Tool.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400d5476f6467098546c057b323f1c9d089a5c6910ae6a1d402e7a8748bc908"}},{"ruleId":"D1","level":"warning","message":{"text":"LL1Analyzer.look1 (cyclomatic 23): LL1Analyzer.look1 has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/ll1_analyzer.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ff4458f309ab0c905296d22d837e6708c44bb356bc28bf49afb775a7511fd6"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.OptimizeSets (cyclomatic 22): ATNDeserializer.OptimizeSets 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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97954b8c60d9f5c88e95d72d051b0aa123b107d16a3ec6b40d1117ea73933d2"}},{"ruleId":"D1","level":"warning","message":{"text":"LL1Analyzer.Look_ (cyclomatic 22): LL1Analyzer.Look_ 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":"runtime/CSharp/src/Atn/LL1Analyzer.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d6a1b4ea8dd0524787df76b2aee42b8f56c65db12c69b31d5d03a849ff5349"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.ExecATN (cyclomatic 22): ParserATNSimulator.ExecATN 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"997995a6e95e352c6158c2fb0fb77dd03682d796073af1c62776eb62ca0c35f6"}},{"ruleId":"D1","level":"warning","message":{"text":"CharSupport.getStringFromGrammarStringLiteral (cyclomatic 22): CharSupport.getStringFromGrammarStringLiteral 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":"tool/src/org/antlr/v4/misc/CharSupport.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82e1c8251422174e7685322c470370abe4742556a0b2855cac82f3da3de55b3"}},{"ruleId":"D1","level":"warning","message":{"text":"EscapeSequenceParsing.parseEscape (cyclomatic 22): EscapeSequenceParsing.parseEscape 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":"tool/src/org/antlr/v4/misc/EscapeSequenceParsing.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a761f0a7574e9eecc03a30851016e1899791e017d6bbd838fd61bc0c9ab879ae"}},{"ruleId":"D1","level":"warning","message":{"text":"LL1Analyzer._LOOK (cyclomatic 22): LL1Analyzer._LOOK 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":"runtime/Java/src/org/antlr/v4/runtime/atn/LL1Analyzer.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2e6f60fb3ffb33c0a31e59cd7701a9ac944e6da4e642a563248876f8764ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"LL1Analyzer._LOOK (cyclomatic 22): LL1Analyzer._LOOK 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":"runtime/Python3/src/antlr4/LL1Analyzer.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"316442bd865f033b9eaa2268c4b7174736d0854e6b510419b56f4c21bfa98236"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.execATN (cyclomatic 22): ParserATNSimulator.execATN 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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b17a828936b0b80739a53ead571a47e1de7b5c7c5a9896ffe60e2ca8bdeec4"}},{"ruleId":"D1","level":"warning","message":{"text":"LL1Analyzer._LOOK (cyclomatic 22): LL1Analyzer._LOOK 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":"runtime/Swift/Sources/Antlr4/atn/LL1Analyzer.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"73491e4e075bab01e7a5e47037f118e288765f377edbe887fb2a6139e44c3128"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.execATN (cyclomatic 22): ParserATNSimulator.execATN 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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"68885875c7045a6fdf4119165e39a635cabe93463ee833fee49dd5696b48449c"}},{"ruleId":"D1","level":"warning","message":{"text":"LL1Analyzer._LOOK (cyclomatic 22): LL1Analyzer._LOOK 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":"runtime/Dart/lib/src/ll1_analyzer.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebe3b5961d128a6674abad52cc7da784baa127d28fe444075ae2be40aa2bb50"}},{"ruleId":"D1","level":"warning","message":{"text":"LL1Analyzer._LOOK (cyclomatic 22): LL1Analyzer._LOOK 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":"runtime/JavaScript/src/antlr4/atn/LL1Analyzer.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5995ba9766e475f9e0addf5fa785d4a7a6d458ce8c7a4d6ced24c232814cfd2"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.execATN (cyclomatic 22): ParserATNSimulator.execATN 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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1b46848334304eb7f1018e343f4c32c0fe0e3882ea65c10cc993925168a3cc"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.CombineChainedEpsilons (cyclomatic 21): ATNDeserializer.CombineChainedEpsilons has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bc449e230417aadc0c1dbb77bf1dfc6c2da61def98654fe10e1ea0d1ec3569"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreePatternMatcher.MatchImpl (cyclomatic 21): ParseTreePatternMatcher.MatchImpl has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Pattern/ParseTreePatternMatcher.cs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b819cf54a99957aa0244daa380b9145af1bc8bb2da6ff8a1f9d2fb43127b5e9"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreePatternMatcher.Split (cyclomatic 21): ParseTreePatternMatcher.Split has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Pattern/ParseTreePatternMatcher.cs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"209165f614a985b77c2b79a218aa45344b6f0a21a63a4c28d693d8048d67fabe"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.execATN (cyclomatic 21): ParserATNSimulator.execATN has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9181941770a2081ef5ef6508a6a88b0a1e6d334be94f58438c746ce655877189"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpreterDataReader.parseFile (cyclomatic 21): InterpreterDataReader.parseFile has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/misc/InterpreterDataReader.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9986de357d3e036a7c33cfd6d709a7213d6ab5aadfd2c07defa63c2957f4eda2"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreePatternMatcher.matchImpl (cyclomatic 21): ParseTreePatternMatcher.matchImpl has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/tree/pattern/ParseTreePatternMatcher.java"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45c0ea2497ec1bfe901b9f54174d80947622e25b0db3dccaa3b3aa483a5310a"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreePatternMatcher.split (cyclomatic 21): ParseTreePatternMatcher.split has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/tree/pattern/ParseTreePatternMatcher.java"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c349683a6aef1d449e1d940df7ce9a1b0ccb9a292192375caee2cfc0068ee5"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.execATN (cyclomatic 21): ParserATNSimulator.execATN has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b52ac3cd9a4ee3c31b64834b9e97e11fde0e7ce99a542159291d6fc45824e2"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreePatternMatcher.matchImpl (cyclomatic 21): ParseTreePatternMatcher.matchImpl has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/tree/ParseTreePatternMatcher.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e266be98d7845d060babf330ed00eec776c72f3564a1b520ed3a46325ece05"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreePatternMatcher.split (cyclomatic 21): ParseTreePatternMatcher.split has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/tree/ParseTreePatternMatcher.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c8ab34f8eef66d657272e8d9700b6fab6e7a5a582ade017e0c1ca8ba012d87"}},{"ruleId":"D1","level":"warning","message":{"text":"InterpreterDataReader.init (cyclomatic 21): InterpreterDataReader.init has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/misc/InterpreterDataReader.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f49fd0834fadee44a60c8291494eb1d5ae61aa93ba33400ba131b69691258b"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreePatternMatcher.split (cyclomatic 21): ParseTreePatternMatcher.split has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/tree/pattern/ParseTreePatternMatcher.swift"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a664a837bd652610e92e9e681188e62a814d4ecd4f7caaf8f889caa528a6260"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.execATN (cyclomatic 21): ParserATNSimulator.execATN has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67334273297749403dcd67fe4ff4ded26a9b9b1eac83ee7d74356923e8eeff3"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.computeReachSet (cyclomatic 21): ParserATNSimulator.computeReachSet has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17b9d01afd060839bc95f52e7e1d8e3f70790511b99a99a92741b994b46aa56"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreePatternMatcher.split (cyclomatic 21): ParseTreePatternMatcher.split has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/tree/src/pattern/parse_tree_match.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c091b66874a44bcc6cd6b3b9ad17881177c83a221ba549619c1e3e202e3793"}},{"ruleId":"D1","level":"warning","message":{"text":"Target.getTargetStringLiteralFromANTLRStringLiteral (cyclomatic 20): Target.getTargetStringLiteralFromANTLRStringLiteral 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":"tool/src/org/antlr/v4/codegen/Target.java"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0469d24e788f976cff843f78cf144f4c442c8c72383c5607833442f219af9cf1"}},{"ruleId":"D1","level":"warning","message":{"text":"GrammarTransformPipeline.extractImplicitLexer (cyclomatic 20): GrammarTransformPipeline.extractImplicitLexer 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":"tool/src/org/antlr/v4/tool/GrammarTransformPipeline.java"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6457d8cd47fb820bb747127af1329e73111f1b607dc63c6a7c30ccc0109296e"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule (cyclomatic 20): ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule 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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"206e7da11b872ace516c01746e8562116bc16dc857de19f381f34b98cc2a1b86"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserInterpreter.visitState (cyclomatic 20): ParserInterpreter.visitState 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":"runtime/Swift/Sources/Antlr4/ParserInterpreter.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca9658016988eaa2b126986e995ea8118cf108c17931b61a23d9ddce734c67b"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule (cyclomatic 20): ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule 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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf49e49abc29f037c771b8f69c0d545d2c3d099ad37482ef57d10ee29638f548"}},{"ruleId":"D1","level":"warning","message":{"text":"LexerAction.swift.== (cyclomatic 20): LexerAction.swift.== has cyclomatic complexity 20 (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":"runtime/Swift/Sources/Antlr4/atn/LexerAction.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"124e9b166bc367e28ab9bf1c9b80e93210d7383a49c0007eee0d476f3654e2eb"}},{"ruleId":"D1","level":"warning","message":{"text":"LexerATNFactory.createLexerAction (cyclomatic 19): LexerATNFactory.createLexerAction 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":"tool/src/org/antlr/v4/automata/LexerATNFactory.java"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"0595b132ae43bdfaef3fd5f1a1289bb717121df47a15c3cabf8f90a82929d3cf"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputModelWalker.walk (cyclomatic 19): OutputModelWalker.walk 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":"tool/src/org/antlr/v4/codegen/OutputModelWalker.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d379c15a4d98c5c9b1f9c8075eb58f057b3114277092fbc3850f19c2802ee88a"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNSerializer.addEdges (cyclomatic 19): ATNSerializer.addEdges 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":"runtime/Java/src/org/antlr/v4/runtime/atn/ATNSerializer.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"daafd7dca2f9244383a52fd86ec4e8c93bd6a8e7498060dda8e515d216191cb1"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.deserialize (cyclomatic 19): ATNDeserializer.deserialize has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/ATNDeserializer.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"888ddf29c4ec2f068f7394db6d79958e40020aa0344c9e8d1a42dbc8c27ad83e"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictionContext.mergeArrays (cyclomatic 19): PredictionContext.mergeArrays 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":"runtime/Swift/Sources/Antlr4/atn/PredictionContext.swift"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ec5a2a70f85cf3dc050acf6e3be74e97dd9823364e35fd62787330bacb992a"}},{"ruleId":"D1","level":"warning","message":{"text":"ParseTreePatternMatcher.matchImpl (cyclomatic 19): ParseTreePatternMatcher.matchImpl 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":"runtime/Swift/Sources/Antlr4/tree/pattern/ParseTreePatternMatcher.swift"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"48afdf349c25bafc40ec35eda531f4def254ec83579c40ebc06acbb1b98d852c"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule (cyclomatic 19): ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule 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":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de6b9b442a3170d08571e2ece260223ffe4cf5be302e298df92e21418712eec"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserInterpreter.visitState (cyclomatic 19): ParserInterpreter.visitState 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":"runtime/Dart/lib/src/parser_interpreter.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cf2aa8c516ca9ac7daed4881061e8ed57c1423bd4248431e917591e6099390"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictionContext.mergeSingletons (cyclomatic 19): PredictionContext.mergeSingletons 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":"runtime/Dart/lib/src/prediction_context.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5717040ba5b9ad4a663cf8c39720c4f2bec9d0300df6045cd394bd700e116b"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule (cyclomatic 19): ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule 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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb1d73f70aabff4575fb50e5b3c03af502c9c01065d99e13236d8acb4a2d84c"}},{"ruleId":"D1","level":"warning","message":{"text":"LexerATNSimulator.Closure (cyclomatic 18): LexerATNSimulator.Closure 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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c8150958e3e10a395ba4c8f07b2d33a2f248583f48ff5658f66792392a2e07"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.CanDropLoopEntryEdgeInLeftRecursiveRule (cyclomatic 18): ParserATNSimulator.CanDropLoopEntryEdgeInLeftRecursiveRule 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc37fca2354fb9c69593e6eb4f1003441f8fb36790374d8ae5dfb50961cf4a2"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictionContext.MergeSingletons (cyclomatic 18): PredictionContext.MergeSingletons 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":"runtime/CSharp/src/Atn/PredictionContext.cs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07f734c69637bd6f736dcd4f5d93ade2a075cc0e9c2fd618399dab1d4dd20ef"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserInterpreter.VisitState (cyclomatic 18): ParserInterpreter.VisitState 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":"runtime/CSharp/src/ParserInterpreter.cs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a8519433c85237a27c753ce0b045d5c2d46b1703f2239d3678ae986d455705"}},{"ruleId":"D1","level":"warning","message":{"text":"LexerATNSimulator.closure (cyclomatic 18): LexerATNSimulator.closure 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":"runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c1deec4309e07f33e75583d18fb50d8596b8d3c3091a6676b07860bde627c2"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictionContext.mergeSingletons (cyclomatic 18): PredictionContext.mergeSingletons 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":"runtime/Java/src/org/antlr/v4/runtime/atn/PredictionContext.java"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c731d27fc92dcdc8c6ca5f72247f9e74dfe166bd65247261a416c7162ac4e156"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserInterpreter.visitState (cyclomatic 18): ParserInterpreter.visitState 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":"runtime/Java/src/org/antlr/v4/runtime/ParserInterpreter.java"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e2fd8eec6f5f65cf90773a9bd91f12fc6860c4f5b043b2648cc1589f6a7c88"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictionContext.mergeSingletons (cyclomatic 18): PredictionContext.mergeSingletons 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":"runtime/Python3/src/antlr4/PredictionContext.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ad327c5807277e5fa552a53876569a17101b5161600b89009be2a1c4908860"}},{"ruleId":"D1","level":"warning","message":{"text":"LexerATNSimulator.closure (cyclomatic 18): LexerATNSimulator.closure 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":"runtime/Python3/src/antlr4/atn/LexerATNSimulator.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff132586b88be1200258b273c6efcbed95d466a2f51192e3a67ae16ec13e650"}},{"ruleId":"D1","level":"warning","message":{"text":"antlr.mergeSingletons (cyclomatic 18): antlr.mergeSingletons 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":"runtime/Go/antlr/v4/prediction_context.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a594f999760a11a6dc2e08bb3788ddbce10d327a1e5d235569cc3ca1a025cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"LexerATNSimulator.closure (cyclomatic 18): LexerATNSimulator.closure 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":"runtime/Go/antlr/v4/lexer_atn_simulator.go"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"286fad60615e286f55bab89eeef980b4a0c225523ee0f5bfb2f180e162ef15b7"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.readEdges (cyclomatic 18): ATNDeserializer.readEdges 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":"runtime/Dart/lib/src/atn/src/atn_deserializer.dart"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5944bf25dccb80404b34b042f3d934a7f0bb47c8e6754b2f416c1b1dbd4ce0e3"}},{"ruleId":"D1","level":"warning","message":{"text":"LexerATNSimulator.getEpsilonTarget (cyclomatic 18): LexerATNSimulator.getEpsilonTarget 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":"runtime/Dart/lib/src/atn/src/lexer_atn_simulator.dart"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3b30f82e291fb6c7fd7b792f26c1b9041653abe02798253450c39863d5d7a9"}},{"ruleId":"D1","level":"warning","message":{"text":"PredictionContextUtils.mergeSingletons (cyclomatic 18): PredictionContextUtils.mergeSingletons 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":"runtime/JavaScript/src/antlr4/context/PredictionContextUtils.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0955fe43e6d3bb52910e00aa1eb1f875330af58cf1d0b207f84844c4d3588737"}},{"ruleId":"D1","level":"warning","message":{"text":"LexerATNSimulator.closure (cyclomatic 18): LexerATNSimulator.closure 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":"runtime/JavaScript/src/antlr4/atn/LexerATNSimulator.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"986ea8514eef3ebe8c5cacef5eb4ad4e31b70572427f4bc0c075022e8668a6d3"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.GenerateRuleBypassTransitions (cyclomatic 17): ATNDeserializer.GenerateRuleBypassTransitions 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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d96c43d444cda699e6ffe69179b21d273feefe44a6e3397e051a06dd61a6ff0"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.ReadEdges (cyclomatic 17): ATNDeserializer.ReadEdges 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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d510ae37a7b7e6eeb80dead44c44cc569c9e56890f3dea2810a5bb0ff7042e"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.Closure_ (cyclomatic 17): ParserATNSimulator.Closure_ 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"588281ae3d0fd08fa34c7e76e93ddd396a4b5cdd4217c5029c0169aa5732acea"}},{"ruleId":"D1","level":"warning","message":{"text":"LexerATNFactory.checkCommands (cyclomatic 17): LexerATNFactory.checkCommands 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":"tool/src/org/antlr/v4/automata/LexerATNFactory.java"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"697d7eeb796ef7f1021c1d6593d6fda71a1017c4c4a94ce344aeba26a02130cf"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.closure_ (cyclomatic 17): ParserATNSimulator.closure_ 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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5918abfe26f437608a8689e7584c4802ff30d1649f91605d262ebc02ea04f8"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.readEdges (cyclomatic 17): ATNDeserializer.readEdges 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":"runtime/Python3/src/antlr4/atn/ATNDeserializer.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8198e0573f245077ad50c5c134b654769775ac497a71d09f3506a555a5fdc14a"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.verifyATN (cyclomatic 17): ATNDeserializer.verifyATN 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":"runtime/Python3/src/antlr4/atn/ATNDeserializer.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9d8dd1d52721161d41308fd4e9aefd8f4522676d114382d9647e73a45ae6eb"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.closure_ (cyclomatic 17): ParserATNSimulator.closure_ 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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb0bd07d8d206dd018ec2dd48ca021adac77b673ec6bd637c6e27a5053fdc85"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.readEdges (cyclomatic 17): ATNDeserializer.readEdges 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":"runtime/Go/antlr/v4/atn_deserializer.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f575945735e5a9a6238cc252cfa2ee4018d8a05904eedb353bdb614ddabafb"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.verifyATN (cyclomatic 17): ATNDeserializer.verifyATN has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function taking that case\u0027s concrete type, so the dispatch reads one line per case. These arms are selected by TYPE rather than by value, so there is no key a lookup table could be built on; where you own the matched types, giving them one shared interface method and calling that is the form a table would have taken, and where you do not, keep the cases \u2014 they stay explicit and reviewable."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/atn_deserializer.go"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"5939008b8d13d1d616da00c84f3411b0f8d4bf756dc73c1a2a76fb82f38fbfa5"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.closureWork (cyclomatic 17): ParserATNSimulator.closureWork 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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"df77d0c2ffa9790c791be4b4c44058cae504a84499df1214bf9f2b92c4b0848b"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.generateRuleBypassTransitions (cyclomatic 17): ATNDeserializer.generateRuleBypassTransitions 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":"runtime/Swift/Sources/Antlr4/atn/ATNDeserializer.swift"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9701876b00e518f048e1963d07d8e418d9459ffc367955c50582a020aa66138f"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.closure_ (cyclomatic 17): ParserATNSimulator.closure_ 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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfaa231c5e7a44b82d018fb47120f4791daabf7a46e7503bea6978aa9c526a2"}},{"ruleId":"D1","level":"warning","message":{"text":"LexerATNSimulator.closure (cyclomatic 17): LexerATNSimulator.closure 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":"runtime/Dart/lib/src/atn/src/lexer_atn_simulator.dart"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"288d28c53f6a005972f266b0248ee77e837ef8584b609ddb496786cb9f12b4d8"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.closure_ (cyclomatic 17): ParserATNSimulator.closure_ 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":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0fdba9e4981071d941d6eeb56be81dc805b0e134608edcd7e3d73f936d223c"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.readEdges (cyclomatic 17): ATNDeserializer.readEdges 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":"runtime/JavaScript/src/antlr4/atn/ATNDeserializer.js"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e1c4ee23140b2305a6ebc8e73023d6c45080cda706049053b3c6ea059fecda"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.verifyATN (cyclomatic 17): ATNDeserializer.verifyATN 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":"runtime/JavaScript/src/antlr4/atn/ATNDeserializer.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"103408a5e0d07a6f8dfd04c5339f147f3ae9e59b0b2ee3486d3637c9a5e4fffa"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.closure_ (cyclomatic 17): ParserATNSimulator.closure_ 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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4730748ba6f5d5b3e10d583ea790bbb432b63e25e66743b14b3d20d6ce0cbc"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.VerifyATN (cyclomatic 16): ATNDeserializer.VerifyATN 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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"8125525f97e0d09a2f233a6127d15db59d1d4a43ccaa2b14bcd8a46e62235ade"}},{"ruleId":"D1","level":"warning","message":{"text":"LeftRecursiveRuleAnalyzer.text (cyclomatic 16): LeftRecursiveRuleAnalyzer.text 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":"tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a13f169acf949d8c3d4046bbaf52da8430044b9ea8503a145e40ff7a733fc95"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.interp (cyclomatic 16): Interpreter.interp 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":"tool/src/org/antlr/v4/gui/Interpreter.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"253be976dd6dfdc8867c558c43b03ea59af8b4612f3046fc6634f1019659fcf6"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.\u003Cinit\u003E (cyclomatic 16): Interpreter.\u003Cinit\u003E 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":"tool/src/org/antlr/v4/gui/Interpreter.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bce65477c71fe9bc4aa9e934fe99f50702dccf3840fa6889f21e335ff0a54a1"}},{"ruleId":"D1","level":"warning","message":{"text":"ScopeParser._parsePrefixDecl (cyclomatic 16): ScopeParser._parsePrefixDecl 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":"tool/src/org/antlr/v4/parse/ScopeParser.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"87761cadb91bedce8a5c345b4a36dc622bc559884d1472aa4db8281153142f86"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.verifyATN (cyclomatic 16): ATNDeserializer.verifyATN 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":"runtime/Java/src/org/antlr/v4/runtime/atn/ATNDeserializer.java"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d820a5c3d0f9689854b946c649b82183343df2594b9e085aa21b27dd334bc2b3"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserInterpreter.visitState (cyclomatic 16): ParserInterpreter.visitState 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":"runtime/Python3/src/antlr4/ParserInterpreter.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15b80ecf269cad380a4b779fc7829ef6a8a24ff00ec17562696b98c780dbc25"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.verifyATN (cyclomatic 16): ATNDeserializer.verifyATN 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":"runtime/Swift/Sources/Antlr4/atn/ATNDeserializer.swift"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2f60cf01cbee5863f4302adc8bae6f8735031a5df8b976c62ddc32452c6bcb"}},{"ruleId":"D1","level":"warning","message":{"text":"LexerATNSimulator.closure (cyclomatic 16): LexerATNSimulator.closure 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":"runtime/Swift/Sources/Antlr4/atn/LexerATNSimulator.swift"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec43c4866f6ac617d82561ffd6bb86365b53ad613f84c9b2515e3042ea1aec3c"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserATNSimulator.execATNWithFullContext (cyclomatic 16): ParserATNSimulator.execATNWithFullContext 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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"5658f71134681fecd00a812793959c3be9019d9d447df2c764817c5166bba9c9"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.generateRuleBypassTransition (cyclomatic 16): ATNDeserializer.generateRuleBypassTransition 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":"runtime/Dart/lib/src/atn/src/atn_deserializer.dart"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a539a42ffbf218b777ea0501b4ba2c02a5d8b75cffd8705e4b455586df1fd1e"}},{"ruleId":"D1","level":"warning","message":{"text":"ATNDeserializer.verifyATN (cyclomatic 16): ATNDeserializer.verifyATN 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":"runtime/Dart/lib/src/atn/src/atn_deserializer.dart"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"637adc53f440e5c959a8337d9807317b90b5cbb2610acde7b28255a04eba9f72"}},{"ruleId":"D2","level":"warning","message":{"text":"GrammarTransformPipeline.integrateImportedGrammars (cognitive 125): GrammarTransformPipeline.integrateImportedGrammars has cognitive complexity 125 (threshold 15). Drivers by points: if/else 28 (84 pts), loops 13 (40 pts), boolean chains 1 (nesting depth added 83). 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":"tool/src/org/antlr/v4/tool/GrammarTransformPipeline.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f07a9198dfdb81fcf20b5b69ea9f9a366f192e79c6fb0f05e7ad19c2b95b308"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.deserialize (cognitive 125): ATNDeserializer.deserialize has cognitive complexity 125 (threshold 15). Drivers by points: if/else 30 (83 pts), loops 22 (40 pts), boolean chains 2 (nesting depth added 71). 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":"runtime/Java/src/org/antlr/v4/runtime/atn/ATNDeserializer.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b79f9e53742ed8dacd43eb420ec78edb091d723db30936ea2fd48431f17c98"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeGenPipeline.process (cognitive 85): CodeGenPipeline.process has cognitive complexity 85 (threshold 15). Drivers by points: if/else 29 (81 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 53). 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":"tool/src/org/antlr/v4/codegen/CodeGenPipeline.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa499b86d948cba8ab3d1b25cc60441de1f9402cd29b9555a5dc672dc68b226"}},{"ruleId":"D2","level":"warning","message":{"text":"antlr.reduceToSingleOperationPerIndex (cognitive 84): antlr.reduceToSingleOperationPerIndex has cognitive complexity 84 (threshold 15). Drivers by points: if/else 22 (63 pts), loops 7 (11 pts), boolean chains 10 (nesting depth added 45). 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":"runtime/Go/antlr/v4/tokenstream_rewriter.go"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"725ad4c25661f6520cb3ab91a4b065875caea3937f6ddd16caf9a90bf34bede4"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNOptimizer.optimizeSets (cognitive 72): ATNOptimizer.optimizeSets has cognitive complexity 72 (threshold 15). Drivers by points: if/else 16 (49 pts), loops 7 (21 pts), boolean chains 2 (nesting depth added 47). 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":"tool/src/org/antlr/v4/automata/ATNOptimizer.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e110025586ac5e26c1b3e54ef033f3fc077ee039d8dc8972b9c9c004b0f8d43"}},{"ruleId":"D2","level":"warning","message":{"text":"RewriteOperationArray.reduceToSingleOperationPerIndex (cognitive 72): RewriteOperationArray.reduceToSingleOperationPerIndex has cognitive complexity 72 (threshold 15). Drivers by points: if/else 19 (55 pts), loops 7 (11 pts), boolean chains 6 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/TokenStreamRewriter.swift"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"291ee29b1bb5ffbd1bfddd910261682e803d2764b110fc8a3877de971f0a8bc0"}},{"ruleId":"D2","level":"warning","message":{"text":"CharSupport.getStringFromGrammarStringLiteral (cognitive 64): CharSupport.getStringFromGrammarStringLiteral has cognitive complexity 64 (threshold 15). Drivers by points: if/else 12 (45 pts), loops 3 (11 pts), boolean chains 8 (nesting depth added 41). 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":"tool/src/org/antlr/v4/misc/CharSupport.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"90703301758512bd28eb94fea539c0795f15e1f7dd079774089b994e5c506807"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.And (cognitive 62): IntervalSet.And has cognitive complexity 62 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07651f1de47cbab10353a96d66c196ecfc8bf102ff23f2409f9ea10a1bd31d7"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.and (cognitive 62): IntervalSet.and has cognitive complexity 62 (threshold 15). Drivers by points: if/else 17 (60 pts), boolean chains 1, loops 1 (nesting depth added 43). 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":"runtime/Swift/Sources/Antlr4/misc/IntervalSet.swift"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7e1984b7ce8f8a19cd7e4cef87a48cda1cd0f78550b89aea58a1ede72d4106"}},{"ruleId":"D2","level":"warning","message":{"text":"DOTGenerator.getDOT (cognitive 58): DOTGenerator.getDOT has cognitive complexity 58 (threshold 15). Drivers by points: if/else 25 (53 pts), loops 4 (5 pts) (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":"tool/src/org/antlr/v4/tool/DOTGenerator.java"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d4484dea0f997806908d98b1e993493d9a6cace062e1e98d098a06c6f9dc19"}},{"ruleId":"D2","level":"warning","message":{"text":"reduceToSingleOperationPerIndex (cognitive 58): reduceToSingleOperationPerIndex has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 7 (11 pts), boolean chains 6, ternaries 1 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/TokenStreamRewriter.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cb142f8e668a4715facf1b82e82b4e70a2faa9eaac6ea557d1efd06eb9c492"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenStreamRewriter.reduceToSingleOperationPerIndex (cognitive 57): TokenStreamRewriter.reduceToSingleOperationPerIndex has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 7 (11 pts), boolean chains 5, ternaries 1 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/TokenStreamRewriter.java"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc91a960694d11c3d796a35e6f8c52516689d00e985870c1f39606631f76dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenStreamRewriter.ReduceToSingleOperationPerIndex (cognitive 56): TokenStreamRewriter.ReduceToSingleOperationPerIndex has cognitive complexity 56 (threshold 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":"runtime/CSharp/src/TokenStreamRewriter.cs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"371bc91e9ce15547a8b4cbd00201836ea85b8336477283d36a2062264d376656"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.MatchImpl (cognitive 54): ParseTreePatternMatcher.MatchImpl has cognitive complexity 54 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Pattern/ParseTreePatternMatcher.cs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06b3f5c342c3ffb3b1016d8d7fb33f80327a4669be59d5bdd5e88ef30050ea9"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.execATN (cognitive 54): ParserATNSimulator.execATN has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (51 pts), boolean chains 2, loops 1 (nesting depth added 31). 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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c11e193402fc052307cd6904ab1bcaa4859f406870f2924b223536781eebb2"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.execATN (cognitive 53): ParserATNSimulator.execATN has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (47 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 31). 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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a8392db78e303cead6a861f2cc834a84719a07c5ab7ce35f34219a8e97743c"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.InlineSetRules (cognitive 52): ATNDeserializer.InlineSetRules has cognitive complexity 52 (threshold 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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5b907f4bf8bac0e92172e5369f2f4b4ef02974ea427908301827303ec5a590"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.matchImpl (cognitive 52): ParseTreePatternMatcher.matchImpl has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (48 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 30). 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":"runtime/Swift/Sources/Antlr4/tree/pattern/ParseTreePatternMatcher.swift"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d297552645f13710e8632ca488c400e927a1a3f39a2044d80d749c52c36bd6b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.OptimizeSets (cognitive 51): ATNDeserializer.OptimizeSets has cognitive complexity 51 (threshold 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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"83aff127b1002c5cfa1e19b89c978f3de4e972d4748d8da863ebcc579caf49c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.ExecATN (cognitive 51): ParserATNSimulator.ExecATN has cognitive complexity 51 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fab442facf9897c3a63505fd557db169b1b0c2beeeab6a8fb07d37da9dd346"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool.handleArgs (cognitive 51): Tool.handleArgs has cognitive complexity 51 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 4, error handling 1 (4 pts), loops 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/Tool.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6574a06d296949803592bd68e59d68c6c93c6879481ff7a6b48b65141e9f177e"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.execATN (cognitive 51): ParserATNSimulator.execATN has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (48 pts), boolean chains 2, loops 1 (nesting depth added 31). 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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"088d09447cc55ad255fb36c61a0f23cda07148765b00749180fd65948e887a0e"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.execATN (cognitive 51): ParserATNSimulator.execATN has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (45 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 31). 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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0c28ee4018559df187b5c178f3b1a12ee20b2477aa2e2360687fc4faf6227d"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.execATN (cognitive 50): ParserATNSimulator.execATN has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (44 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 31). 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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb08f8253f609a3837a8ad4f63ef0fe0f431bc0adeac8216a20eb99f01e093e"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closure_ (cognitive 50): ParserATNSimulator.closure_ has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (47 pts), boolean chains 2, loops 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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a6c5f96a2e10b4d81c76f8f97f98c73218e8024e8631469977309e202eac41"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closure_ (cognitive 50): ParserATNSimulator.closure_ has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (46 pts), boolean chains 3, loops 1 (nesting depth added 31). 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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ab03141b73f08f98951916c718bf40e9ae849b28418dc7728752373eb17a99"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.execATN (cognitive 50): ParserATNSimulator.execATN has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (44 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 30). 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":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c981e48adf0846c5eeeaaa32cdff5ed83542eca9fa25482bd6b115e9cf492fe"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeArrays (cognitive 50): mergeArrays has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 6, loops 3 (5 pts) (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":"runtime/JavaScript/src/antlr4/context/PredictionContextUtils.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ef8ea0cddb11ca876afdb494c52caa58a3ae76eaad0978e58e89adf769d712"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.CombineChainedEpsilons (cognitive 49): ATNDeserializer.CombineChainedEpsilons has cognitive complexity 49 (threshold 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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80f7a5deb7d8fc1aa3aeefb5b1f3c8007b2968204599219d40c6977faed87a8"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.MergeArrays (cognitive 49): PredictionContext.MergeArrays has cognitive complexity 49 (threshold 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":"runtime/CSharp/src/Atn/PredictionContext.cs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e0660b1ef5f0466083a9cb48fa7483dd9dd47a8a5f1069ba855d989bf2514a"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleDependencyChecker.CheckDependencies (cognitive 49): RuleDependencyChecker.CheckDependencies has cognitive complexity 49 (threshold 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":"runtime/CSharp/src/Misc/RuleDependencyChecker.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c76a61b91be36b6402595c687c7d7d2d08abaf6b1046cb76e5ca549db6c58d6"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.mergeArrays (cognitive 48): PredictionContext.mergeArrays has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (39 pts), loops 3 (5 pts), boolean chains 4 (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":"runtime/Java/src/org/antlr/v4/runtime/atn/PredictionContext.java"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"da376d730f6d4c6456c707df4f71c9a0dbf2f688fdcb16303323bad8fff27402"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.mergeArrays (cognitive 48): PredictionContext.mergeArrays has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (38 pts), boolean chains 5, loops 3 (5 pts) (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":"runtime/Python3/src/antlr4/PredictionContext.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"381ba4bb403ca109f0b0c490ddb7244de1e858a92f391d14dbb4bf55402a4a9e"}},{"ruleId":"D2","level":"warning","message":{"text":"antlr.mergeArrays (cognitive 48): antlr.mergeArrays has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (39 pts), loops 3 (5 pts), boolean chains 4 (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":"runtime/Go/antlr/v4/prediction_context.go"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"350e3a55b8382c0a2841b9d2e5439a610bfbeca7648acab182f8b9f467a4c8b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closureWork (cognitive 48): ParserATNSimulator.closureWork has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (44 pts), boolean chains 3, loops 1 (nesting depth added 31). 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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"822285a94657b21f5f8d74c25c7f7c0fcccd7a1abb559d1a489349054528a0b1"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenStreamRewriter._reduceToSingleOperationPerIndex (cognitive 47): TokenStreamRewriter._reduceToSingleOperationPerIndex has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 7 (11 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/TokenStreamRewriter.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"689fe2dd926f74d1818df17dbfba4b5b599bf5b84c3534bd7753c11542a47d48"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.computeReachSet (cognitive 45): ParserATNSimulator.computeReachSet has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 4 (7 pts), boolean chains 4 (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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e21200d8d133b9206c9eaf4058e07002dc2149061fa31f1b527b5e2b05549f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.GenerateRuleBypassTransitions (cognitive 44): ATNDeserializer.GenerateRuleBypassTransitions has cognitive complexity 44 (threshold 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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc937f4ca2f1e418a24ac02da4d390f03d9e6f3a99c52602cc222a92b5a707be"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.Closure_ (cognitive 44): ParserATNSimulator.Closure_ has cognitive complexity 44 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed36b049470f365e7a389def94f6b4d17034d002ea0543e7009850942fb90a63"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closure_ (cognitive 44): ParserATNSimulator.closure_ has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (39 pts), boolean chains 4, loops 1 (nesting depth added 27). 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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"659b5744eacc13718a06e1f84e73058d66d407e9d1849171059bff3c267c7839"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.readEdges (cognitive 44): ATNDeserializer.readEdges has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 6 (11 pts) (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":"runtime/Dart/lib/src/atn/src/atn_deserializer.dart"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b14721f2f5e29904edb10b3329ae49e16e6bf45d98f65d8f423a9dab3c4869f"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closure_ (cognitive 44): ParserATNSimulator.closure_ has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (39 pts), boolean chains 4, loops 1 (nesting depth added 27). 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":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"95016906e94fa17418a023173ae55bf65616f7e9d54fa467ebbee778da63b612"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closure_ (cognitive 44): ParserATNSimulator.closure_ has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (39 pts), boolean chains 4, loops 1 (nesting depth added 27). 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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bb62d3815384d8a565ac71aa0266714b7f52eeb141f58c49725043879d93a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopeParser._splitArgumentList (cognitive 43): ScopeParser._splitArgumentList has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 5 (13 pts), boolean chains 9, match/switch 1 (2 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":"tool/src/org/antlr/v4/parse/ScopeParser.java"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b5e5ca46974575d8f6f0bc0c8fdfcdb0b4af14a50ba9ce4e1a42f717e3652a"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.generateRuleBypassTransitions (cognitive 43): ATNDeserializer.generateRuleBypassTransitions has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 5 (11 pts), boolean chains 3 (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":"runtime/Swift/Sources/Antlr4/atn/ATNDeserializer.swift"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"af82dfa20cf6df8b4e46e8a0a6f309e99c8f3cbc0ae1dc01e0b6c1063cc2be1e"}},{"ruleId":"D2","level":"warning","message":{"text":"LL1Analyzer._LOOK (cognitive 43): LL1Analyzer._LOOK has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (37 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":"runtime/Swift/Sources/Antlr4/atn/LL1Analyzer.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"aece1657bff5c03132d3771ba58d06f1685a643b5b6c8bbca8b40db9d676b984"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.computeReachSet (cognitive 42): ParserATNSimulator.computeReachSet has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 4 (8 pts), boolean chains 4 (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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f6ae500ea7f7ea01afa763cbd9f3533e211c8f5adb20fc41e774e667b787f7"}},{"ruleId":"D2","level":"warning","message":{"text":"LL1Analyzer._LOOK (cognitive 42): LL1Analyzer._LOOK has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 2 (5 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":"runtime/Dart/lib/src/ll1_analyzer.dart"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fd29cdf430755bd41c94b271c21c62f87640ae6ce005c8f6c255957db00201"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.Split (cognitive 41): ParseTreePatternMatcher.Split has cognitive complexity 41 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Pattern/ParseTreePatternMatcher.cs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e159a1d743bfb0e00fa4cc5563b7be9917af1ba0dee1a942539edcb990c660"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNFactory.checkRangeAndAddToSet (cognitive 41): LexerATNFactory.checkRangeAndAddToSet has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (9 pts), ternaries 1 (5 pts), boolean chains 2 (nesting depth added 26). 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":"tool/src/org/antlr/v4/automata/LexerATNFactory.java"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a75570c9c5b0a6e4b9f53871d0555d457b968506c84da2b7cfdb752dee3b77"}},{"ruleId":"D2","level":"warning","message":{"text":"LL1Analyzer.look1 (cognitive 41): LL1Analyzer.look1 has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (35 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 17). Of this number, 38 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/ll1_analyzer.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a0524915800c8a1efeafe85a5e10027840fd659796ce711527e8451882673a"}},{"ruleId":"D2","level":"warning","message":{"text":"LL1Analyzer.Look_ (cognitive 40): LL1Analyzer.Look_ has cognitive complexity 40 (threshold 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":"runtime/CSharp/src/Atn/LL1Analyzer.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bd4d4bae61558c85bb1d57b5f796ee03bc00700850fb62420c5eb20c789e06"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.ToStrings (cognitive 40): PredictionContext.ToStrings has cognitive complexity 40 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/PredictionContext.cs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aca5dfbad36046bb2d240d64a49a352a4a49ee6aa7bf3c902badaf133f6ee4a"}},{"ruleId":"D2","level":"warning","message":{"text":"LL1Analyzer._LOOK (cognitive 40): LL1Analyzer._LOOK has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (34 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/LL1Analyzer.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3373da1ebf19d3c4b28b4525180866c79b3ab33bf4e3f5556750f398cfbde9"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.readEdges (cognitive 40): ATNDeserializer.readEdges has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 6 (11 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/atn_deserializer.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f474bdfc59f5855ad5301aebc4782d5d2eefe88e0828feb2d11c2b223178e17"}},{"ruleId":"D2","level":"warning","message":{"text":"LL1Analyzer._LOOK (cognitive 40): LL1Analyzer._LOOK has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (34 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/LL1Analyzer.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca59bd0b2402899953b7f9c3bbc9609fe53c4c0804a584033048323bd3819683"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.readEdges (cognitive 40): ATNDeserializer.readEdges has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 6 (11 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ATNDeserializer.js"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"713c7fca7e3f74a0cf571f0d5ac8d84a32863fac15eef280c24ae234d34f83e0"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.ReadEdges (cognitive 39): ATNDeserializer.ReadEdges has cognitive complexity 39 (threshold 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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4b66edd2db60bb7fcb84185e159db54fa5e544c8e0d33d0747ce25271d349b"}},{"ruleId":"D2","level":"warning","message":{"text":"EscapeSequenceParsing.parseEscape (cognitive 39): EscapeSequenceParsing.parseEscape has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 5 (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":"tool/src/org/antlr/v4/misc/EscapeSequenceParsing.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eb1e9443bceef79289a0509fc0e51a6618ddc90d19b22895f09b51c6a65c1e"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.readEdges (cognitive 39): ATNDeserializer.readEdges has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 6 (11 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/atn/ATNDeserializer.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4333af5c2e3d45c1293c0b42511cc144503e1068b057e0664682b2acc9ce6d4"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.computeReachSet (cognitive 39): ParserATNSimulator.computeReachSet has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 4 (7 pts), boolean chains 4 (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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fb2d61b21cea04208964955ffc9224a936e0f0a01b876c8d4fdc3127d1f0d8"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.mergeArrays (cognitive 39): PredictionContext.mergeArrays has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 6, loops 3 (5 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":"runtime/Dart/lib/src/prediction_context.dart"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0bd4a76b8b59ff7f461d769c64733e7059b01faaad7232e2c465f3be6f788f"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.matchImpl (cognitive 38): ParseTreePatternMatcher.matchImpl has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 2, loops 1 (2 pts) (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":"runtime/Java/src/org/antlr/v4/runtime/tree/pattern/ParseTreePatternMatcher.java"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd952fa58684db23a09b47781ba71d5414ec0c2e71723e5759ffebcfe02ed6f9"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closureCheckingStopState (cognitive 38): ParserATNSimulator.closureCheckingStopState has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 2 (5 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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c4ecac3a40ab9ff1a787c459aa9c2f9414e353a5d6a135babae3c42b544e97"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNPrinter.asString (cognitive 37): ATNPrinter.asString has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 2 (10 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":"tool/src/org/antlr/v4/automata/ATNPrinter.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7bf4c125bebfb38594ef1ec56d48b3d6bfa215a4ec68904d76184027abf8ad"}},{"ruleId":"D2","level":"warning","message":{"text":"DOTGenerator.getStateLabel (cognitive 37): DOTGenerator.getStateLabel has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (11 pts), boolean chains 1 (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":"tool/src/org/antlr/v4/tool/DOTGenerator.java"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc07fbd5064c6170afde34b9c2780884d9441cffc0e06b23c44ba6ac30681fe7"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.ComputeReachSet (cognitive 36): ParserATNSimulator.ComputeReachSet has cognitive complexity 36 (threshold 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11d5b1cdf5d72a8791e599ea12c95ff902c27cbf237377ce2e8478529d7e203"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.computeReachSet (cognitive 36): ParserATNSimulator.computeReachSet has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 4 (7 pts), boolean chains 4 (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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab482ab85c764bc71aad2ba4c950ceec5c60f0d036c6dc4785dd7e93638a63a3"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.computeReachSet (cognitive 36): ParserATNSimulator.computeReachSet has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 4 (7 pts), boolean chains 4 (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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"1502d0c5836298a42639b495954fff22615f7a107571809891e379fcb3ed0306"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.execATNWithFullContext (cognitive 36): ParserATNSimulator.execATNWithFullContext has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"e998a3f6fef01cbe17a148993f4a47493730f176c38935f09dc202c943baa7c6"}},{"ruleId":"D2","level":"warning","message":{"text":"Target.getTargetStringLiteralFromANTLRStringLiteral (cognitive 35): Target.getTargetStringLiteralFromANTLRStringLiteral has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 2 (6 pts), match/switch 1 (3 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":"tool/src/org/antlr/v4/codegen/Target.java"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de5355925d9d9ee780d34b002ab75152588fe3e2584636900807c4fbdd0cea5"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolChecks.checkForLabelConflicts (cognitive 35): SymbolChecks.checkForLabelConflicts has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 5 (16 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/semantics/SymbolChecks.java"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca512f29b277f31ffab76b9dd949e0c4003e6f3080a7c4c455a05873f3a447f"}},{"ruleId":"D2","level":"warning","message":{"text":"LL1Analyzer._LOOK (cognitive 35): LL1Analyzer._LOOK has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/LL1Analyzer.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d5b8a16cd6cd2f61d6e9103261f594953c54e00ff8ab612a390a44b8ae0153"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.toStrings (cognitive 35): PredictionContext.toStrings has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/PredictionContext.swift"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a5dacad467c3248892ad1014de216d808d8ad261906409cfc31bf16b6abdc5"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.MergeSingletons (cognitive 34): PredictionContext.MergeSingletons has cognitive complexity 34 (threshold 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":"runtime/CSharp/src/Atn/PredictionContext.cs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e8e12e2a820089286778ca2659ef26eb55e1a9090ebc474e70d47d99a8e153"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.toStrings (cognitive 34): PredictionContext.toStrings has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/PredictionContext.java"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b36cc19e19487b93588e93fd40ea73b71a5749cd3e6f802b8b79700c4dd281"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.matchImpl (cognitive 34): ParseTreePatternMatcher.matchImpl has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 2, loops 1 (2 pts) (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":"runtime/Python3/src/antlr4/tree/ParseTreePatternMatcher.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e198b864f0300f2ba903c84ef9f2a35686f41836412dbc311befcd1e475758d"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.generateRuleBypassTransition (cognitive 34): ATNDeserializer.generateRuleBypassTransition has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 4 (6 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":"runtime/Dart/lib/src/atn/src/atn_deserializer.dart"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46faa8f4936c789ddd650df8aab920cc804455a00407e957e774b7d581c5f92"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.toStrings (cognitive 34): PredictionContext.toStrings has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/prediction_context.dart"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"295673175b34a213afa2892118698a04387aee6304a944e720c8feb25023c59c"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.Closure (cognitive 33): LexerATNSimulator.Closure has cognitive complexity 33 (threshold 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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"443427097b184068006a281fba7cc8db44ac4d3b81a04cbea7dfdb3e30a50ead"}},{"ruleId":"D2","level":"warning","message":{"text":"GrammarTransformPipeline.extractImplicitLexer (cognitive 33): GrammarTransformPipeline.extractImplicitLexer has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 7 (10 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":"tool/src/org/antlr/v4/tool/GrammarTransformPipeline.java"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a05228bfce99a0381b72385e09c9d996db6f4747bc3b5d9c9f21b1628ebba3"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.closure (cognitive 33): LexerATNSimulator.closure has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 4, loops 2 (4 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":"runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3ebfeeaf639e62fe4bd24a38310393a41f7eea4e2e71ff286c66909e318858"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.closure (cognitive 33): LexerATNSimulator.closure has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 4, loops 2 (4 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":"runtime/Python3/src/antlr4/atn/LexerATNSimulator.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00830f0299632dc8b14730212ebaa5a3091b00ee2ac6fbdc0836ccf04574b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.mergeSingletons (cognitive 33): PredictionContext.mergeSingletons has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 3 (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":"runtime/Dart/lib/src/prediction_context.dart"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfd0331a3b69e87071685ea9e905286674384dbb69d9b21f211705db5e95ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.matchImpl (cognitive 33): ParseTreePatternMatcher.matchImpl has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 16). 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":"runtime/Dart/lib/src/tree/src/pattern/parse_tree_match.dart"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b9b4f5373436f03875915493cd62da48603299bc0281716bfdf4ba2a72ae67"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.closure (cognitive 33): LexerATNSimulator.closure has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 4, loops 2 (4 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":"runtime/JavaScript/src/antlr4/atn/LexerATNSimulator.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61c77dd2a0f9b1457c07af77cfffc1228c0215ac7f2593b61e22953f2112b0b"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.VerifyATN (cognitive 32): ATNDeserializer.VerifyATN has cognitive complexity 32 (threshold 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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e3461582f32acd895841c91c5fd535fd050d58a7bd10bce0386fef953bede2"}},{"ruleId":"D2","level":"warning","message":{"text":"OutputModelWalker.walk (cognitive 32): OutputModelWalker.walk has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 3 (7 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/codegen/OutputModelWalker.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3bb9576ba4e2ada3604d90a8530d1beea700b8460311f5b2438268268beda5"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.mergeSingletons (cognitive 32): PredictionContext.mergeSingletons has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 2 (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":"runtime/Java/src/org/antlr/v4/runtime/atn/PredictionContext.java"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"385177a31f1d33e9c01523b489a1836d993692f0f3c18ac702d185d1de828cf4"}},{"ruleId":"D2","level":"warning","message":{"text":"InterpreterDataReader.parseFile (cognitive 32): InterpreterDataReader.parseFile has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 6 (8 pts), ternaries 2 (4 pts), error handling 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":"runtime/Java/src/org/antlr/v4/runtime/misc/InterpreterDataReader.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"964f62de76dfd798ebb9771cf6cf46f0192672ecff53a5f3e548c4535198b11c"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.mergeSingletons (cognitive 32): PredictionContext.mergeSingletons has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 2 (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":"runtime/Python3/src/antlr4/PredictionContext.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0655224ea65dc53dce9edbcd891673d0ef9e945d0ade763a647cf1bbb51b94"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.closure (cognitive 32): LexerATNSimulator.closure has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 4, loops 2 (4 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":"runtime/Go/antlr/v4/lexer_atn_simulator.go"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e897d1d6beae8c1672b6a79d12546beec5731403524004d7c7d3ed6561565f"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.verifyATN (cognitive 32): ATNDeserializer.verifyATN has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/ATNDeserializer.swift"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecb3cbbf3b1b159e25ef3dc4a9fcae86f6cac83c68ff643905e28fb49b3c7e4"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContextUtils.mergeSingletons (cognitive 32): PredictionContextUtils.mergeSingletons has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 2 (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":"runtime/JavaScript/src/antlr4/context/PredictionContextUtils.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a28155373847f979179c61f52f7a60fee7564303ceec6fa5ded70999dc8f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.closure (cognitive 31): LexerATNSimulator.closure has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 2 (4 pts), boolean chains 2 (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":"runtime/Swift/Sources/Antlr4/atn/LexerATNSimulator.swift"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"31959feed0bf0841da8d326850afdfe0c0715c41f6a0c48ee11529aa050df8ed"}},{"ruleId":"D2","level":"warning","message":{"text":"LeftRecursiveRuleAnalyzer.text (cognitive 30): LeftRecursiveRuleAnalyzer.text has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (7 pts), boolean chains 3 (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":"tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"184258e54e5d82a5ce0d4e430732fad4183626fcb865f4ac4475224fe2e56a79"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.split (cognitive 30): ParseTreePatternMatcher.split has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (25 pts), loops 4, 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":"runtime/Swift/Sources/Antlr4/tree/pattern/ParseTreePatternMatcher.swift"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afaca3c38777534481b2b249337565716b6026cb0e4a17f2004959c9be890f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.computeReachSet (cognitive 30): ParserATNSimulator.computeReachSet has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 4 (7 pts), boolean chains 4 (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":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"71196b16ab49f041b0fb31ba55ae8e58f7c78104088001811c168d7a25def797"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.nextToken (cognitive 30): Lexer.nextToken has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), error handling 1 (3 pts), loops 2 (3 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":"runtime/JavaScript/src/antlr4/Lexer.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"09952e5d660c559b8bccae613db8eeff3cb16fdeb6644f4b5be9005868ac58d0"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolChecks.checkForUnreachableTokens (cognitive 29): SymbolChecks.checkForUnreachableTokens has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 4 (13 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/semantics/SymbolChecks.java"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fe9943c7ea479dd2114ccecc14a08fce82dedee8c29232f69e4de1e3740bab"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNSerializer.addEdges (cognitive 29): ATNSerializer.addEdges has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (15 pts), ternaries 2 (8 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/ATNSerializer.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82e1b8c019866841e77a1fbe9ec98a5a9c5df8e2274a0b549fe4ef706d1f053"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.split (cognitive 29): ParseTreePatternMatcher.split has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (24 pts), loops 4, 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":"runtime/Java/src/org/antlr/v4/runtime/tree/pattern/ParseTreePatternMatcher.java"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedc773536a900ca0bda499b2f96996fbd24878bbee71dc18c5934b6894755cd"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.closure (cognitive 29): LexerATNSimulator.closure has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, loops 2 (4 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":"runtime/Dart/lib/src/atn/src/lexer_atn_simulator.dart"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcb70eaf9e5878a88d6370dde64d55810365e5f70a984a009d54e6051985d54"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.split (cognitive 29): ParseTreePatternMatcher.split has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (24 pts), loops 4, 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":"runtime/Dart/lib/src/tree/src/pattern/parse_tree_match.dart"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"16581cea78ab52f89dc438f985a9aa32a22200d6b6d32f78cbd7df3236f185dd"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closureCheckingStopState (cognitive 29): ParserATNSimulator.closureCheckingStopState has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 17). 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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72e57648431984c82c3b725c77d35430d0331736b49cac15114541204b175d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.ClosureCheckingStopState (cognitive 28): ParserATNSimulator.ClosureCheckingStopState has cognitive complexity 28 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"df590fae84906f3dd2b16959c9e91cc795995ae819875b8f7a7878b35d8912d6"}},{"ruleId":"D2","level":"warning","message":{"text":"DOTGenerator.getDOT (cognitive 28): DOTGenerator.getDOT has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (6 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":"tool/src/org/antlr/v4/tool/DOTGenerator.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"806d853038dea43c491a7e8abc61e4f7b78e202f06b7d3371eedbecb4d8f2fc1"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.verifyATN (cognitive 28): ATNDeserializer.verifyATN has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/ATNDeserializer.java"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a02d24f8f258c819f9f648cb5f28b7d8a4aed5f8d00ba845da5650264f4dfe2"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.toDOTString (cognitive 28): PredictionContext.toDOTString has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (6 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":"runtime/Java/src/org/antlr/v4/runtime/atn/PredictionContext.java"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbbd5aec6e41526d82b5227a6a0b34c1ff3c2f31802a0017f609f296fc95553"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.verifyATN (cognitive 28): ATNDeserializer.verifyATN has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/atn/ATNDeserializer.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"5207aabee440e04c9b747c11eadfee5e58d86fb3252021d86adeb05c054cd124"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closureCheckingStopStateRecursive (cognitive 28): ParserATNSimulator.closureCheckingStopStateRecursive has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 1 (3 pts) (nesting depth added 17). 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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5890d70104468cdadd3dffa660e19f76c5f4b8ad6b572fc52b98efa9713a69"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.nextToken (cognitive 28): Lexer.nextToken has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (5 pts), error handling 1 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/Lexer.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"442f7697ec85287bd5c51718ec5063c1331955dc3d562d9e0215dc5fcfc1937e"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closureCheckingStopState (cognitive 28): ParserATNSimulator.closureCheckingStopState has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 1 (3 pts) (nesting depth added 17). 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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd56578c239249c6f7396e3eb9ef4c8d23a8817b1473abcbca358719178011c"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.toDOTString (cognitive 28): PredictionContext.toDOTString has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (6 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":"runtime/Swift/Sources/Antlr4/atn/PredictionContext.swift"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e30f66431fda782ac6b7759ee5dfc3dfe63d257e69f967889533443b1473266"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.verifyATN (cognitive 28): ATNDeserializer.verifyATN has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/atn/src/atn_deserializer.dart"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"297cd17933c35241b7f15eafddd0b89680fd5d2cb3b98fada17e57c4fea0f9d2"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closureCheckingStopState (cognitive 28): ParserATNSimulator.closureCheckingStopState has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 1 (3 pts) (nesting depth added 17). 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":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b6348b03ac1e9e947a1bb30b4b4e83def3411374fc2d0e75ba3b553af17229"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.toDOTString (cognitive 28): PredictionContext.toDOTString has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (6 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":"runtime/Dart/lib/src/prediction_context.dart"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b223f407728d96cfa114c14b8a3f50ce104d73838dfd5bfffccb2d3f2a80866"}},{"ruleId":"D2","level":"warning","message":{"text":"UnbufferedCharStream.fill (cognitive 27): UnbufferedCharStream.fill has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 2, error handling 1 (2 pts), loops 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":"runtime/Java/src/org/antlr/v4/runtime/UnbufferedCharStream.java"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cbf8213a798b711591986c2320ddaf781ad2f5bc7ec026fcf9c7b457735f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.validateStates (cognitive 27): ATNDeserializer.validateStates has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (7 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":"runtime/Swift/Sources/Antlr4/atn/ATNDeserializer.swift"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca3b715dc9817f6011812da06c6d36ecfb57a84ba0653ce963141315b920ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.mergeArrays (cognitive 27): PredictionContext.mergeArrays has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 6, loops 3 (5 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":"runtime/Swift/Sources/Antlr4/atn/PredictionContext.swift"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b3e4491bcfb1d1b57d1349a0f8b12b5340742de12bf5353c9b2a288c524960"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.nextToken (cognitive 27): Lexer.nextToken has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 2 (5 pts), error handling 1 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/lexer.dart"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30746de73aa5c84de67bb02fa9df12e8eac3eb0390488bcd7bd172a7bc34922"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.split (cognitive 26): ParseTreePatternMatcher.split has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 4, 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":"runtime/Python3/src/antlr4/tree/ParseTreePatternMatcher.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d76cb4aa58496c3dbbc9403806beba665059aa1d29ed53cebbdf53b771b046"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.toString (cognitive 26): IntervalSet.toString has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/interval_set.dart"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"da78ff01c58e2a57419256aaeafa42420295d1b1c7d1f9bd747b198c701c6d26"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.ExecATNWithFullContext (cognitive 25): ParserATNSimulator.ExecATNWithFullContext has cognitive complexity 25 (threshold 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa0327186da604a0c3e29872070d7ba2037ab49dca797da3039d8c3b95af380"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.Subtract (cognitive 25): IntervalSet.Subtract has cognitive complexity 25 (threshold 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":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"303bcc124d220c653235cc1a0e2f4deb7791cf43ff149b481bc1192ed726fa00"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.Tokenize (cognitive 25): ParseTreePatternMatcher.Tokenize has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Pattern/ParseTreePatternMatcher.cs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"632b0318665fe8f16fdc35351e5a75ad28e3a1dd9c32bf501d9b8d177723c434"}},{"ruleId":"D2","level":"warning","message":{"text":"UnbufferedCharStream.Fill (cognitive 25): UnbufferedCharStream.Fill has cognitive complexity 25 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/UnbufferedCharStream.cs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"18946cbfc0830e1f9f971de43316887047875a4037b7f16dcb58efde000bd66e"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNFactory.checkCommands (cognitive 25): LexerATNFactory.checkCommands has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/automata/LexerATNFactory.java"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c569042555d23418418c586ca917b67880b5da6dbc79a172c6ce7af2fceae8"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.\u003Cinit\u003E (cognitive 25): Interpreter.\u003Cinit\u003E has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/gui/Interpreter.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cb9100dfe6a761b5369389c0ec1db09034e087c207988b14a2ed54ea85be32"}},{"ruleId":"D2","level":"warning","message":{"text":"SymbolChecks.getSingleTokenValues (cognitive 25): SymbolChecks.getSingleTokenValues has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/semantics/SymbolChecks.java"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f21d5299c57b537c9e3982ba0dcee09a8c6f3b035956c283623e1d08fc4c29d"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closureCheckingStopState (cognitive 25): ParserATNSimulator.closureCheckingStopState has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 1 (3 pts) (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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41340b7f33f18bde2528edc887be26efaae438513731f10d6f7cfea1de91a1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.nextToken (cognitive 25): Lexer.nextToken has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 1 (3 pts), loops 2 (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":"runtime/Python3/src/antlr4/Lexer.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7c19d25dd0fda5b4cccfda838663ddd42cf942c53a7111554d26d7527ef57c"}},{"ruleId":"D2","level":"warning","message":{"text":"antlr.mergeSingletons (cognitive 25): antlr.mergeSingletons has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (23 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":"runtime/Go/antlr/v4/prediction_context.go"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db726516f970268b7ee9e9f806b5a0f2e1fb7532f963607cc1cd72223012723"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.execATNWithFullContext (cognitive 25): ParserATNSimulator.execATNWithFullContext has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"17316c5c4b2bc130e6bafe9c9d44f3e5d9623d5e94027c9f9fa42778f8cd2cde"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule (cognitive 25): ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, loops 2 (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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"130cf23e5d755929d8ce90bb4c00a0dd6a283b10f0b135747bb56e99e8ac0d89"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.mergeSingletons (cognitive 25): PredictionContext.mergeSingletons has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (23 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":"runtime/Swift/Sources/Antlr4/atn/PredictionContext.swift"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e936827fbde33faf6736c954de8197d48b4ba9525aa2a0b1ebaf77e5cc93e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.subtract (cognitive 25): IntervalSet.subtract has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, 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":"runtime/Swift/Sources/Antlr4/misc/IntervalSet.swift"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48c35fd73f168d64f9589453532eb815ce9d7dab35c17ca459193156c8da2ee"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.tokenize (cognitive 25): ParseTreePatternMatcher.tokenize 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, 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":"runtime/Swift/Sources/Antlr4/tree/pattern/ParseTreePatternMatcher.swift"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b9d6093826e38e13345b1600ff1609ea0a017d3aa70b7551e9dfa30ea9d9bc"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.execATNWithFullContext (cognitive 25): ParserATNSimulator.execATNWithFullContext has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb85744d1261f52f558527e04cb3b6903e06f6c1a3a935804f0859ec8ec62d88"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.execATNWithFullContext (cognitive 25): ParserATNSimulator.execATNWithFullContext has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d80a5fe29e6dae97e05b9a078162078ee767971075056f34bef437e3e0ac0e"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleDependencyChecker.GetRuleVersions (cognitive 24): RuleDependencyChecker.GetRuleVersions has cognitive complexity 24 (threshold 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":"runtime/CSharp/src/Misc/RuleDependencyChecker.cs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28ea9d977ea69df0faec3684a815845b32386151d8cdec884921580168f9208"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule (cognitive 24): ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 8, loops 2 (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":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"404fe1f6c53cc7547277438d8777230956616363a0298a662f80849ec71c233e"}},{"ruleId":"D2","level":"warning","message":{"text":"ListTokenSource.Line.get (cognitive 23): ListTokenSource.Line.get has cognitive complexity 23 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/ListTokenSource.cs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ed34eb926d25dad9c1e0a72352988ae7e0d7ca901e26779c76f2548ef3ee3d"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.ToString (cognitive 23): IntervalSet.ToString has cognitive complexity 23 (threshold 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":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bc1cf6afdcedb8cc16fe7867620ae2c4cd88d86fe7965e513cd7669a067a10"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNFactory.createLexerAction (cognitive 23): LexerATNFactory.createLexerAction has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 7 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/automata/LexerATNFactory.java"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef05c2c292e442757228666541a7118a944a24b84035c85b1723d12f420c7a1"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleFunction.getDeclsForAllElements (cognitive 23): RuleFunction.getDeclsForAllElements has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (6 pts), boolean chains 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":"tool/src/org/antlr/v4/codegen/model/RuleFunction.java"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"644a995c41b486839c367a74bcd127984e186c590ebe49944a67acad74e9915e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopeParser.parseAttributeDef (cognitive 23): ScopeParser.parseAttributeDef has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (8 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":"tool/src/org/antlr/v4/parse/ScopeParser.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9089c3b516a386e17b4ec7d299e66aed76a721f5e1987e52052095d18589b882"}},{"ruleId":"D2","level":"warning","message":{"text":"Array2DHashSet.containsAll (cognitive 23): Array2DHashSet.containsAll has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (7 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":"runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca073466f68c166bb0db92d967a8eaa591a7a45dc6552d77400c4e92e1911d3"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.and (cognitive 23): IntervalSet.and has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff96275c2cd96f13783c7d9f21c1aed7abd8485dc49d1c8861a89abfba9a2642"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.closureCheckingStopState (cognitive 23): ParserATNSimulator.closureCheckingStopState has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 1 (3 pts) (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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac19adb5fd745572ff90f6fbc0cdeaf160b742f0e38c1f2a97b865a78bc892c"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.String (cognitive 23): PredictionContext.String has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/prediction_context.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19d4160d5a6adea7d1e9e14d14975c5300b377eab1b36dcef48f458f39c5a43"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.deserialize (cognitive 23): ATNDeserializer.deserialize has cognitive complexity 23 (threshold 15). Drivers by points: loops 10 (12 pts), if/else 8 (11 pts) (nesting depth added 5). 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":"runtime/Swift/Sources/Antlr4/atn/ATNDeserializer.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5fb6fdac654af15a44610b20eed0d66a96df28a2b0945addaa3a0a940583c1"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.subtract (cognitive 23): IntervalSet.subtract has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/interval_set.dart"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f4070c4944d4e5f084d19e07fd954dfc4ab3ec51a91b0c0dadc208609db599"}},{"ruleId":"D2","level":"warning","message":{"text":"GrammarDependencies.analyse (cognitive 22): GrammarDependencies.analyse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (6 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":"antlr4-maven-plugin/src/main/java/org/antlr/mojo/antlr4/GrammarDependencies.java"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb05019b17683e055e0a83552fca4414d1e6d34121234169e74d950ff909f83"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNFactory.elemList (cognitive 22): ParserATNFactory.elemList has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, 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":"tool/src/org/antlr/v4/automata/ParserATNFactory.java"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec47b1b097557206b857fd501b57d9d73e6aaaedfa8ca944221e49fd4a82197"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.interp (cognitive 22): Interpreter.interp has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), error handling 1 (2 pts), loops 1 (2 pts), ternaries 2, boolean chains 1 (nesting depth added 4). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/gui/Interpreter.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"482660497b76556389d8d59f23ec93ac47acb9dd17248c32b4d2654981bb8fd8"}},{"ruleId":"D2","level":"warning","message":{"text":"LeftRecursiveRule.getAltLabels (cognitive 22): LeftRecursiveRule.getAltLabels has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 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":"tool/src/org/antlr/v4/tool/LeftRecursiveRule.java"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"383da33af0caf6249deebcd4012f1c2f8b7313c07089d909d9b0bad7a242605a"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.execATNWithFullContext (cognitive 22): ParserATNSimulator.execATNWithFullContext has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, 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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de2ca9d91990dea68a5be2a2d2486247aa01f13b00629867f0d19b584ee2d29"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.subtract (cognitive 22): IntervalSet.subtract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, 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":"runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec981afa37d0c44ff8fb52471bec5cc473139a3a02132b6b2b265e781b77fcaa"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseLexer.NextToken (cognitive 22): BaseLexer.NextToken has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 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":"runtime/Go/antlr/v4/lexer.go"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbab0935c59e978bcb9ac98f4f66a6c7035260cb9aa23d06d94df4406926f908"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule (cognitive 22): ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 2 (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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2193977a1a825dc6028ab58774d87a854fe86ffa4a3854b781bc5d505f1782f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.consume (cognitive 22): Parser.consume has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/Parser.swift"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c34d814cefbf86d477fb914a5341b6661bf439c537070ccbfa8863f66fecbe5"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.verifyATN (cognitive 22): ATNDeserializer.verifyATN has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 3, 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":"runtime/JavaScript/src/antlr4/atn/ATNDeserializer.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b39be6cbced0590ac9ba9bd710a30af8f946e1ece217e48df55e7e34151293"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.ApplyPrecedenceFilter (cognitive 21): ParserATNSimulator.ApplyPrecedenceFilter has cognitive complexity 21 (threshold 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3728e70bb59eaa11b9e3564ff316554890024b62fcc2f4923394953a761b985"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.Consume (cognitive 21): Parser.Consume has cognitive complexity 21 (threshold 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":"runtime/CSharp/src/Parser.cs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"06683be6248e0b9240ade4af1b75d4bf8311b7511bdd738d67b90f9fba2898bd"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenStreamRewriter.GetText (cognitive 21): TokenStreamRewriter.GetText has cognitive complexity 21 (threshold 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":"runtime/CSharp/src/TokenStreamRewriter.cs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6aff8ecb201eb780da219e247401b85ad2155e33e07669a0047a569954cbbc6"}},{"ruleId":"D2","level":"warning","message":{"text":"Trees.GetNodeText (cognitive 21): Trees.GetNodeText has cognitive complexity 21 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Trees.cs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b816f1064e42a834288f036db5d4368107556da9cb703d9486c828009982690"}},{"ruleId":"D2","level":"warning","message":{"text":"TailEpsilonRemover.visitState (cognitive 21): TailEpsilonRemover.visitState has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3 (nesting depth added 11). 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":"tool/src/org/antlr/v4/automata/TailEpsilonRemover.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72e0a9927bf899846f2f390b17e2ef91bf6f2590e38ee955ea2328061ff4752"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildDependencyGenerator.getGeneratedFileList (cognitive 21): BuildDependencyGenerator.getGeneratedFileList has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 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":"tool/src/org/antlr/v4/tool/BuildDependencyGenerator.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c9a4f796afa0284634396383f8fe3435ba02f49001709f8bd948240967fd62"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool.sortGrammarByTokenVocab (cognitive 21): Tool.sortGrammarByTokenVocab has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/Tool.java"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cbc1a34855a20c2a00449d8ba633e0348ceb403eee8cef5685654e31716596"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.consume (cognitive 21): Parser.consume has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/Parser.java"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb13f6bc2f3416899250e136bacdfece0cb952b32419c2d1c3eb51b790889c0"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseParser.Consume (cognitive 21): BaseParser.Consume has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/parser.go"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b61d8fc9e627e4aca9523e9369ded83b1c9faf71cbd88456a3050f631fd2114"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.getReachableConfigSet (cognitive 21): LexerATNSimulator.getReachableConfigSet has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 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":"runtime/Swift/Sources/Antlr4/atn/LexerATNSimulator.swift"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdf50606ad38e804df44971d69a753da60eb1274469721220fd55fe6e7bf19a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.consume (cognitive 21): Parser.consume has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/parser.dart"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be99c1d6b46b9765bb95e50721ddbd062a5b67349a95dcbf273b847a73b4e38"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenStreamRewriter.getText (cognitive 21): TokenStreamRewriter.getText has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (3 pts), boolean chains 2 (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":"runtime/JavaScript/src/antlr4/TokenStreamRewriter.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fca712544ff773399456ddaf7085d81427a46fa387096761c62b51f449f129"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.NextToken (cognitive 20): Lexer.NextToken has cognitive complexity 20 (threshold 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":"runtime/CSharp/src/Lexer.cs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c258a45270c0bda7a805cfe44dc4d1f3b90bd0bfb6758d21294d46d8afe0476"}},{"ruleId":"D2","level":"warning","message":{"text":"Utils.EscapeWhitespace (cognitive 20): Utils.EscapeWhitespace has cognitive complexity 20 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/Utils.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"971c52a36105cff72739d6c08a4ace9e455bd2ad2378c0ce7f6a204228043a11"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleFunction.addContextGetters (cognitive 20): RuleFunction.addContextGetters has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 3 (6 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":"tool/src/org/antlr/v4/codegen/model/RuleFunction.java"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba9d20f41b0ddff73bb9ab713108a647affaa666aa44ea63f8239ef11580dbe"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticPipeline.assignLexerTokenTypes (cognitive 20): SemanticPipeline.assignLexerTokenTypes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 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":"tool/src/org/antlr/v4/semantics/SemanticPipeline.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a243c55cc83aabb6cd9adf4fc6e93a2df8bc94ee7a2f405f8502dd362ddede8"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNSerializer.addEdges (cognitive 20): ATNSerializer.addEdges has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/ATNSerializer.java"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3181d56541c75c69f68720377a1717362b54fe733cefd305e51ed94375dfe6ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule (cognitive 20): ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 2 (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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f89011fd7ad39af2a078a72b3a8debf4f0d8909580cc99edbb0409e23d87ad"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.tokenize (cognitive 20): ParseTreePatternMatcher.tokenize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 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":"runtime/Java/src/org/antlr/v4/runtime/tree/pattern/ParseTreePatternMatcher.java"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4ebe6b0b932f2baa52b85d177ed722f69cbb43c1ea429b57f0d11b250dd3e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer.nextToken (cognitive 20): Lexer.nextToken has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/Lexer.java"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8afd0878443702e3d8d22a6aaf951d08070118dccfc3aee7e7f5211ff305e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.execATNWithFullContext (cognitive 20): ParserATNSimulator.execATNWithFullContext has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, 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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"067a1dd5bfe1e9d2163b7f3b0955e1c0963190d0ee1713b737f1e0db0226c520"}},{"ruleId":"D2","level":"warning","message":{"text":"XPath.getXPathElement (cognitive 20): XPath.getXPathElement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 4 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/xpath/XPath.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ca38a49022b5309471f881c02a989da8788715ff4b01a7474c738e4beb3e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.getEpsilonTarget (cognitive 20): LexerATNSimulator.getEpsilonTarget has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2 (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":"runtime/Go/antlr/v4/lexer_atn_simulator.go"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fe40aca0e2fdaba39b3d4bd30166e8ca9e3a6f2dd1bcbf0782eda7d76c9542"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseParserRuleContext.String (cognitive 20): BaseParserRuleContext.String has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 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":"runtime/Go/antlr/v4/parser_rule_context.go"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"046ea329767436fdc5bbfd0b9617265aa4a3ee7b83eaeced4a5653c919e75b36"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserInterpreter.visitState (cognitive 20): ParserInterpreter.visitState has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, match/switch 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":"runtime/Swift/Sources/Antlr4/ParserInterpreter.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86315122279598bd485824bbfd50445cf6cb952b4aa5b10d23d7e79c283e0f6"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.deriveEdgesForRuleStopStates (cognitive 20): ATNDeserializer.deriveEdgesForRuleStopStates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/ATNDeserializer.swift"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"76741aab7108977243c9cb7f3b08297222b5919bd8a4a66fe5fbf80d468a8f8e"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.adaptivePredict (cognitive 20): ParserATNSimulator.adaptivePredict has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9c28fa82348e2413fc8baa1dec748050cddd826d370540419e88cf5f8138e5"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.getCachedContext (cognitive 20): PredictionContext.getCachedContext has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (5 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":"runtime/Swift/Sources/Antlr4/atn/PredictionContext.swift"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9f3aa7d361d26da8518ad4b234d96ce246ff5ce183419396c988d8a91d2c95"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.tokenize (cognitive 20): ParseTreePatternMatcher.tokenize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 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":"runtime/Dart/lib/src/tree/src/pattern/parse_tree_match.dart"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95bb731a16a8c6db080c42567817ca258793540fe111e128fa216468f9a0629"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.getEpsilonTarget (cognitive 20): LexerATNSimulator.getEpsilonTarget has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2 (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":"runtime/JavaScript/src/antlr4/atn/LexerATNSimulator.js"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc17506da28ccc54a10ba2d93ae4f7651c62e83e2729c0c9beabdc4e9daad1d"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule (cognitive 20): ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 2 (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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4b06a2fee3570c5d33f7561d2f1470cc76a6f3a1e1a93dec02a1882256a2ad"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.GetReachableConfigSet (cognitive 19): LexerATNSimulator.GetReachableConfigSet has cognitive complexity 19 (threshold 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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"62391664429eabbc1ee0f08b506152cd1b2faad857fd6bd8433074d9a94034c9"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.CanDropLoopEntryEdgeInLeftRecursiveRule (cognitive 19): ParserATNSimulator.CanDropLoopEntryEdgeInLeftRecursiveRule has cognitive complexity 19 (threshold 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ce3f6256cf043f2a64b52090fcfd59fb31fb54b46c7444737be3b7e43d9911"}},{"ruleId":"D2","level":"warning","message":{"text":"GrammarParserInterpreter.visitDecisionState (cognitive 19): GrammarParserInterpreter.visitDecisionState has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 1 (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":"tool/src/org/antlr/v4/tool/GrammarParserInterpreter.java"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1506da5d395e3042de4b9d918d47690b26091e7d7a1b3673f67c2658a89efe"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.getReachableConfigSet (cognitive 19): LexerATNSimulator.getReachableConfigSet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6c14005b964a5bad0ff5309f94593c55a3dfc58ae8d39fe13f7dd7b0f05fda"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.generateRuleBypassTransition (cognitive 19): ATNDeserializer.generateRuleBypassTransition has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (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":"runtime/Python3/src/antlr4/atn/ATNDeserializer.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24472f9782e6c6e27530fa9d46b70da623a901e9cdce8a21d4814f2970c4ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.getReachableConfigSet (cognitive 19): LexerATNSimulator.getReachableConfigSet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/atn/LexerATNSimulator.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"465ba12013f7ce8d434274958e5086b17aa263cbd736127c5439b258c89532e4"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule (cognitive 19): ParserATNSimulator.canDropLoopEntryEdgeInLeftRecursiveRule has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 2 (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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"721ac232737d46d6b78dfc11e99abd9c934584b5a8bd700f2644e7bd55dc530e"}},{"ruleId":"D2","level":"warning","message":{"text":"ParseTreePatternMatcher.tokenize (cognitive 19): ParseTreePatternMatcher.tokenize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 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":"runtime/Python3/src/antlr4/tree/ParseTreePatternMatcher.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"033ed9878686f8e839e26c3cf2327a1d822fbb8544cf93003bebff774573b2c2"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.generateRuleBypassTransition (cognitive 19): ATNDeserializer.generateRuleBypassTransition has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (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":"runtime/Go/antlr/v4/atn_deserializer.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b1a7b8f6ce3a5e9cc5c9fe8a6297c007fb4d424ace2f4889055d1c60990150"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.addInterval (cognitive 19): IntervalSet.addInterval has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 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":"runtime/Go/antlr/v4/interval_set.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee6750872fbfed8e3d8fcc1069cc028c33930219c027dcce3ef2792a70431b9"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.getReachableConfigSet (cognitive 19): LexerATNSimulator.getReachableConfigSet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/lexer_atn_simulator.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e35244579a51717c7df41c7dfc10860651db6dd06e6b54cf89faf596a7e1462"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerAction.swift.== (cognitive 19): LexerAction.swift.== has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, boolean chains 9. 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/LexerAction.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"460b78fb8f7f0a7106e6b6e160d4278e525c3988da51c16ed64d8ef7986d20f0"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.getReachableConfigSet (cognitive 19): LexerATNSimulator.getReachableConfigSet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/atn/src/lexer_atn_simulator.dart"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f72f44ea4648b7f4cdcbdebdd4a1a9416074d0f528f82738e8ba354049d60dc"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContextUtils.getCachedPredictionContext (cognitive 19): PredictionContextUtils.getCachedPredictionContext has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (5 pts), boolean chains 2 (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":"runtime/JavaScript/src/antlr4/context/PredictionContextUtils.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b201be101d779762edccf42c5a483ac106cd1b0cbd901aaa998be4299eb8090"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.generateRuleBypassTransition (cognitive 19): ATNDeserializer.generateRuleBypassTransition has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (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":"runtime/JavaScript/src/antlr4/atn/ATNDeserializer.js"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b883ea3264044e897d64734a78f467659f47272fe13adaf76773c71f2cdccfe"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.getReachableConfigSet (cognitive 19): LexerATNSimulator.getReachableConfigSet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/LexerATNSimulator.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00383ee81527890386e9476c6b7b836a496b09a80acf480a2a2359284570614"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.TestTailCall (cognitive 18): ATNDeserializer.TestTailCall has cognitive complexity 18 (threshold 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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e18ab79f56c7c53a6af4a0f0b164a992df4f25e040a15129b881593a3df33ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.EvalSemanticContext (cognitive 18): ParserATNSimulator.EvalSemanticContext has cognitive complexity 18 (threshold 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63e2a8df9c47c90b4b94c528a2905ef20d2455ef997100ad7397cfd1f66b607"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.GetCachedContext (cognitive 18): PredictionContext.GetCachedContext has cognitive complexity 18 (threshold 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":"runtime/CSharp/src/Atn/PredictionContext.cs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d3ed97de8044305b14bb1272dc18c5ce78ba10bd07d2d20c416276f8f9c95d"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.Add (cognitive 18): IntervalSet.Add has cognitive complexity 18 (threshold 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":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4738db6071e2d3262c66abb4efedf4548f66aea68d065f350b17d3eb9843e71c"}},{"ruleId":"D2","level":"warning","message":{"text":"LeftRecursiveRuleTransformer.translateLeftRecursiveRules (cognitive 18): LeftRecursiveRuleTransformer.translateLeftRecursiveRules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/analysis/LeftRecursiveRuleTransformer.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30cf8b64c136fb6c70f885d553aee0d1e77619c67376c5204ee35e3ee1d3df8"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNFactory.set (cognitive 18): LexerATNFactory.set has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), 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":"tool/src/org/antlr/v4/automata/LexerATNFactory.java"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d667125288c29ee3ffab7d82825194215691aa96ccd069d380e46a220c2d8f"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopeParser._parsePrefixDecl (cognitive 18): ScopeParser._parsePrefixDecl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/parse/ScopeParser.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb2a14ad5d1982cb31841d522f7dd3aeac68253b1669c01fb6a8c3128065b58"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNSerializer.serializeSets (cognitive 18): ATNSerializer.serializeSets has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), ternaries 1 (2 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":"runtime/Java/src/org/antlr/v4/runtime/atn/ATNSerializer.java"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd02ae17874e89b5b1aa9659a7de50f89f0624177b3c32cfb5abbdee4bc23fd1"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.evalSemanticContext (cognitive 18): ParserATNSimulator.evalSemanticContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, 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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc665c455831249b7143d9ef0a5c731157315257a90443d8f7e20e711150e6b"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.getCachedContext (cognitive 18): PredictionContext.getCachedContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/PredictionContext.java"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71ae58e488d0072113821b4572c49b3c2d463bd4658c9f7f4d0e76f117d85d2"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.add (cognitive 18): IntervalSet.add has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 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":"runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9892627b1552337188c5a77132ec84bcc8ace23ca9b8d68b15d3db39af149d93"}},{"ruleId":"D2","level":"warning","message":{"text":"IterativeParseTreeWalker.walk (cognitive 18): IterativeParseTreeWalker.walk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 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":"runtime/Java/src/org/antlr/v4/runtime/tree/IterativeParseTreeWalker.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"993c315100060d63515b19d229546d373d2826962f3854f8835ba741741dd6f1"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenStreamRewriter.getText (cognitive 18): TokenStreamRewriter.getText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), boolean chains 2 (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":"runtime/Java/src/org/antlr/v4/runtime/TokenStreamRewriter.java"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8239a2f3f2b3be8bc0c386772e4afdcdf9430484ae8fffbcfa38eb7d41514bf3"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.evalSemanticContext (cognitive 18): ParserATNSimulator.evalSemanticContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, 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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab64967552893f05ef3f8ecf0d275902e617a2a7466aa8786cfcb176a6d2772"}},{"ruleId":"D2","level":"warning","message":{"text":"antlr.getCachedBasePredictionContext (cognitive 18): antlr.getCachedBasePredictionContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/prediction_context.go"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc7f60393b3c22a02683980fe87cdddc63247f1e04ba20e570c0e3127c976e7"}},{"ruleId":"D2","level":"warning","message":{"text":"JMap.Put (cognitive 18): JMap.Put has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/jcollect.go"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd9414f46312b0b4a8bffcfc141bb6def89d666f7f04d04ada374a056bcc9c5"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.evalSemanticContext (cognitive 18): ParserATNSimulator.evalSemanticContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, 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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce227a09d0563104174b9a973b659ea44ce0ff219ae61f36954efd94ff356397"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenStreamRewriter.getText (cognitive 18): TokenStreamRewriter.getText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), boolean chains 2 (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":"runtime/Swift/Sources/Antlr4/TokenStreamRewriter.swift"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a13501564702ea9db3fce8f81605609d0fc3605d991e8b534cf3fea186639e8"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.evalSemanticContext (cognitive 18): ParserATNSimulator.evalSemanticContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, 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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d13cbc94bdb5f2f6f751a0a84f519417f568ee78260ea940d675329219b4934"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.add (cognitive 18): IntervalSet.add has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 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":"runtime/Swift/Sources/Antlr4/misc/IntervalSet.swift"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6015f72f5a7e54b61cb4cef66581f6e45b846b50edb29067521b96eb4fb1f460"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.evalSemanticContext (cognitive 18): ParserATNSimulator.evalSemanticContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, 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":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"de498ce9768e2ab83dfc96ae95d34a2ea93ddad7506470b4707b48e2012c6624"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.add (cognitive 18): IntervalSet.add has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 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":"runtime/Dart/lib/src/interval_set.dart"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"904c3349b7d0e0e0b6c0900204019f6b861d24b0e98fe1e817e3a8da5c1d2c74"}},{"ruleId":"D2","level":"warning","message":{"text":"PredictionContext.getCachedContext (cognitive 18): PredictionContext.getCachedContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/prediction_context.dart"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d20b5f7b6ddd60a76f2ec2acd4bf5d176adeab43f244cbb13db0493f56b7b32"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleContext.toString (cognitive 18): RuleContext.toString has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, ternaries 1 (3 pts), 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":"runtime/JavaScript/src/antlr4/context/RuleContext.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc84598f7198eb89c7761b5e0680e7a8e68c5a279807d68e11b621f4a12d510"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.applyPrecedenceFilter (cognitive 18): ParserATNSimulator.applyPrecedenceFilter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfbb5b46213ba1d52b32aba86c4fb6808a4f03563d5d353ea7b02e9e076a1cf"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.evalSemanticContext (cognitive 18): ParserATNSimulator.evalSemanticContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, 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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cc65b8b2a4847d665ddf017663b3d24536a8836294e1a8135fad175bb36745"}},{"ruleId":"D2","level":"warning","message":{"text":"ListTokenSource.Column.get (cognitive 17): ListTokenSource.Column.get has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/ListTokenSource.cs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1006f0e1c57c10c416449259b49bee825bd1b0938c606bc5f97b28cf85e30d5f"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.ToString (cognitive 17): IntervalSet.ToString has cognitive complexity 17 (threshold 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":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"feae72b3c167ea395e0efc99b6663cf5425c09fffa4ea45d536d33e362ab9992"}},{"ruleId":"D2","level":"warning","message":{"text":"Antlr4Mojo.execute (cognitive 17): Antlr4Mojo.execute has cognitive complexity 17 (threshold 15). Drivers by points: error handling 4 (6 pts), if/else 5 (6 pts), loops 3 (5 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":"antlr4-maven-plugin/src/main/java/org/antlr/mojo/antlr4/Antlr4Mojo.java"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1a8d223e6b83fc1d56f33ab1c8baaee36d1c5ec2a636276766cf7919232cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNFactory.getSetFromCharSetLiteral (cognitive 17): LexerATNFactory.getSetFromCharSetLiteral has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/automata/LexerATNFactory.java"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4d474ee85aaedb901afd7ee731d8466b38290af03e2b5a684e0c35ce184654"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.applyPrecedenceFilter (cognitive 17): ParserATNSimulator.applyPrecedenceFilter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c366cd0ae21923e960f75c1459c09f66f9e79f4bc6947fbb62579fba9da12461"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.toString (cognitive 17): IntervalSet.toString has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0431f23c576c82614bad2cc919cc281e2ce30602f48dc03072624dd6539eb05"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserInterpreter.parse (cognitive 17): ParserInterpreter.parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/ParserInterpreter.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7989d17366a7d0a2c8f2b2b072fa08af75ed7b63d40d8ea81a6a4232849d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"XPath.split (cognitive 17): XPath.split has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/xpath/XPath.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3162f7ed0b00309ef2645f963e729381a11b4605a2fd32b05e206fcc1ce285b"}},{"ruleId":"D2","level":"warning","message":{"text":"JStore.Put (cognitive 17): JStore.Put has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/jcollect.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff0f95416b9c1365f89c9f998ec8f9f415077f3f7d5c86a4eefd3a344994f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"JPCMap.Put (cognitive 17): JPCMap.Put has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 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":"runtime/Go/antlr/v4/jcollect.go"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a96e8da1ea4f32f3f70145a66535efdf83663162311592bd015b4884f683e33"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.applyPrecedenceFilter (cognitive 17): ParserATNSimulator.applyPrecedenceFilter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da54203d9fd7a52eb3032b723bba404b776ec74768e00aabee5979c5110743c"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserInterpreter.parse (cognitive 17): ParserInterpreter.parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 1 (3 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/ParserInterpreter.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8f9d40bb495d0399199431a04c02b8f9aa8575eebc71bc386d52e3bf77a41d"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNConfigSet.applyPrecedenceFilter (cognitive 17): ATNConfigSet.applyPrecedenceFilter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/ATNConfigSet.swift"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e55911ab35e0505b23fcb51224629b2955d16aef9f37229672d312b8d7a7a9"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.execATN (cognitive 17): LexerATNSimulator.execATN 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":"runtime/Swift/Sources/Antlr4/atn/LexerATNSimulator.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4fc578074adeff4b2c27d6965070d3d27d6ec819321edf1fcb6d1879ad6420"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.adaptivePredict (cognitive 17): ParserATNSimulator.adaptivePredict has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dc41ae96042073b1885541ff472e7c9b03e93f65a5db9f46b1a6cc68061b6e"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.applyPrecedenceFilter (cognitive 17): ParserATNSimulator.applyPrecedenceFilter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1bab170a570b257f746666dcb0de9fa1a58851f3f4f53221e4a6db9854eed4"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserInterpreter.parse (cognitive 17): ParserInterpreter.parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 1 (3 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/parser_interpreter.dart"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a7acce07dff18daee35af5f0acf92e946afc7a5a5fac7e23d4eed2418f7005"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.ExecATN (cognitive 16): LexerATNSimulator.ExecATN has cognitive complexity 16 (threshold 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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c9c178a5ae3510feb5cfba5354a8afde2cd487c9d5e50912badaf0977cb961"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayEdgeMap.PutAll (cognitive 16): ArrayEdgeMap.PutAll has cognitive complexity 16 (threshold 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":"runtime/CSharp/src/Dfa/ArrayEdgeMap.cs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"101f51efbff39aeac5758171d9e69023952a089fb1c1134bf029932d2d51ffd9"}},{"ruleId":"D2","level":"warning","message":{"text":"DFASerializer.ToString (cognitive 16): DFASerializer.ToString has cognitive complexity 16 (threshold 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":"runtime/CSharp/src/Dfa/DFASerializer.cs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca0b96aa6bc2655c572d6aa4b5625a91616b7ddf64a7826c592af9ed7fe1a4c"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserInterpreter.Parse (cognitive 16): ParserInterpreter.Parse has cognitive complexity 16 (threshold 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":"runtime/CSharp/src/ParserInterpreter.cs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"169d334758943af3b224d9c0f20084d9a595f23f30ad677d4e5b2624f72e1691"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleContext.ToString (cognitive 16): RuleContext.ToString has cognitive complexity 16 (threshold 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":"runtime/CSharp/src/RuleContext.cs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1a06017358b3082249ea4812585ba639e4fd62431ddfb62105c44e249c3a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"Antlr4Mojo.getCommandArguments (cognitive 16): Antlr4Mojo.getCommandArguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, loops 1 (2 pts) (nesting depth added 1). 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antlr4-maven-plugin/src/main/java/org/antlr/mojo/antlr4/Antlr4Mojo.java"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dc6fe00dd25863362c4d7968f03dfbb4da7d0c051e714e1851ce9fab8af957"}},{"ruleId":"D2","level":"warning","message":{"text":"LeftRecursiveRuleAnalyzer.hasImmediateRecursiveRuleRefs (cognitive 16): LeftRecursiveRuleAnalyzer.hasImmediateRecursiveRuleRefs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, 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":"tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91a7b563fede67747a0be683990dd10054221acaec8d6caa260efac54ed6914"}},{"ruleId":"D2","level":"warning","message":{"text":"ScopeParser._parsePostfixDecl (cognitive 16): ScopeParser._parsePostfixDecl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, loops 2, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/parse/ScopeParser.java"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b30098011817f2e954d0e9b5b01e5d2a5a31f265ae82a40aadae617ca2b59d"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenVocabParser.load (cognitive 16): TokenVocabParser.load has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 4 (6 pts), 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":"tool/src/org/antlr/v4/parse/TokenVocabParser.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03a72abaa2482c68ee09b7275feb124cb3deda19949a9c2d23f9c215f3a60b6"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.execATN (cognitive 16): LexerATNSimulator.execATN has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ace77089322754bf055009f48284210f7aea2c3a7a014f70a82860abd7efef"}},{"ruleId":"D2","level":"warning","message":{"text":"Array2DHashSet.expand (cognitive 16): Array2DHashSet.expand has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 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":"runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"50397e3b64c11c0e2a8dfaf51ffb4f9b38f30aab53d703ccaf24d3e6aead960a"}},{"ruleId":"D2","level":"warning","message":{"text":"Array2DHashSet.retainAll (cognitive 16): Array2DHashSet.retainAll has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (5 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":"runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"098b2c68a737014cde90eef6d77c13cb3108452e0133841194a588ff9fc5d2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.toString (cognitive 16): IntervalSet.toString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"72364e88a619ee7bfa72e0d65e17aae880b3c6e89866e634284fb2471881a419"}},{"ruleId":"D2","level":"warning","message":{"text":"XPathLexer.nextToken (cognitive 16): XPathLexer.nextToken has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/tree/xpath/XPathLexer.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e73f443af58a67ab6ca9d598e7e38538d1604c19780fdc4b65a8add602027a"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserInterpreter.parse (cognitive 16): ParserInterpreter.parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 1 (3 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/ParserInterpreter.java"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1f8fac6d2aa856d4504946638f7fb4c478c8f232b6b536129426b7a73053ef"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleContext.toString (cognitive 16): RuleContext.toString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, ternaries 1 (3 pts), 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":"runtime/Java/src/org/antlr/v4/runtime/RuleContext.java"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6205eb7c643adbc6e23c76b99b0c205738fabbdf46b3aaef0d1b56de3170c695"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.consume (cognitive 16): Parser.consume has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/Parser.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b64341195066baf262f18bbb4cf14c78e97dc2fedd89b5728b165abd0c05d9"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserInterpreter.visitState (cognitive 16): ParserInterpreter.visitState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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":"runtime/Python3/src/antlr4/ParserInterpreter.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e11f5ad80143985e95ba14169e6bd2ba1f2954abddceeabb2384b3975e8c8e9"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleContext.toString (cognitive 16): RuleContext.toString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, ternaries 1 (3 pts), 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":"runtime/Python3/src/antlr4/RuleContext.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e14142666289ec90c08c1b627507d70b3ab261f53f8666868d70d568fac9854"}},{"ruleId":"D2","level":"warning","message":{"text":"TokenStreamRewriter.getText (cognitive 16): TokenStreamRewriter.getText has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 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":"runtime/Python3/src/antlr4/TokenStreamRewriter.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfcb00c07efca8c3e6dd6ead1e6c0cc59a23a218a1d57ad6d4b20fd9fe4de9e"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.execATN (cognitive 16): LexerATNSimulator.execATN has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"runtime/Python3/src/antlr4/atn/LexerATNSimulator.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e37b1dcdbde0618a73c30f8ec73025fd2065bb428bea85ddb1d116c79a4bf9"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserATNSimulator.applyPrecedenceFilter (cognitive 16): ParserATNSimulator.applyPrecedenceFilter has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"909d7e726f2d86eff3750544cf2a919b3e7f07784cd8825fb6dec5df299c5c54"}},{"ruleId":"D2","level":"warning","message":{"text":"JPCMap2.Put (cognitive 16): JPCMap2.Put has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/jcollect.go"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfe638f3a8e5880d9206e38de27bc699bd95eeeb5ea4baa9d39a39b417685ed"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.execATN (cognitive 16): LexerATNSimulator.execATN has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"runtime/Go/antlr/v4/lexer_atn_simulator.go"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ea7fbae9e7afc41c797d576a7614b52b94a41b797a64bb6042b828ce1fad4a"}},{"ruleId":"D2","level":"warning","message":{"text":"IterativeParseTreeWalker.Walk (cognitive 16): IterativeParseTreeWalker.Walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), match/switch 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":"runtime/Go/antlr/v4/tree.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f8ce9cf9b0911bfe3c4bdbde3d64f5246454ee4c42f60b4a16e3af5e81efd0"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleContext.toString (cognitive 16): RuleContext.toString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, ternaries 1 (3 pts), 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":"runtime/Swift/Sources/Antlr4/RuleContext.swift"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc2dafbcb305a079cde6c404e1489807f86ffa54e059111fe4fc81a418e0c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"IntervalSet.toString (cognitive 16): IntervalSet.toString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (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":"runtime/Swift/Sources/Antlr4/misc/IntervalSet.swift"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f5eba1c442e777a95be10c96b0df8584ee8ab78b7f4ce21469b9a5a4ad92fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Trees.getNodeText (cognitive 16): Trees.getNodeText has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (16 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":"runtime/Swift/Sources/Antlr4/tree/Trees.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2495b7e9184530dfb5240a84e29919a111ddfb629bda2aee9c6132de97f49daf"}},{"ruleId":"D2","level":"warning","message":{"text":"ATNDeserializer.markPrecedenceDecisions (cognitive 16): ATNDeserializer.markPrecedenceDecisions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (14 pts), boolean chains 1, loops 1 (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":"runtime/Dart/lib/src/atn/src/atn_deserializer.dart"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"8257e9c529611c2441b8dc522c939dbb5ff3c6bcddf13595e3fee81f26f1313f"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserInterpreter.visitState (cognitive 16): ParserInterpreter.visitState has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 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":"runtime/Dart/lib/src/parser_interpreter.dart"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9125842a6681e1e102880af2a8bfdab529d415560d5da166b7647a62edcdf2be"}},{"ruleId":"D2","level":"warning","message":{"text":"RuleContext.toString (cognitive 16): RuleContext.toString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, ternaries 1 (3 pts), 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":"runtime/Dart/lib/src/rule_context.dart"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"764c4bc83ae443570ebe9937bcac9f99e6ce8c7481e4c80b8e505fea4fd0d64d"}},{"ruleId":"D2","level":"warning","message":{"text":"LexerATNSimulator.execATN (cognitive 16): LexerATNSimulator.execATN has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"runtime/JavaScript/src/antlr4/atn/LexerATNSimulator.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b930d278e1d50af8ffe34ddb22b8368edeb4ea769295274a32843c2200922f2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Grammar: TooManyMethods \u2014 85 methods. The bar is 30 methods; this is 55 over it, 2.83\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":"tool/src/org/antlr/v4/tool/Grammar.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f985bf28e9e83b9cb99f3bb30ad87328c9017b010e46818d805afc8b2f6066ca"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.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":"runtime/Java/src/org/antlr/v4/runtime/Parser.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbae13d2dfc442e4b82d3d5eccd19e87c2be5a7456993ec27225510755cb099a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser_atn_simulator.dart: FileTooLong \u2014 1009 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 509 over it, 2.02\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":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fb22f8309c5fb795dac1da0123a9b5c34f3f47567146d9b5d0a24bd6855006"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\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":"runtime/Swift/Sources/Antlr4/Parser.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4213c1710989ac8e3e8c6cc1a452b56c789daf59eb8c761246fc886db87a368"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ParserATNSimulator: ClassTooLong \u2014 764 significant lines (blank, comment-only and punctuation-only lines excluded), 48 methods. The bar is 400 significant lines; this is 364 over it, 1.91\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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"473f14d6071dfdc13848e0242b20e3c501bca795096c39146267908d52727f3a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ParserATNSimulator: ClassTooLong \u2014 726 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods, 44 blocks, lines 35-1666. The bar is 400 significant lines; this is 326 over it, 1.82\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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e171c3c79cc28183b95fafaae67f3bdfd0c6515df41d30e5d0cb4bd9c982ce2f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ATNDeserializer.deserialize: MethodTooLong \u2014 deserialize runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/ATNDeserializer.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0438cf6905971db9881e10c5b3dbd52a9539762b134bbbe1feee5884729ca8bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TreeViewer: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\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":"tool/src/org/antlr/v4/gui/TreeViewer.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b6dbd43f602facc59af9f9ca5b39625a310fc7d55456e72779598cea680ae6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\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":"runtime/Dart/lib/src/parser.dart"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc4b70123101f4826f791ba5358efc3e7e160db5f810758504a50d059c4bd0d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParserATNSimulator: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea79438ff2878a442a4d144e0eb86216a190462e4af1f6a083df6c679d7b82f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Grammar: ClassTooLong \u2014 639 significant lines (blank, comment-only and punctuation-only lines excluded), 85 methods. The bar is 400 significant lines; this is 239 over it, 1.60\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":"tool/src/org/antlr/v4/tool/Grammar.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43566e7371ae470708c595d5dfc0f75b549704688abb286f763d086f7bebd75"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParserATNSimulator: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f436c573586b0cda3a5f3f40deb6fbca48923cd0a642b9ae1086c9abf0782202"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: atn/ParserATNSimulator.java: FileTooLong \u2014 776 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: ParserATNSimulator (250-2189). The bar is 500 significant lines; this is 276 over it, 1.55\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc4a936619b73ee2c3b00085a615f35cea88d01539ccc6232c794fac10ac281"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BaseParser: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\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":"runtime/Go/antlr/v4/parser.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf2c9d4a6f30a735742d29ddaf6ff333b7252a002b9b6daf1fffd0f9a59be3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Atn/ParserATNSimulator.cs: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 257 over it, 1.51\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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0f11d19197d877e1fd604bd1bb593fad6bcf4dfa38d9dd353cfe74a30e0daf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: v4/parser_atn_simulator.go: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: ParserATNSimulator (44 blocks, 35-1666). The bar is 500 significant lines; this is 257 over it, 1.51\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9315577ef888a0c3b983494a4a11ddd5e6fd6c2a7e5f326e4a06c20818e7ac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParserATNSimulator: TooManyMethods \u2014 751 significant lines (blank, comment-only and punctuation-only lines excluded), 45 methods. The bar is 30 methods; this is 15 over it, 1.50\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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdf96e8160ffda24aea7dcbd75c17dab1aaf76a97ce2e8c8215657f30e224c7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ATNDeserializer: ClassTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 191 over it, 1.48\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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"642619c3408abc32dca6f153114f04fbd6b6a2b7fdc65a8e96997e4bc5f34283"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: atn/ParserATNSimulator.js: FileTooLong \u2014 723 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 223 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"705d1dccf8f3c995f9c16aded735ec0255b52d2f85c29e6275e13af542825551"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParserATNSimulator: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32fde546298ebe5eb7a186d9fd927efacb0de8e655c4134a668c8bf67e9ac6b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParserATNFactory: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/automata/ParserATNFactory.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c718e68621e01fb75360dae0c8fdd422efb1da94af3208fdf1756b1d9788dbbd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParserATNSimulator: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada14ecd1b923067082dea34e6e1b7f5c79751e3f298b6da5fe25e1cf9417285"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\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":"runtime/Python3/src/antlr4/Parser.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa02d4f0a53b5856858f33f3319b4a0038193a3bf4a26a70a26a480021d79f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: atn/ParserATNSimulator.swift: FileTooLong \u2014 697 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 197 over it, 1.39\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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"911e0b47b985f143a54ee1ec1700520c46eb993654259e91cffd02b523315dec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: atn/ParserATNSimulator.py: FileTooLong \u2014 695 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 195 over it, 1.39\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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8583cb7462a8c254a412bab344869411281cfd61ca3f336fba61dfb0e88e610b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnicodeDataTemplateController.addTR35ExtendedPictographicPropertyCodesToCodePointRanges: MethodTooLong \u2014 addTR35ExtendedPictographicPropertyCodesToCodePointRanges runs 138 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/unicode/UnicodeDataTemplateController.java"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9e4294f27baf8e236fed683d1b47993855651ec03a3cba9ea77df694cba721"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParserATNSimulator: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca681516c2dafcba25904079fba1f71c4c47b39f809a10db45cc74bd40905751"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BasicSemanticChecks: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"tool/src/org/antlr/v4/semantics/BasicSemanticChecks.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b640b2334fca5108d9c7a6dc38d6e17738e4e5af44cf4a704638a1a68663ae1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParserATNSimulator: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73486c4a480f29da5bfbb114872c2a1027842c32ebb39f433569f4e3003b096"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tool/Grammar.java: FileTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded), about 94% of them inside a single declaration: Grammar (52-1367). The bar is 500 significant lines; this is 181 over it, 1.36\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/tool/Grammar.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bcff1c292dcf3e7dea9ab0b6d8290c7d9b09188d2f7b59626934d7a95328d3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lexer: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/Lexer.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0658b1c1a9ba4adf2a7e9802c8102c7acc8d15bdf66da1027d4d21893d98ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lexer: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/Lexer.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b1806f23f04ac35e1099be5a87e6d68b3606bf37390d27fbdf60409ec5d381"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/Parser.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cef40e221aa028287ecbb905fc8d9133a445e262e2933971230b8632e26a47c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Tool: ClassTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 130 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/Tool.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e968ea26dc9ad1782bb7e47d0ff886cc5865a4a7ea4b77f138a3e05ca3b3a18c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LexerATNFactory: ClassTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded), 32 methods. The bar is 400 significant lines; this is 121 over it, 1.30\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":"tool/src/org/antlr/v4/automata/LexerATNFactory.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4add3cd35a66bd1876258c76e0aa5e61634e078f3a9dd7876c767e85902f65d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IntervalSet: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\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":"runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a537569aa8d5245d8a366dab0d3bed54ab1a54fef5d7d19672d04c2553be6d52"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BitSet: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\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":"runtime/Swift/Sources/Antlr4/misc/BitSet.swift"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5a313844883ebfab5de70c1cd9dac654b251080f58ce338a55e74eb05a5ae1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tool: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\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":"tool/src/org/antlr/v4/Tool.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"337ab3ac337cbf98193b5dacd6fc9dc84979470ce3dd78db9fcae6799f82e77e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TokenStreamRewriter: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\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":"runtime/Java/src/org/antlr/v4/runtime/TokenStreamRewriter.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad10e453dd06973c088d8cb1ff507811de07abaa9008719d2f9a5abf33bc632"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IntervalSet: TooManyMethods \u2014 384 significant lines (blank, comment-only and punctuation-only lines excluded), 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":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb30ecb909c524c9a96c94e05029ffe9186333089b5843db89fb1d97bb07717"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 379 significant lines (blank, comment-only and punctuation-only lines excluded), 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":"runtime/CSharp/src/Parser.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2c486c8d7d1e590be53dda1eca56f96707c6277a387b9de7dde3d644e6719d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BaseParserRuleContext: 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":"runtime/Go/antlr/v4/parser_rule_context.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"daca090efe489baa8982e605cea32e99121d0d85c09b3119efaf7161aa5eaecf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BufferedTokenStream: 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":"runtime/Java/src/org/antlr/v4/runtime/BufferedTokenStream.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6562af88a7f1db756e075a97467c63232b42c93f6dc1589820d78576170edfa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TreeViewer: ClassTooLong \u2014 493 significant lines (blank, comment-only and punctuation-only lines excluded), 52 methods. The bar is 400 significant lines; this is 93 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":"tool/src/org/antlr/v4/gui/TreeViewer.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce31b60e78a5fe24d84d557239a24caa211137c58aaa076bb5f5011b667e128a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Atn/ATNDeserializer.cs: FileTooLong \u2014 598 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 98 over it, 1.20\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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f153ab4422ea2956365dc9655233212dc8a82ea4923317ef69bf7c47008f869b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TokenStreamRewriter: TooManyMethods \u2014 196 significant lines (blank, comment-only and punctuation-only lines excluded), 35 methods. The bar is 30 methods; this is 5 over it, 1.17\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":"runtime/CSharp/src/TokenStreamRewriter.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe5992f8254b57c2fc4382b82e7c0e3aa26bdd5fbfb43959034409cc331c680"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BufferedTokenStream: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\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":"runtime/Swift/Sources/Antlr4/BufferedTokenStream.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c453d6238f63b95c1867fdc29cad5489d486374abc362651ee7c1f0e98a9e4f9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TokenStreamRewriter: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\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":"runtime/Swift/Sources/Antlr4/TokenStreamRewriter.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d88027a20536b14191673a5909341c02f4729a2f4aa8df94f79458466ec456"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: v4/Tool.java: FileTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: Tool (62-969). The bar is 500 significant lines; this is 82 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/Tool.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f30c4bc5d98b348627dc9daa4bb398a949f165ee0890c8a68f9eacf2dbb9375"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ATNDeserializer.deserialize: MethodTooLong \u2014 deserialize runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/ATNDeserializer.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9514c82f68ebe1a6c820a3e6719a28b61cc8a42ce88e6580f6994540536dd3e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BufferedTokenStream: TooManyMethods \u2014 230 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 30 methods; this is 3 over it, 1.10\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":"runtime/CSharp/src/BufferedTokenStream.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6006b964be99e433b5c6df396eea7e138f84ac7695fb8abea0a478027509023d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BaseLexer: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\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":"runtime/Go/antlr/v4/lexer.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd75cb77ee1c6f26ff6175c3cafd84e1b44e2c150ec5373f806c34b007977f91"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IntervalSet: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\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":"runtime/Swift/Sources/Antlr4/misc/IntervalSet.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"357f0777f13cd131416bcbcb61d35671cbdee98690863fc33a9db4ee66752031"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: automata/LexerATNFactory.java: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: LexerATNFactory (38-817). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/automata/LexerATNFactory.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c21f879997479128b69ae5cc36165e9d492a8dfcaf5b70d0a2d8c9ff9e9358"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gui/TreeViewer.java: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: TreeViewer (53-862). The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/gui/TreeViewer.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db19c19d95800c499181891c787c5ad028ff966fb7f2125277cd86bf8233aa51"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CommonTokenStream: 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":"runtime/Go/antlr/v4/common_token_stream.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0485bab17c0d3c71549fb231d19f7717f7a8cf382cf19f341acb943170c2cc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LexerATNFactory: 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":"tool/src/org/antlr/v4/automata/LexerATNFactory.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ae76b4981f1a1033f674d5d687860ebcaa4e7f899c3fd010c70b4896a30911"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IntervalSet: 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":"runtime/Dart/lib/src/interval_set.dart"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34030bf144f14625e80f3706a1ae0a4409d1e122d348117b675dcc223012bff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lexer: 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":"runtime/Dart/lib/src/lexer.dart"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"350434abce5ff90340aa00f3e33dd6865431aa7c8f32de72b247bd1d1ccb656b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BufferedTokenStream: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/token_stream.dart"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6a199822b2e7c87dea4d3303d77aa70219118c0d0b76f8c528aa8f3914d52c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ParserATNFactory: ClassTooLong \u2014 405 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 5 over it, 1.01\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":"tool/src/org/antlr/v4/automata/ParserATNFactory.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6436dee5751135c15dfc760fa37e3d3b5abfa2ca168d23d2c336fde8fa69cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (116 corresponding lines): runtime/CSharp/src/Atn/PredictionContext.cs:230-353 | runtime/Java/src/org/antlr/v4/runtime/atn/PredictionContext.java:350-465 \u2014 These two members are one piece of code written twice and then edited apart: 116 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":"runtime/CSharp/src/Atn/PredictionContext.cs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"db25e4e1ee2bb9ddff4b16fa0e18155812ec8a3889a25fa9633aa7aa19093c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (104 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:421-538 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:416-519 \u2014 These two members are one piece of code written twice and then edited apart: 104 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eb51a245eb961138029bbd6c214f8594f705e331ec416c6ac5836f6d44e024"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (132 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:787-932 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:749-880 \u2014 These two members are one piece of code written twice and then edited apart: 132 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd31a88c38c06252592c849bcfb6c3bef1a5bda0c2580bd8648022aa3759b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (119 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:657-784 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:627-745 \u2014 These two members are one piece of code written twice and then edited apart: 119 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95180fae6d0a3bee402049a4725d624f27de2138e087e79c45b37c377ed4430"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): runtime/Go/antlr/v4/parser_atn_simulator.go:996-1060 | runtime/Go/antlr/v4/parser_atn_simulator.go:1063-1110 \u2014 These two members are one piece of code written twice and then edited apart: 48 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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"02543d344f6a1b74233e725150923f8cc7f199c47218fdd82e71ff2ec7d2a327"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): runtime/CSharp/src/Atn/PredictionContext.cs:411-478 | runtime/Java/src/org/antlr/v4/runtime/atn/PredictionContext.java:548-605 \u2014 These two members are one piece of code written twice and then edited apart: 58 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":"runtime/CSharp/src/Atn/PredictionContext.cs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"7520e97af89cd1461693fa44a4b842b7ecc712ec5b025d54bd05fb1879ff979f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (85 corresponding lines): runtime/CSharp/src/Atn/LexerATNSimulator.cs:488-577 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java:470-554 \u2014 These two members are one piece of code written twice and then edited apart: 85 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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc22cd614416c7348bbcfcdd3457929cb7201e6c76d1e0349c9a2cd7b9f42f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): runtime/CSharp/src/Atn/PredictionContext.cs:492-561 | runtime/Java/src/org/antlr/v4/runtime/atn/PredictionContext.java:660-721 \u2014 These two members are one piece of code written twice and then edited apart: 62 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":"runtime/CSharp/src/Atn/PredictionContext.cs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"372c362498b1b1ec26aead67b6691a7c9c0fc5e60b20a0c957f7ee7a92779ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): runtime/CSharp/src/Misc/IntervalSet.cs:282-360 | runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:229-303 \u2014 These two members are one piece of code written twice and then edited apart: 75 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":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c30c65428a4b84d4a40479f464bfd3b025598abc17e1e0e7bbf615bfd14fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): runtime/CSharp/src/Atn/ProfilingATNSimulator.cs:55-96 | runtime/Java/src/org/antlr/v4/runtime/atn/ProfilingATNSimulator.java:56-92 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"runtime/CSharp/src/Atn/ProfilingATNSimulator.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9fb3d9c87fb064080edf30fa13f8dbae6f2c3d53d8ee8539a23ef7b9ea338e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:1544-1603 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:1447-1501 \u2014 These two members are one piece of code written twice and then edited apart: 55 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"99610d38af796af9e02cbd9d118cefe5bf8ea15d63667d4c24fddb64d6dba99a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): tool/src/org/antlr/v4/parse/ScopeParser.java:144-194 | tool/src/org/antlr/v4/parse/ScopeParser.java:196-248 \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":"tool/src/org/antlr/v4/parse/ScopeParser.java"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0dd89fac7d22ba8c8b698967af4b618f9d09fcb7e5d843d90133ab1f3a1235"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:1778-1851 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:1666-1735 \u2014 These two members are one piece of code written twice and then edited apart: 70 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a45ee755f400f307ef57bbea4981907e4789150303012de485866b897be449"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:575-627 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:553-599 \u2014 These two members are one piece of code written twice and then edited apart: 47 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"546d8bcff1887e49a93fbab2a708ed95b37aade487bfa116076ff4fcf5bc4063"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): tool/src/org/antlr/v4/codegen/model/ListenerFile.java:41-68 | tool/src/org/antlr/v4/codegen/model/VisitorFile.java:38-64 \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":"tool/src/org/antlr/v4/codegen/model/ListenerFile.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"610480d51617b3d0da2a4fc1c3ecd252d9dc375f4cd66cc74974e2cc5b928e7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): runtime/CSharp/src/Atn/ATNDeserializer.cs:960-1032 | runtime/Java/src/org/antlr/v4/runtime/atn/ATNDeserializer.java:497-532 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f60ac7217f1262bb6554babc7a85dc1caf64425f97233f079a284d7d4cdbedd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): tool/src/org/antlr/v4/automata/ParserATNFactory.java:550-581 | tool/src/org/antlr/v4/automata/ParserATNFactory.java:600-632 \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":"tool/src/org/antlr/v4/automata/ParserATNFactory.java"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"d922a5194ebc00f33a53031cdffa4155b13835a046a914ba992f2cbd475e72f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift:1707-1747 | runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift:1750-1789 \u2014 These two members are one piece of code written twice and then edited apart: 40 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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7c5328370fdac7f53f108377b6997bac87844195a678e958870f317ec0e9b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): runtime/Go/antlr/v4/parser_atn_simulator.go:1318-1352 | runtime/Go/antlr/v4/parser_atn_simulator.go:1355-1389 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7650667d1f85ec8aad8c55aa7a315f861b286357417e0011affa6b1b2f4eb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart:1886-1926 | runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart:1928-1974 \u2014 These two members are one piece of code written twice and then edited apart: 41 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":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"5750f84c786ee4cb7cb6613eb1eea1b743e1dd6a3cf565803d73724f57ef1685"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): runtime/Go/antlr/v4/semantic_context.go:198-238 | runtime/Go/antlr/v4/semantic_context.go:347-388 \u2014 These two members are one piece of code written twice and then edited apart: 41 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":"runtime/Go/antlr/v4/semantic_context.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"547f39fe10250a097e2b2b6950d868daccb4c7b86c1e51fa631167ed31fee0f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): runtime/CSharp/src/Atn/LexerATNSimulator.cs:309-350 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java:317-351 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"20731692f3bf29d38b857a860d24383341455f0ddad41ae68043c1fe99370452"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:475-505 | runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:515-545 \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":"runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"29290a4dfd3523dc42437e980ccb6dfb7a94f74b1441c89dc01b2942a9213049"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): runtime/Python3/src/antlr4/atn/ParserATNSimulator.py:1387-1414 | runtime/Python3/src/antlr4/atn/ParserATNSimulator.py:1417-1444 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce97092850338371368af6627eba8a126b1d7da687bec7ac814076ac8dbbb634"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/CodePointBuffer.java:243-276 | runtime/Java/src/org/antlr/v4/runtime/CodePointBuffer.java:278-305 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/CodePointBuffer.java"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db4b9cda1cd85e239c553101e717450bd4613be9a27aca1a0a0b70924a80064"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): runtime/CSharp/src/Atn/LexerATNSimulator.cs:142-215 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java:165-231 \u2014 These two members are one piece of code written twice and then edited apart: 67 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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"958e93ecc4cc32a4c271be3cac7b36528bae4b12b43a1c740ea5fc21f94aa906"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 41\u002B corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:1921-1963 | runtime/CSharp/src/Atn/ParserATNSimulator.cs:1971-2014 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:1846-1886 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 41 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac54d5a293b24267cb10ae0e4d1c3e93a821b5690c90ec4e563139b333d1ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): runtime/CSharp/src/Misc/IntervalSet.cs:813-857 | runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:650-685 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"933c92f2cbb7e07bad3db662ae54688f31e663f08ef710f95b5d595bf1f98357"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): tool/src/org/antlr/v4/codegen/ParserFactory.java:114-142 | tool/src/org/antlr/v4/codegen/ParserFactory.java:153-174 \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":"tool/src/org/antlr/v4/codegen/ParserFactory.java"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"87200dfdd90cbca56653fba5a06a2ae119708b2e2d4bc3a51eedf833b44de991"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java:125-152 | tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java:173-192 \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":"tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2291adfaafcc00e0cf53c839eda05cb6ccd5614a64ad5bcd1ac58ce128051a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/atn/SemanticContext.java:266-297 | runtime/Java/src/org/antlr/v4/runtime/atn/SemanticContext.java:363-394 \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":"runtime/Java/src/org/antlr/v4/runtime/atn/SemanticContext.java"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7510a6ad77bc8245e04d6a79db4b64ba08f7ff962779b924452ca1bb30ede0d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): runtime/Go/antlr/v4/jcollect.go:159-198 | runtime/Go/antlr/v4/jcollect.go:300-339 | runtime/Go/antlr/v4/jcollect.go:542-575 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 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":"runtime/Go/antlr/v4/jcollect.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"938355a94fa0c98463b17a69deb3dbaa4c228114e99dd42202fdc0d7c5e7819f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): runtime/Dart/lib/src/atn/src/semantic_context.dart:271-305 | runtime/Dart/lib/src/atn/src/semantic_context.dart:375-409 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"runtime/Dart/lib/src/atn/src/semantic_context.dart"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"9777d5c3779ff5c44d79d4babdf1a4ca4b1c27a672151f07fd1c0755a2c300a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): runtime/Dart/lib/src/atn/src/semantic_context.dart:214-239 | runtime/Dart/lib/src/atn/src/semantic_context.dart:318-343 \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":"runtime/Dart/lib/src/atn/src/semantic_context.dart"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b700c1847e50d5068be67ad3a4d64afaed11eabb96235712427c505a7ebeaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): runtime/CSharp/src/Atn/LexerATNSimulator.cs:703-740 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java:668-702 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b48265529e1d7b2250a54352db2fb397a64fb3f6b6873266104b1a3f204d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): runtime/CSharp/src/Atn/SemanticContext.cs:240-276 | runtime/CSharp/src/Atn/SemanticContext.cs:358-394 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"runtime/CSharp/src/Atn/SemanticContext.cs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c11a04bd6f9b8c376325d899eae3b97ff92b876a667babee0f02942281aaa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/tree/Trees.java:48-62 | tool/src/org/antlr/v4/gui/Trees.java:107-122 \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":"runtime/Java/src/org/antlr/v4/runtime/tree/Trees.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c5798e0aae9ba9bc7be6fa0446fe81ef563dafb19aad5aa8f1928d74317ea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:1246-1290 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:1171-1210 \u2014 These two members are one piece of code written twice and then edited apart: 40 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20b7745c676f56f547cb4b04e15e090f2c77b1acdab6575e0a56d555289c8f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): runtime/Swift/Sources/Antlr4/misc/BitSet.swift:279-313 | runtime/Swift/Sources/Antlr4/misc/BitSet.swift:360-394 | runtime/Swift/Sources/Antlr4/misc/BitSet.swift:447-489 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 35 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":"runtime/Swift/Sources/Antlr4/misc/BitSet.swift"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"868a43b8183391ba6f30dd526f718355016f1cfd0c7b90e90aa08b6c44850a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:1867-1906 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:1750-1786 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c098d07158ea3372ce14356d4a3efcc4b7c7a6e78ae1fe20f96e05b233d0100"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): runtime/Go/antlr/v4/semantic_context.go:270-306 | runtime/Go/antlr/v4/semantic_context.go:417-450 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/semantic_context.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac68e23b9122d2477ee8b71f3ae45547730fcfea143da01eb28abf9b5e2b582d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): tool/src/org/antlr/v4/automata/LexerATNFactory.java:736-761 | tool/src/org/antlr/v4/automata/LexerATNFactory.java:763-787 | tool/src/org/antlr/v4/automata/LexerATNFactory.java:789-816 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/automata/LexerATNFactory.java"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5509793c6f5365c4b9313b3cd38298a6c0275ff71c0372357948682ddfb7dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): runtime/Go/antlr/v4/dfa_serializer.go:37-69 | runtime/Go/antlr/v4/dfa_serializer.go:124-158 \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":"runtime/Go/antlr/v4/dfa_serializer.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d7ba69bf0e3bfd026f1614080cb9a0ec6aa64b451ad4320ca699c124e01042"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/atn/SemanticContext.java:215-230 | runtime/Java/src/org/antlr/v4/runtime/atn/SemanticContext.java:312-327 \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":"runtime/Java/src/org/antlr/v4/runtime/atn/SemanticContext.java"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6614e4145df5839618b21373f1a2da8a177754d82f34db1f493ee2e6a06f1d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): runtime/CSharp/src/Atn/SemanticContext.cs:172-198 | runtime/CSharp/src/Atn/SemanticContext.cs:290-316 \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":"runtime/CSharp/src/Atn/SemanticContext.cs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd160d0e8c4437f1d9b435c6e76e4edd7fab3c391e149dafc34a9b396602f00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): runtime/CSharp/src/Atn/LL1Analyzer.cs:38-60 | runtime/Java/src/org/antlr/v4/runtime/atn/LL1Analyzer.java:37-57 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LL1Analyzer.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"181bc6100e2b22d7cc82e3a125bc3e1b38e9eee1dcb6117cba16412a6051e4b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): runtime/CSharp/src/Atn/PredictionContext.cs:379-407 | runtime/Java/src/org/antlr/v4/runtime/atn/PredictionContext.java:301-324 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/PredictionContext.cs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a5ea1590e1574a7ceed52f6b4b885e7a760066a5af2479f757358e426f9903"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): runtime/CSharp/src/Atn/ATNConfigSet.cs:95-129 | runtime/Java/src/org/antlr/v4/runtime/atn/ATNConfigSet.java:138-169 \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":"runtime/CSharp/src/Atn/ATNConfigSet.cs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fce047353ec9636c371f36affa4aa25bc2f319f27db4c1514f470536839f6b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:2202-2235 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:2055-2082 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a01f91db4f390fb84af290f0f4db412d6b4b5f20c62ec80c1099f421d6b4c9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/UnbufferedCharStream.java:278-306 | runtime/Java/src/org/antlr/v4/runtime/UnbufferedTokenStream.java:243-271 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/UnbufferedCharStream.java"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f58285151fca64571f08960b59e30104ba537b8917e1be1b1f739920fec270"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): runtime/CSharp/src/Tree/Pattern/ParseTreePatternMatcher.cs:300-334 | runtime/Java/src/org/antlr/v4/runtime/tree/pattern/ParseTreePatternMatcher.java:191-224 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Pattern/ParseTreePatternMatcher.cs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"949fec62311a0746905a9af053bd6780f9aa45717084e35988859a9d8a85a2f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift:188-212 | runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift:283-307 \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":"runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cd0ab13823ccfafe27fa2a0629e70d3a41e042c40faeffaec2c1d588f4e044"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): runtime/CSharp/src/Atn/PredictionContext.cs:102-135 | runtime/Java/src/org/antlr/v4/runtime/atn/PredictionContext.java:137-165 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/PredictionContext.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"292edcea7049cf7027837ebf710df6e9dee58ebdaf52babd7b2bb481557ada98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:955-982 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:902-924 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de03d7ced89a98c3a8aa72061403d7cf1c7a3954b721753f4ac439880b8187f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java:413-431 | runtime/Java/src/org/antlr/v4/runtime/misc/FlexibleHashMap.java:241-259 \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":"runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd60bd0208fbe88879b446ec5a723bac9cd2457fac20b258b46097a36590d34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): antlr4-maven-plugin/src/main/java/org/antlr/mojo/antlr4/Antlr4ErrorLog.java:63-76 | antlr4-maven-plugin/src/main/java/org/antlr/mojo/antlr4/Antlr4ErrorLog.java:86-99 \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":"antlr4-maven-plugin/src/main/java/org/antlr/mojo/antlr4/Antlr4ErrorLog.java"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c32ba3e9a7985ffa1ebda1b9f9ac3d4817e986f5a76a8da51119438ac46f79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:988-1007 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:930-947 \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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb9c2239cc7fe0db2983be0ae0a584c78238317dbf5e5cffc4106d4d1a27430"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): runtime/Go/antlr/v4/utils.go:332-356 | runtime/Go/antlr/v4/utils.go:358-381 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/utils.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb614bb180100a6e6664e9ce417426893997d537415f456b3f60ea879f8d904"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/CommonToken.java:264-283 | tool/src/org/antlr/v4/parse/GrammarToken.java:57-73 \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":"runtime/Java/src/org/antlr/v4/runtime/CommonToken.java"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ac6fb3432e19c99c7141551b1b07f94f6b0757195e371e376cb8bb27e8ea0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java:394-411 | runtime/Java/src/org/antlr/v4/runtime/misc/FlexibleHashMap.java:222-239 \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":"runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"61669be7882c9d21a4681d460b01c0f8455535c783defcf6d9644f617df79b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 26\u002B corresponding lines): runtime/Swift/Sources/Antlr4/misc/BitSet.swift:620-645 | runtime/Swift/Sources/Antlr4/misc/BitSet.swift:655-682 | runtime/Swift/Sources/Antlr4/misc/BitSet.swift:705-732 | runtime/Swift/Sources/Antlr4/misc/BitSet.swift:747-776 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 26 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":"runtime/Swift/Sources/Antlr4/misc/BitSet.swift"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3cf5b4ecb0b82fb985e74d3a5bf8cf5ac808864fe4c2fd84e225415f0b8757"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): runtime/Go/antlr/v4/jcollect.go:203-229 | runtime/Go/antlr/v4/jcollect.go:351-378 | runtime/Go/antlr/v4/jcollect.go:513-540 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 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":"runtime/Go/antlr/v4/jcollect.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc078666e80b97277f9557960bcbfab48441f493deb549922799d9bd8dfa44af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift:241-266 | runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift:335-357 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"355683d25e14e19d398d48f3e775d03658e785627780214565ac843768919b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): tool/src/org/antlr/v4/gui/TreePostScriptGenerator.java:91-106 | tool/src/org/antlr/v4/gui/TreeViewer.java:251-266 \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":"tool/src/org/antlr/v4/gui/TreePostScriptGenerator.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3b02491b8a50879a3c824c70a8b0958fbe8c8fef2e0cd10fad01ef6f108f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): runtime/Swift/Sources/Antlr4/BufferedTokenStream.swift:375-393 | runtime/Swift/Sources/Antlr4/BufferedTokenStream.swift:400-419 \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":"runtime/Swift/Sources/Antlr4/BufferedTokenStream.swift"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ded234c784270076282a1a6013e9f96e5b3e309e5466a676f041bf2c2caf0f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/BufferedTokenStream.java:192-203 | runtime/Java/src/org/antlr/v4/runtime/BufferedTokenStream.java:448-462 \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":"runtime/Java/src/org/antlr/v4/runtime/BufferedTokenStream.java"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3797279fa749bf739f7f2dffa6d4000753b03ce4fecc528357d5078c2b7ea57e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): runtime/Swift/Sources/Antlr4/atn/ATNConfig.swift:165-194 | runtime/Swift/Sources/Antlr4/atn/LexerATNConfig.swift:86-120 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/ATNConfig.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c093a691833a73ca178e0cba3af7c2e22ffc71d5ff2476d5b65b953e3b32bad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): runtime/CSharp/src/UnbufferedCharStream.cs:371-404 | runtime/CSharp/src/UnbufferedTokenStream.cs:326-360 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/UnbufferedCharStream.cs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"940f354fb56f7e2ff57880561bb653925d6567faa8e735e5481b12803872f25e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): runtime/CSharp/src/Misc/RuleDependencyChecker.cs:409-426 | runtime/CSharp/src/Misc/RuleDependencyChecker.cs:429-446 \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":"runtime/CSharp/src/Misc/RuleDependencyChecker.cs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"19643faf75a98e7de03ccd075ec1305409d1c6a0f5a403dd76b420943dcce57c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): runtime/CSharp/src/Atn/LexerActionExecutor.cs:147-165 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerActionExecutor.java:106-123 \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":"runtime/CSharp/src/Atn/LexerActionExecutor.cs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d639c2e004809db9fd7ae5bbdd0a9152c0b7115ada395355345205153ae62ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/ParserRuleContext.java:250-274 | runtime/Java/src/org/antlr/v4/runtime/ParserRuleContext.java:280-301 \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":"runtime/Java/src/org/antlr/v4/runtime/ParserRuleContext.java"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67bdbd53dc6641a842b786f208f318c65c1eb4ce6d983b20bb3bc6b9632d768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): runtime/Java/src/org/antlr/v4/runtime/CodePointCharStream.java:164-184 | runtime/Java/src/org/antlr/v4/runtime/CodePointCharStream.java:219-239 | runtime/Java/src/org/antlr/v4/runtime/CodePointCharStream.java:270-290 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"runtime/Java/src/org/antlr/v4/runtime/CodePointCharStream.java"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"266325cccf7f74230e0c19c3fc7164deffbf11e5c59392b029af1341c981db37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tool/src/org/antlr/v4/codegen/ActionTranslator.java:263-273 | tool/src/org/antlr/v4/codegen/ActionTranslator.java:275-285 \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":"tool/src/org/antlr/v4/codegen/ActionTranslator.java"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a880fa24dfbc888264d25dab12181122d00f76553b9fca2a6efdbaf63e36c878"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): runtime/Swift/Sources/Antlr4/misc/BitSet.swift:872-897 | runtime/Swift/Sources/Antlr4/misc/BitSet.swift:912-934 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"runtime/Swift/Sources/Antlr4/misc/BitSet.swift"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dad908778d0bc2974559633adfb691ae93b51635d34abc93d0833e24e7e438e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): runtime/CSharp/src/BufferedTokenStream.cs:267-288 | runtime/CSharp/src/BufferedTokenStream.cs:644-667 \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":"runtime/CSharp/src/BufferedTokenStream.cs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"514df3cbb84d212fd36505d732d206f76c9ad133ba56815d25f2e56f477404af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): runtime/Go/antlr/v4/parser_atn_simulator.go:1627-1636 | runtime/Go/antlr/v4/parser_atn_simulator.go:1639-1648 | runtime/Go/antlr/v4/parser_atn_simulator.go:1657-1666 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"2877f046d4047b80e24029fa75e80795009f0bf38657fd2fc4db4a300ea9e8ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): runtime/CSharp/src/Atn/ATNDeserializer.cs:200-217 | runtime/CSharp/src/Atn/ATNDeserializer.cs:327-343 \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":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4441da6149bd0cd1e112f7c2d97819f7d0974f27ac87d3f84e5850213539a3cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): runtime/CSharp/src/Atn/PredictionMode.cs:244-271 | runtime/Java/src/org/antlr/v4/runtime/atn/PredictionMode.java:212-245 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/PredictionMode.cs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5186ebe19a75c6f42b81de7c7e91b125e5d7d0d0a9f03c8f13cb34c6068c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): runtime/Python3/src/antlr4/atn/SemanticContext.py:167-183 | runtime/Python3/src/antlr4/atn/SemanticContext.py:253-270 \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":"runtime/Python3/src/antlr4/atn/SemanticContext.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9da5f09a29f6645eb8172ba7e150f401aeccdbbfdce3e09384c93a308776e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): runtime/Python3/src/antlr4/atn/SemanticContext.py:210-233 | runtime/Python3/src/antlr4/atn/SemanticContext.py:294-317 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Python3/src/antlr4/atn/SemanticContext.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"080bc20571bca990afcd0f416f3d5503b73f33b33767723fd11bc6c58b59e6e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:1367-1387 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:1285-1302 \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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"7643663a5060505d9cca700dda22a736ec74ac672bbcaee9a40cc205a1bd4ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/tree/xpath/XPathRuleElement.java:26-40 | runtime/Java/src/org/antlr/v4/runtime/tree/xpath/XPathTokenElement.java:26-40 \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":"runtime/Java/src/org/antlr/v4/runtime/tree/xpath/XPathRuleElement.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c53c59507657f8ac512a0f7b0974562cf3d8857386e61e58d5826bc8887ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tool/src/org/antlr/v4/codegen/model/ElementFrequenciesVisitor.java:216-228 | tool/src/org/antlr/v4/codegen/model/ElementFrequenciesVisitor.java:259-271 \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":"tool/src/org/antlr/v4/codegen/model/ElementFrequenciesVisitor.java"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d90c0a5baa36778e26f9d5af3cd0d8bed68b9c3158381e4025fb7468505260"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart:2184-2208 | runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart:2210-2229 \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":"runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5da271814a0b2aaf3b954373312742f034a3346238af77f80ce66bcf2639636"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/BufferedTokenStream.java:365-380 | runtime/Java/src/org/antlr/v4/runtime/BufferedTokenStream.java:394-413 \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":"runtime/Java/src/org/antlr/v4/runtime/BufferedTokenStream.java"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"10703da17195497ce2f29aea75f63594a30f2df399417a2d7eb227553a17540f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): runtime/Python3/src/antlr4/ListTokenSource.py:55-72 | runtime/Python3/src/antlr4/ListTokenSource.py:100-118 \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":"runtime/Python3/src/antlr4/ListTokenSource.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e87fb0ee25bdae53ea3f73091950fb09f4511d2483c508c29c2e2fc340bef73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): runtime/Swift/Sources/Antlr4/atn/LexerATNSimulator.swift:390-401 | runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift:923-935 \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":"runtime/Swift/Sources/Antlr4/atn/LexerATNSimulator.swift"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"173bb10df202b1cafa9b9aff4f9135bd077ef1987ba807b3acd133641dba8d4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift:2013-2019 | runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift:2021-2027 | runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift:2033-2046 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08919b0ed06eb6110439c2bf9f6b710b156944d211a1208e1ffff352c89b9f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tool/src/org/antlr/v4/automata/LexerATNFactory.java:399-411 | tool/src/org/antlr/v4/misc/EscapeSequenceParsing.java:58-70 \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":"tool/src/org/antlr/v4/automata/LexerATNFactory.java"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"03701073af899b1e16367d3f0169319751c4d7377d8f4dd87bccbf6f5ee7baa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/Swift/Sources/Antlr4/Parser.swift:178-193 | runtime/Swift/Sources/Antlr4/Parser.swift:213-229 \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":"runtime/Swift/Sources/Antlr4/Parser.swift"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d058f31ae1e37955eb084263d4146dcb86c10f72918d60574716eacf2aaa68c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): runtime/Go/antlr/v4/common_token_stream.go:243-263 | runtime/Go/antlr/v4/common_token_stream.go:268-286 \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":"runtime/Go/antlr/v4/common_token_stream.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a05f3a0d5bf6566e2974a35ffb396dfa124c439fb0e4d6881af88c11aaece4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): runtime/Python3/src/antlr4/BufferedTokenStream.py:230-238 | runtime/Python3/src/antlr4/BufferedTokenStream.py:245-255 \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":"runtime/Python3/src/antlr4/BufferedTokenStream.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac47c7dc9e1977cf7c0ab9074f6cce803b956f078233af3abc98e7124c9270dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/CSharp/src/Atn/LexerATNSimulator.cs:285-302 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java:296-311 \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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb9b9d117c0790a2c12e5da0b12c0e853a811338ac7d977ce93c8f1c3f4215b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:2126-2133 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:2135-2142 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:2151-2160 \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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bb068856177c043883896f04adf11434171b8e96eae23aa554f7d0a20d4278"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): runtime/CSharp/src/Atn/LexerATNSimulator.cs:673-694 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java:643-660 \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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"97636b137f728966a586380890d22d076e221a7428ab4e3b7f9fd343a923ffea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java:118-130 | runtime/Java/src/org/antlr/v4/runtime/misc/FlexibleHashMap.java:165-177 \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":"runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aae74fc5f08163fd064ea33b0e582d746d86c6dfb6f92ced981b61dbf93eaad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/misc/Pair.java:21-32 | runtime/Java/src/org/antlr/v4/runtime/misc/Triple.java:21-33 \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":"runtime/Java/src/org/antlr/v4/runtime/misc/Pair.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55913408cc9615a20d152381d1423fc34b529c8d23f334adeff21ad1deab705"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): runtime/Swift/Sources/Antlr4/DefaultErrorStrategy.swift:345-357 | runtime/Swift/Sources/Antlr4/DefaultErrorStrategy.swift:376-388 \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":"runtime/Swift/Sources/Antlr4/DefaultErrorStrategy.swift"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5592ac3dbc9adbf943881142b8ca9f98e5822db1887cfec77225bb12e07cd8b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): runtime/Swift/Sources/Antlr4/DiagnosticErrorListener.swift:55-72 | runtime/Swift/Sources/Antlr4/DiagnosticErrorListener.swift:74-85 | runtime/Swift/Sources/Antlr4/DiagnosticErrorListener.swift:87-98 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/DiagnosticErrorListener.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"154d6e6909d15784b0aedc20e7d56ff1df2a9ac88fd9bee5f4adfdeb616f06cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): tool/src/org/antlr/v4/codegen/model/decl/AltLabelStructDecl.java:32-41 | tool/src/org/antlr/v4/codegen/model/decl/StructDecl.java:59-71 \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":"tool/src/org/antlr/v4/codegen/model/decl/AltLabelStructDecl.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"645de23c51032fbac906a3b855a8c65e551f5423ee80d6aab08151ea2a879d42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): runtime/Dart/lib/src/atn/src/atn_config.dart:143-152 | runtime/Dart/lib/src/atn/src/atn_config.dart:215-227 \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":"runtime/Dart/lib/src/atn/src/atn_config.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a97441470873d2edc8a8a9aa091fffb9bc9d007d9b0423c2290366966fe1855"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): runtime/Dart/lib/src/atn/src/lexer_atn_simulator.dart:403-412 | runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart:969-982 \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":"runtime/Dart/lib/src/atn/src/lexer_atn_simulator.dart"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b3ed1fcda3670546d17d715c1492dd714da757e7049f2b6c70f1d4da32bbc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): runtime/CSharp/src/Atn/LexerATNSimulator.cs:385-395 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java:382-391 \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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb34d97c4e55d8d76af5c085e5b7f67304ff79399ecd0cbd151c533e38aeca09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): runtime/CSharp/src/Misc/IntervalSet.cs:741-755 | runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:569-581 \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":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3794642c097943b0463a636541889a0462d7911df99c9220b9d5754c941f958"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): runtime/CSharp/src/Dfa/ArrayEdgeMap.cs:144-163 | runtime/CSharp/src/Dfa/SparseEdgeMap.cs:185-201 \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":"runtime/CSharp/src/Dfa/ArrayEdgeMap.cs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a7d4de0e03106da6c32397020a42bac0b082058edc576b913a0318d6aa8184"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): runtime/Python3/src/antlr4/atn/ParserATNSimulator.py:1625-1629 | runtime/Python3/src/antlr4/atn/ParserATNSimulator.py:1632-1636 \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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f449a6abfa9422a6c265f21a15d06fca3c3bb7b5af2118bac271ff5d7c4fd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift:366-379 | runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift:385-401 \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":"runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ec8807a83737f13f855e5ad3ce2bd5c96cb2e476da4f6d61d0806f830fdcb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): tool/src/org/antlr/v4/gui/TreeLayoutAdaptor.java:25-47 | tool/src/org/antlr/v4/gui/TreeLayoutAdaptor.java:60-82 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"tool/src/org/antlr/v4/gui/TreeLayoutAdaptor.java"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89455ff8486556b758474b5e3a7535458a66ab058d2de51f469010f08a2cd4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): runtime/CSharp/src/BufferedTokenStream.cs:233-253 | runtime/Java/src/org/antlr/v4/runtime/BufferedTokenStream.java:163-181 \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":"runtime/CSharp/src/BufferedTokenStream.cs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39575be7d5608db063f3ec46f62e4294e285f2fec57d7b40b055c416cfc74b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/CSharp/src/Tree/Xpath/XPathRuleElement.cs:24-39 | runtime/CSharp/src/Tree/Xpath/XPathTokenElement.cs:23-38 \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":"runtime/CSharp/src/Tree/Xpath/XPathRuleElement.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df9dac432077547864da8a337d8350c9e75253ac9034105ca1b56ae4129144b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/Parser.java:198-216 | runtime/Java/src/org/antlr/v4/runtime/Parser.java:236-252 \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":"runtime/Java/src/org/antlr/v4/runtime/Parser.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca546b77aa27f6e65601489e6c737786bb37186ca4c6fce76fc0cf86a3a88e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): tool/src/org/antlr/v4/semantics/BasicSemanticChecks.java:555-568 | tool/src/org/antlr/v4/semantics/BasicSemanticChecks.java:570-583 \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":"tool/src/org/antlr/v4/semantics/BasicSemanticChecks.java"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"244eef227aa8d39f1569ee5a1fa30b2938939d299780387801ea430d4b850da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): runtime/CSharp/src/Misc/IntervalSet.cs:237-254 | runtime/CSharp/src/Misc/IntervalSet.cs:257-269 \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":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a5e9e09c4174e4ea0cf2701f32530a3b5899ddcd4d7445de350c803a08a6c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/ParserRuleContext.java:211-226 | runtime/Java/src/org/antlr/v4/runtime/ParserRuleContext.java:228-248 \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":"runtime/Java/src/org/antlr/v4/runtime/ParserRuleContext.java"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaaaa39a9f200ec4e77ffa35aa6eb6f04fce9c7bfefccc2480009b8863dcc9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java:155-170 | tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java:195-206 \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":"tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae07a3c94daf441a51ec5819f4d179c36caf8a79dc4a6182fcdbbb96a76bce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): runtime/CSharp/src/Atn/ATNConfig.cs:197-205 | runtime/CSharp/src/Atn/LexerATNConfig.cs:77-87 \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":"runtime/CSharp/src/Atn/ATNConfig.cs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9a87650aee07b7326c2f5c141bfdf7606f7ab8728d2a2c54b6e51ee2e87095"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): runtime/CSharp/src/Misc/IntervalSet.cs:759-773 | runtime/CSharp/src/Misc/IntervalSet.cs:776-790 | runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:583-595 | runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:598-610 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"810b389df7df5fea1035f98635d7fdb1dd0d4953cd47cdedd5cc7d369a7d5a2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/atn/ATNConfig.java:180-188 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNConfig.java:73-83 \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":"runtime/Java/src/org/antlr/v4/runtime/atn/ATNConfig.java"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bf95ebb900637b04be2a512706829838c1f95007e999a69115c016d7960582"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tool/src/org/antlr/v4/tool/ast/GrammarAST.java:161-171 | tool/src/org/antlr/v4/tool/ast/GrammarAST.java:174-184 \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":"tool/src/org/antlr/v4/tool/ast/GrammarAST.java"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ed8441b8e5fd671c9d97f8fd2b353756ccd4436323cb5b470305757b1c1cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): runtime/CSharp/src/Dfa/DFA.cs:40-54 | runtime/Java/src/org/antlr/v4/runtime/dfa/DFA.java:49-66 \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":"runtime/CSharp/src/Dfa/DFA.cs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8540ccc72d7b90a821106a1494bf5aa5f6558a875729463419791b8748022c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/CodePointBuffer.java:353-363 | runtime/Java/src/org/antlr/v4/runtime/CodePointBuffer.java:365-375 \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":"runtime/Java/src/org/antlr/v4/runtime/CodePointBuffer.java"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"1042aa457c67e1fe80de504fbe3e9e19f2ef06ee403ee0a27b85b63b0706ea45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): runtime/Dart/lib/src/error/src/diagnostic_error_listener.dart:42-56 | runtime/Dart/lib/src/error/src/diagnostic_error_listener.dart:58-73 | runtime/Dart/lib/src/error/src/diagnostic_error_listener.dart:75-83 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/error/src/diagnostic_error_listener.dart"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7be6a29d0e60ed88498ca774f31d716d7c15f8075e3767a1577da3ebc39a09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:2281-2290 | runtime/CSharp/src/Atn/ParserATNSimulator.cs:2293-2301 | runtime/CSharp/src/Atn/ParserATNSimulator.cs:2310-2320 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":2281}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2e94c7029174e9d4d1d368f4d166a52456bb97654aabfbfafdbe2946b28f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): runtime/Go/antlr/v4/comparators.go:57-75 | runtime/Go/antlr/v4/comparators.go:126-144 \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":"runtime/Go/antlr/v4/comparators.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"36899d6646310532c53e3cbd12bad867a21cc112d623a5cc06a53728d1e32934"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:630-649 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:601-619 \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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"10025f711cd45a8f42e55ada6b8bc4fee5b5be51028df2aae2c31f583dff182f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): runtime/Go/antlr/v4/jcollect.go:123-146 | runtime/Go/antlr/v4/jcollect.go:281-298 | runtime/Go/antlr/v4/jcollect.go:491-507 \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":"runtime/Go/antlr/v4/jcollect.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"41721c3ecfe51d0a9e91e0c39db2a515103b53977df85f3027faee78e7cee154"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): runtime/Go/antlr/v4/parser.go:146-167 | runtime/Go/antlr/v4/parser.go:185-199 \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":"runtime/Go/antlr/v4/parser.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d0ff830de5cfd78511ba3d349d31d2392e0d6bcc4fb93a8a6a06e45137b7e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/Swift/Sources/Antlr4/ParserRuleContext.swift:165-180 | runtime/Swift/Sources/Antlr4/ParserRuleContext.swift:182-200 \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":"runtime/Swift/Sources/Antlr4/ParserRuleContext.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c43865759c6bde1e4304ba8cc0eb0ee4e0bb958a261d8177c5e23d68e46679d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): runtime/Dart/lib/src/parser_rule_context.dart:156-176 | runtime/Dart/lib/src/parser_rule_context.dart:178-195 \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":"runtime/Dart/lib/src/parser_rule_context.dart"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b76193233da03d05c9cb65400ba3dc2a4e99cc320afd04b12568930329599e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/UnbufferedCharStream.java:121-138 | runtime/Java/src/org/antlr/v4/runtime/UnbufferedTokenStream.java:137-155 \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":"runtime/Java/src/org/antlr/v4/runtime/UnbufferedCharStream.java"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a4bc5f07715b4374f1aa80eb8f932f0e6821a41280f43eab89100e02ac9d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/UnbufferedCharStream.java:252-267 | runtime/Java/src/org/antlr/v4/runtime/UnbufferedTokenStream.java:217-235 \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":"runtime/Java/src/org/antlr/v4/runtime/UnbufferedCharStream.java"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbcf965388adde9020e9fffebb35ffa3df26e39db780de0dbcd24d72c3d5777"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/CSharp/src/Atn/SemanticContext.cs:403-418 | runtime/CSharp/src/Atn/SemanticContext.cs:421-440 \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":"runtime/CSharp/src/Atn/SemanticContext.cs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4815dab81cd504fbe6e97255cbdf630a249ff71db274bd195e66f9972776e307"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/atn/ArrayPredictionContext.java:64-79 | runtime/Java/src/org/antlr/v4/runtime/atn/SingletonPredictionContext.java:46-61 \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":"runtime/Java/src/org/antlr/v4/runtime/atn/ArrayPredictionContext.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4a8ee76d71b2bf8639e3422e69b04f367ca39fa57e7ebcd0fc6bb4a2b3d446"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): runtime/Swift/Sources/Antlr4/BufferedTokenStream.swift:319-338 | runtime/Swift/Sources/Antlr4/BufferedTokenStream.swift:350-368 \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":"runtime/Swift/Sources/Antlr4/BufferedTokenStream.swift"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eccf7573b04286d919120667967a56747cf940b6744249dddd78beb9d14065e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): runtime/CSharp/src/Atn/ParseInfo.cs:50-59 | runtime/Java/src/org/antlr/v4/runtime/atn/ParseInfo.java:46-54 \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":"runtime/CSharp/src/Atn/ParseInfo.cs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"065ebc6362a3da1cfcd316109c3833e643b4802bf77b966d195ff305c80f10d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): runtime/Swift/Sources/Antlr4/misc/BitSet.swift:253-266 | runtime/Swift/Sources/Antlr4/misc/BitSet.swift:321-333 | runtime/Swift/Sources/Antlr4/misc/BitSet.swift:511-522 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/misc/BitSet.swift"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"497beee44acc76420b5a057a498213e4d624e99bf3ed594f440a9e24e12e0e3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tool/src/org/antlr/v4/tool/GrammarTransformPipeline.java:76-89 | tool/src/org/antlr/v4/tool/GrammarTransformPipeline.java:97-107 \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":"tool/src/org/antlr/v4/tool/GrammarTransformPipeline.java"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff898d6311ea274a8d915d8a31df1cafdd0e31e5f666a0efe9236b2592b6f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): runtime/Go/antlr/v4/error_strategy.go:272-283 | runtime/Go/antlr/v4/error_strategy.go:297-307 \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":"runtime/Go/antlr/v4/error_strategy.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aff0d65d6425725ccabadd2dc6fcc9228c63123aeeb5ef703cb1aa3d42b556d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): runtime/Go/antlr/v4/semantic_context.go:240-254 | runtime/Go/antlr/v4/semantic_context.go:390-403 \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":"runtime/Go/antlr/v4/semantic_context.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c7d31c11685c04965464d8a658b113ce416c2104064efff13d052b0422793d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/atn/PredictionMode.java:546-557 | runtime/Java/src/org/antlr/v4/runtime/atn/PredictionMode.java:567-578 \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":"runtime/Java/src/org/antlr/v4/runtime/atn/PredictionMode.java"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfe224f9ca5082b31c975b9c096c13a6f91dcf4a75c5104771067f4ab2410d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/atn/SemanticContext.java:402-411 | runtime/Java/src/org/antlr/v4/runtime/atn/SemanticContext.java:417-427 \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":"runtime/Java/src/org/antlr/v4/runtime/atn/SemanticContext.java"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28cceb526219730c6e2786ab50867f6f0fcc67f63ffd98f3124d68390758167"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): runtime/Python3/src/antlr4/Recognizer.py:53-62 | runtime/Python3/src/antlr4/Recognizer.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":"runtime/Python3/src/antlr4/Recognizer.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"409259bce3dab3fc37f5e344254af34809ce7084c71d4cd3fbc3b30957b125ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): runtime/Swift/Sources/Antlr4/UnbufferedCharStream.swift:88-105 | runtime/Swift/Sources/Antlr4/UnbufferedTokenStream.swift:124-143 \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":"runtime/Swift/Sources/Antlr4/UnbufferedCharStream.swift"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"702bd43858faaf5f1889a29277893dab2e58f8f3ac607a4c19bfe38d4f1426c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): runtime/Dart/lib/src/prediction_context.dart:758-772 | runtime/Dart/lib/src/prediction_context.dart:867-881 \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":"runtime/Dart/lib/src/prediction_context.dart"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"9858d8921d22e7358708661d1186530789cbe6c8ffd685185b4ca1ab6dc657b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/DefaultErrorStrategy.java:365-378 | runtime/Java/src/org/antlr/v4/runtime/DefaultErrorStrategy.java:397-410 \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":"runtime/Java/src/org/antlr/v4/runtime/DefaultErrorStrategy.java"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32666155a205f228bf48686bcee5f608d9ba3eb958db863a4e8b67b5a56596c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): runtime/CSharp/src/Atn/ConflictInfo.cs:59-73 | runtime/CSharp/src/Atn/LexerActionExecutor.cs:256-270 | runtime/CSharp/src/Atn/LexerCustomAction.cs:145-159 | runtime/CSharp/src/Atn/LexerIndexedCustomAction.cs:160-174 \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":"runtime/CSharp/src/Atn/ConflictInfo.cs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2aebb38bcfa0afba140c4c3e463ca536f7c1caa17df576102d9eef693771b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): runtime/CSharp/src/Atn/PredictionMode.cs:811-824 | runtime/CSharp/src/Atn/PredictionMode.cs:843-856 \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":"runtime/CSharp/src/Atn/PredictionMode.cs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8ad8a5c0280166b1eacb5e35087470f255f15fee620576b57682510cb0926b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): runtime/CSharp/src/DiagnosticErrorListener.cs:75-86 | runtime/CSharp/src/DiagnosticErrorListener.cs:89-95 | runtime/CSharp/src/DiagnosticErrorListener.cs:98-104 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/DiagnosticErrorListener.cs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"96eb465188dcec1843e17357cb6c5e658292dc3ece1f2849f92429570c7a838e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): runtime/CSharp/src/Parser.cs:237-255 | runtime/CSharp/src/Parser.cs:288-306 \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":"runtime/CSharp/src/Parser.cs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5c300c78bf2ecbcf389f409967a5e4940a1135b2dba75844527281dcdca1a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): runtime/CSharp/src/Atn/LL1Analyzer.cs:104-110 | runtime/Java/src/org/antlr/v4/runtime/atn/LL1Analyzer.java:98-105 \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":"runtime/CSharp/src/Atn/LL1Analyzer.cs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb07de02a43fe6d9cde87c88e8341c2cb207ea311605d4afbe4d88aba9600403"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): runtime/CSharp/src/Atn/ParserATNSimulator.cs:2018-2029 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:1889-1899 \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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":2018}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0e5ed5f7a439dc3c68ccf0529d5454df641479514740025bef2f077d1e657d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/misc/Utils.java:35-45 | tool/src/org/antlr/v4/misc/Utils.java:41-51 \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":"runtime/Java/src/org/antlr/v4/runtime/misc/Utils.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe5c94ee9a65f68e8bfc14c38f869d900008b3c984c0bed2486ff6ea1f2370d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): runtime/Swift/Sources/Antlr4/Parser.swift:38-42 | runtime/Swift/Sources/Antlr4/Parser.swift:51-55 \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":"runtime/Swift/Sources/Antlr4/Parser.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedc8325a35d04b45ec8775ba716fd3575d3e85a56e0ebc5fdc71dc593200829"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): runtime/Python3/src/antlr4/Parser.py:121-131 | runtime/Python3/src/antlr4/Parser.py:150-161 \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":"runtime/Python3/src/antlr4/Parser.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"45627386c78c4bcbc060940869ee69da65b4f4a8c7e7914f8a66743149962986"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): runtime/CSharp/src/DefaultErrorStrategy.cs:428-439 | runtime/CSharp/src/DefaultErrorStrategy.cs:467-477 \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":"runtime/CSharp/src/DefaultErrorStrategy.cs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6ec6c97d93e458fd0429e72378379613699f01092a903d57de458b799d8afe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): runtime/CSharp/src/Misc/IntervalSet.cs:793-805 | runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:612-622 \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":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bea16af56e60673367d421e3e2c8161173244c8a5c1804b9c0993152bfa99d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): runtime/CSharp/src/Atn/LexerATNSimulator.cs:230-243 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java:245-257 \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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4236e9b66d633a198be0de707d5ebf76c8da9e88eaa9ddcef2a469d57092f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): runtime/Python3/src/antlr4/error/ErrorStrategy.py:309-318 | runtime/Python3/src/antlr4/error/ErrorStrategy.py:337-344 \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":"runtime/Python3/src/antlr4/error/ErrorStrategy.py"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ece9567b816727a6cea39eab66bef116eb47f36de837671a2285f8cbe4fa51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): runtime/Swift/Sources/Antlr4/tree/pattern/ParseTreePatternMatcher.swift:129-133 | runtime/Swift/Sources/Antlr4/tree/pattern/ParseTreePatternMatcher.swift:151-155 \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":"runtime/Swift/Sources/Antlr4/tree/pattern/ParseTreePatternMatcher.swift"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc108bd7a800fa79798d4bbdf56b75fd690ef9bd3b6c5300c6718c9ced7e2953"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): runtime/Dart/lib/src/atn/src/lexer_action.dart:187-194 | runtime/Dart/lib/src/atn/src/semantic_context.dart:120-128 \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":"runtime/Dart/lib/src/atn/src/lexer_action.dart"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db724614c7c62aa9b271b659f4030e44f9331648ef20ad7b6160fb95e214ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tool/src/org/antlr/v4/tool/Alternative.java:131-138 | tool/src/org/antlr/v4/tool/Rule.java:296-303 \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":"tool/src/org/antlr/v4/tool/Alternative.java"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb87f3347e59d62d8930149ec50f2158e599a373d78caa2f9c8996f992663bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/atn/ATNConfigSet.java:56-62 | runtime/Java/src/org/antlr/v4/runtime/atn/PredictionMode.java:112-117 \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":"runtime/Java/src/org/antlr/v4/runtime/atn/ATNConfigSet.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e71f360c6427a823fb97ad358915e1d12ebe92d786c71973e2c274d930b4bde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/dfa/DFA.java:118-137 | runtime/CSharp/src/Dfa/DFA.cs:112-135 \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":"runtime/Java/src/org/antlr/v4/runtime/dfa/DFA.java"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"42744ea7b05d81e5d006ab32b6c8dba9efe899e4b457a691a15abcbe2046808c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java:44-54 | runtime/Java/src/org/antlr/v4/runtime/misc/FlexibleHashMap.java:59-69 \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":"runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f9000aac8f61f3a021aff6a712b5f78e0517df48fb5cd7cef1fb636f841636"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): runtime/Swift/Sources/Antlr4/atn/AmbiguityInfo.swift:61-69 | runtime/Swift/Sources/Antlr4/atn/ErrorInfo.swift:36-41 | runtime/Swift/Sources/Antlr4/atn/LookaheadEventInfo.swift:31-36 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/AmbiguityInfo.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d2c19347bbd6169b42ea44c23c28c5c661f581f46b3d3b52ef415c06fe8243"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tool/src/org/antlr/v4/automata/ParserATNFactory.java:205-212 | tool/src/org/antlr/v4/automata/LexerATNFactory.java:350-358 \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":"tool/src/org/antlr/v4/automata/ParserATNFactory.java"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c2a767ba32c2b7be35c4c98faae496b7181f1590ff5ff991ce336391047328"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): runtime/Go/antlr/v4/utils.go:233-242 | runtime/Go/antlr/v4/error_strategy.go:509-514 \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":"runtime/Go/antlr/v4/utils.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a16607c02256db9b0878db2bdea2aed2c5409dcaa2a1f2bd4033afaf15c073"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): runtime/Java/src/org/antlr/v4/runtime/atn/LexerChannelAction.java:70-75 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerCustomAction.java:101-107 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerTypeAction.java:68-73 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/LexerChannelAction.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5888423536bc01f12b53609c56d3df500e847c9ed5f2e4c387b808b080d5f401"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 6\u002B corresponding lines): runtime/CSharp/src/Atn/LexerChannelAction.cs:101-106 | runtime/CSharp/src/Atn/LexerCustomAction.cs:136-142 | runtime/CSharp/src/Atn/LexerModeAction.cs:99-104 | runtime/CSharp/src/Atn/LexerPushModeAction.cs:98-103 | runtime/CSharp/src/Atn/LexerTypeAction.cs:94-99 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerChannelAction.cs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df75d9036b27d2dca4f000aa5eea170e2ed0be8ccac126942f10723bc487a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): runtime/CSharp/src/Atn/ATNConfigSet.cs:405-411 | runtime/Java/src/org/antlr/v4/runtime/atn/ATNConfigSet.java:47-53 \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":"runtime/CSharp/src/Atn/ATNConfigSet.cs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a6a175a97c666ff430a5ee6001bc02091d5ea490262b9cd8f2dd4416742784"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tool/src/org/antlr/v4/codegen/Target.java:465-470 | tool/src/org/antlr/v4/codegen/target/CppTarget.java:91-96 \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":"tool/src/org/antlr/v4/codegen/Target.java"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8819e33ed17969adb329e7984b8da74474f41aa1dc491109c557730c2b8c7b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tool/src/org/antlr/v4/codegen/Target.java:475-480 | tool/src/org/antlr/v4/codegen/target/CppTarget.java:99-104 \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":"tool/src/org/antlr/v4/codegen/Target.java"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"871fe2a8bf0c721f4579331102c01e1adef81739676a8caaa8e86bdff71aee4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tool/src/org/antlr/v4/codegen/Target.java:485-490 | tool/src/org/antlr/v4/codegen/target/CppTarget.java:107-112 \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":"tool/src/org/antlr/v4/codegen/Target.java"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19349be228dbe5e3eb3365b1d7e2a6850ed9eccae2fb82ec24a0bed0d1568aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tool/src/org/antlr/v4/codegen/Target.java:495-500 | tool/src/org/antlr/v4/codegen/target/CppTarget.java:115-120 \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":"tool/src/org/antlr/v4/codegen/Target.java"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"04341cb412c740fef5ef4c9eb9074477c58b33b2ff73f3fcd7b49badbff9b380"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): runtime/CSharp/src/RuleContext.cs:284-288 | runtime/CSharp/src/Tree/Trees.cs:38-42 \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":"runtime/CSharp/src/RuleContext.cs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f1d1990ad4d4dcc27610c1eb352052cb9f635cf924fd3255f33453eb54a58f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/misc/Pair.java:35-40 | runtime/Java/src/org/antlr/v4/runtime/misc/Triple.java:36-42 \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":"runtime/Java/src/org/antlr/v4/runtime/misc/Pair.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b880f9a1bdd4dad75490a2325424c56a150f87a7dc764ac1ed28f46e614f1c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): runtime/Python3/src/antlr4/Utils.py:9-18 | runtime/Python3/src/antlr4/atn/SemanticContext.py:236-243 \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":"runtime/Python3/src/antlr4/Utils.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"00271aa578b0eeba8c0fdbf1bf422ca5f5b125de2801de3db0135ff8f15f5562"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): runtime/Dart/lib/src/atn/src/lexer_atn_simulator.dart:130-135 | runtime/Dart/lib/src/atn/src/parser_atn_simulator.dart:314-319 \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":"runtime/Dart/lib/src/atn/src/lexer_atn_simulator.dart"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"186f3590207c5222ae78205cad7b57446f228405a7c4bbca9db309b3a9ee3496"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): runtime/CSharp/src/Atn/ATNConfig.cs:73-79 | runtime/Java/src/org/antlr/v4/runtime/atn/ATNConfig.java:70-76 \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":"runtime/CSharp/src/Atn/ATNConfig.cs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb0f09d8a8251be199e4f79ae18b43b97a0a0fa63941c40f0ebf2a27d2890ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): runtime/Swift/Sources/Antlr4/BufferedTokenStream.swift:475-481 | runtime/Swift/Sources/Antlr4/UnbufferedTokenStream.swift:119-121 \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":"runtime/Swift/Sources/Antlr4/BufferedTokenStream.swift"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"511c5399463157e9a7e8086407e507316a310ac2e907fb2e47a8437c40411389"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): runtime/Swift/Sources/Antlr4/atn/LexerATNSimulator.swift:87-94 | runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift:287-297 \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":"runtime/Swift/Sources/Antlr4/atn/LexerATNSimulator.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"151a1b5e15bb16b32e06c6b46b3ed25a7810b845fccdc9f52824e0c1893ce8b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tool/src/org/antlr/v4/tool/GrammarSemanticsMessage.java:19-26 | tool/src/org/antlr/v4/tool/GrammarSyntaxMessage.java:21-29 \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":"tool/src/org/antlr/v4/tool/GrammarSemanticsMessage.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdcd455c0228a825b865b37207bed3da5e182e9f13df045bf28e23268bce1a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): runtime/CSharp/src/Atn/ParseInfo.cs:164-172 | runtime/Java/src/org/antlr/v4/runtime/atn/ParseInfo.java:146-153 \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":"runtime/CSharp/src/Atn/ParseInfo.cs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7c3ec5355f74ca82fc108630cca530bf015b26669a1abef217507740091c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): runtime/Go/antlr/v4/dfa_serializer.go:115-122 | runtime/Go/antlr/v4/lexer_atn_simulator.go:641-653 \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":"runtime/Go/antlr/v4/dfa_serializer.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17b5d5413f3d308ac4844398f468345ffd2bb6ccb2776d393a758b2c20c4209"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java:733-743 | runtime/Java/src/org/antlr/v4/runtime/tree/xpath/XPathLexer.java:140-150 \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":"runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"df410c1257f567f6372e3a5b4260f1f289c8878f3e9c8afd734cd3b9c8080d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): runtime/CSharp/src/Atn/ATNConfigSet.cs:71-77 | runtime/Java/src/org/antlr/v4/runtime/atn/ATNConfigSet.java:111-118 \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":"runtime/CSharp/src/Atn/ATNConfigSet.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcd12439668fe1a6209b17ea9cea1463fc0f895933105a307d1bd6b6750a109"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): runtime/CSharp/src/Atn/DecisionEventInfo.cs:68-75 | runtime/Java/src/org/antlr/v4/runtime/atn/DecisionEventInfo.java:67-74 \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":"runtime/CSharp/src/Atn/DecisionEventInfo.cs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db25053df92f77ed4b185d70f821096c73421e25fc37812ac5fd4cab5c75a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): runtime/CSharp/src/Atn/LexerATNSimulator.cs:107-112 | runtime/CSharp/src/Atn/ParserATNSimulator.cs:297-302 \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":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f87897feff3310f2f2795028d1ae7e6b61448b5607cc7d0bc8f647975bc99f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/misc/LogManager.java:58-67 | tool/src/org/antlr/v4/gui/Trees.java:84-94 \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":"runtime/Java/src/org/antlr/v4/runtime/misc/LogManager.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"092288a8cd687c71d740d635325fbb265618435b1fa5372786dd60ff2d7254ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): runtime/Swift/Sources/Antlr4/atn/ATNConfig.swift:129-134 | runtime/Swift/Sources/Antlr4/atn/LexerATNConfig.swift:75-82 \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":"runtime/Swift/Sources/Antlr4/atn/ATNConfig.swift"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ecaf508cfbc27faa8e80666ebf1fa3deac15a6db0cfefaf50a7158ab54cf8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): runtime/Swift/Sources/Antlr4/atn/LexerATNSimulator.swift:381-387 | runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift:1099-1106 \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":"runtime/Swift/Sources/Antlr4/atn/LexerATNSimulator.swift"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"b329cb15974797dc58136aea2f98864defff731578a5ca5199d3907bbdbca1f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): runtime/CSharp/src/Atn/ATNConfig.cs:125-131 | runtime/Java/src/org/antlr/v4/runtime/atn/ATNConfig.java:121-127 \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":"runtime/CSharp/src/Atn/ATNConfig.cs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd99d7b518f23fea3d870f4ac0fcb1bfbcd847685acaac51fe587898e3a1c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/tree/pattern/RuleTagToken.java:59-67 | runtime/Java/src/org/antlr/v4/runtime/tree/pattern/TagChunk.java:59-66 \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":"runtime/Java/src/org/antlr/v4/runtime/tree/pattern/RuleTagToken.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca277fac5105529d38a80155f090097f338720266420d70de83f9169c99fccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tool/src/org/antlr/v4/codegen/Target.java:456-460 | tool/src/org/antlr/v4/codegen/target/CppTarget.java:84-88 \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":"tool/src/org/antlr/v4/codegen/Target.java"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09a343b2e7f1b310e15410fecfb59f62312aeac8d075a2e9313552a8307742c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): runtime/Swift/Sources/Antlr4/atn/NotSetTransition.swift:18-23 | runtime/Swift/Sources/Antlr4/atn/WildcardTransition.swift:18-21 \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":"runtime/Swift/Sources/Antlr4/atn/NotSetTransition.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaa7982583ee6c1cfe1b3b9ad7013ada776757f348939078be4ad702164249c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): tool/src/org/antlr/v4/tool/Alternative.java:124-128 | tool/src/org/antlr/v4/tool/Rule.java:305-309 \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":"tool/src/org/antlr/v4/tool/Alternative.java"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d926c3b0b247338afabcab6cf6e611ac3cb5fac334579a4de59bc558242912"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): runtime/CSharp/src/Atn/ATNConfigSet.cs:359-363 | runtime/CSharp/src/Sharpen/SequenceEqualityComparer.cs:36-43 \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":"runtime/CSharp/src/Atn/ATNConfigSet.cs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"0315b414820a258d7fde5541b10438867fdcea72ed6e72b15b8a221d24478340"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): runtime/Java/src/org/antlr/v4/runtime/DiagnosticErrorListener.java:141-152 | runtime/Java/src/org/antlr/v4/runtime/atn/PredictionMode.java:529-535 \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":"runtime/Java/src/org/antlr/v4/runtime/DiagnosticErrorListener.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e403c1a027ebb0057a3ebd907f1e49d9cb768020f94dbdbd6d8caa1a03999ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): antlr4-maven-plugin/src/main/java/org/antlr/mojo/antlr4/Antlr4ErrorLog.java:48-53 | tool/src/org/antlr/v4/tool/DefaultToolListener.java:19-24 \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":"antlr4-maven-plugin/src/main/java/org/antlr/mojo/antlr4/Antlr4ErrorLog.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10e34a3acbcfe622899c714a41f1af435ff621e4497f23d30baca55cae2046a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): runtime/CSharp/src/UnbufferedCharStream.cs:191-198 | runtime/CSharp/src/UnbufferedTokenStream.cs:225-232 \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":"runtime/CSharp/src/UnbufferedCharStream.cs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0539d88a5e4eca4b584a3134b75327bd747a9756bd8e4600e7ab3a1c31047941"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): runtime/Go/antlr/v4/atn_config_set.go:59-65 | runtime/Go/antlr/v4/diagnostic_error_listener.go:100-110 \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":"runtime/Go/antlr/v4/atn_config_set.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf6b298c5e19a5fc022426c538a4b2207fbc58eee60d125afc89cf85f7d8dc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): runtime/Swift/Sources/Antlr4/atn/LexerModeAction.swift:75-81 | runtime/Swift/Sources/Antlr4/atn/LexerPushModeAction.swift:76-81 \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":"runtime/Swift/Sources/Antlr4/atn/LexerModeAction.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63ffca5f22fedd73c2a5e9446b0d6e3444778f4587f522d3db072ab08951735"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): runtime/Swift/Sources/Antlr4/tree/pattern/TagChunk.swift:99-104 | runtime/Swift/Sources/Antlr4/tree/pattern/TextChunk.swift:48-53 \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":"runtime/Swift/Sources/Antlr4/tree/pattern/TagChunk.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"af841f514727b21005535999ffdd5e5a91c565540e6e9d7e5ed21c5570fbb224"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): runtime/CSharp/src/Atn/ParserATNSimulator.cs:1957-1963 | runtime/CSharp/src/Atn/ParserATNSimulator.cs:2008-2014 \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 \u0060runtime/CSharp/src/Atn/ParserATNSimulator.cs:1957\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":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"1944f53bcf9d0506e50aa10c278259b2a71349b66d3e52685b9e810c7d3e127d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201327 lines \u00D7 2): tool/src/org/antlr/v4/codegen/ParserFactory.java:116-142 | tool/src/org/antlr/v4/codegen/ParserFactory.java:157-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tool/src/org/antlr/v4/codegen/ParserFactory.java:116\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"tool/src/org/antlr/v4/codegen/ParserFactory.java"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f3216800b97736c94bc6723a02345566ad2f303c819b8385466a13ae0f02b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:1813-1838 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:1861-1886 \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 \u0060runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:1813\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa7c7a2c7cbc49aab12100e379e8f6410ebf00b12a61942ee744d0326d904a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): tool/src/org/antlr/v4/gui/TreeViewer.java:506-526 | tool/src/org/antlr/v4/gui/TreeViewer.java:571-589 \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 \u0060tool/src/org/antlr/v4/gui/TreeViewer.java:506\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/gui/TreeViewer.java"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cbfa97c7ce0eb91a7778ef856f0fe60989d0b1534a9a8ce383cd7662a619f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tool/src/org/antlr/v4/gui/Interpreter.java:169-182 | tool/src/org/antlr/v4/gui/TestRig.java:172-185 \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":"tool/src/org/antlr/v4/gui/Interpreter.java"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"153acb5898c992119dc91beb13a2aa64165da1bfe745054ffafadcc07dd2faa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:476-488 | runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:516-528 \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 \u0060runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:476\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":"runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6c80eddaa891057f50ee4ee131cae79b5a3666fac70a9d77d98dfeb0ffc282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java:126-138 | tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java:174-185 \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, \u0060tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java:141\u0060 calls \u0060nextPrecedence\u0060, \u0060addPrecedenceArgToRules\u0060, \u0060stripAltLabel\u0060 and \u0060tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java:186\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":"tool/src/org/antlr/v4/analysis/LeftRecursiveRuleAnalyzer.java"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed85387e353ebf43fe0275affcd52e810630060887da18a67839b84d76a06f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tool/src/org/antlr/v4/automata/ParserATNFactory.java:565-578 | tool/src/org/antlr/v4/automata/ParserATNFactory.java:613-626 \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":"tool/src/org/antlr/v4/automata/ParserATNFactory.java"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ddd9609dd12fb9bc978674c44ada42106c63bf62410660c89f47857914556a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:585-595 | runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:600-610 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java:585\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"runtime/Java/src/org/antlr/v4/runtime/misc/IntervalSet.java"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"927e32ab463bea6cc85a62afaf96ef8a76384ae0612c786653c9f91570b4eff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tool/src/org/antlr/v4/semantics/AttributeChecks.java:172-182 | tool/src/org/antlr/v4/semantics/AttributeChecks.java:186-196 \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":"tool/src/org/antlr/v4/semantics/AttributeChecks.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0dd61df6e255b3f682e085f56d442c076334c63dd517eb7f5e13473c0cebf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tool/src/org/antlr/v4/tool/LeftRecursiveRule.java:123-133 | tool/src/org/antlr/v4/tool/LeftRecursiveRule.java:137-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tool/src/org/antlr/v4/tool/LeftRecursiveRule.java:123\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":"tool/src/org/antlr/v4/tool/LeftRecursiveRule.java"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f734e514fb831099db0c533d3b9bef619a9a1ee65b9a746487e61032b5d26e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): runtime/CSharp/src/Misc/RuleDependencyChecker.cs:108-116 | runtime/CSharp/src/Misc/RuleDependencyChecker.cs:122-130 | runtime/CSharp/src/Misc/RuleDependencyChecker.cs:136-144 | runtime/CSharp/src/Misc/RuleDependencyChecker.cs:150-158 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/CSharp/src/Misc/RuleDependencyChecker.cs:108\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":"runtime/CSharp/src/Misc/RuleDependencyChecker.cs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffef09d8621c088f44551d487744e81d0887388f45910b18e24e2f14559bcb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java:423-431 | runtime/Java/src/org/antlr/v4/runtime/misc/FlexibleHashMap.java:251-259 \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 \u0060runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java:423\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"runtime/Java/src/org/antlr/v4/runtime/misc/Array2DHashSet.java"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce433a32e59073148f517fb772bcd0c868b1b6a7fb58b999c8bf390bf0be545"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tool/src/org/antlr/v4/parse/ScopeParser.java:283-293 | tool/src/org/antlr/v4/parse/ScopeParser.java:294-304 \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":"tool/src/org/antlr/v4/parse/ScopeParser.java"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2bd9991d1655c8db14e17a603143fad2e9eecb58572e4a7304881c41357042"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/LexerInterpreter.java:52-59 | runtime/Java/src/org/antlr/v4/runtime/ParserInterpreter.java:102-109 \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":"runtime/Java/src/org/antlr/v4/runtime/LexerInterpreter.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d6d30615489e5ae2e8e543aabe80124932b251f95a6f4e42b6f8b2bd697b69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/misc/InterpreterDataReader.java:64-71 | runtime/Java/src/org/antlr/v4/runtime/misc/InterpreterDataReader.java:73-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060runtime/Java/src/org/antlr/v4/runtime/misc/InterpreterDataReader.java:82\u0060 calls \u0060VocabularyImpl\u0060, \u0060toArray\u0060 and \u0060runtime/Java/src/org/antlr/v4/runtime/misc/InterpreterDataReader.java:73\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":"runtime/Java/src/org/antlr/v4/runtime/misc/InterpreterDataReader.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8860fb29364711adcecd71a4c9ab9ec1da3c7e77f2b75991c33065ccb46b6089"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/tree/Trees.java:54-62 | tool/src/org/antlr/v4/gui/Trees.java:114-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060runtime/Java/src/org/antlr/v4/runtime/tree/Trees.java:54\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"runtime/Java/src/org/antlr/v4/runtime/tree/Trees.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf337cbca615fb0c17fa9218412bd64c6683cf59e9ce8baa3bb2e34b8b21d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tool/src/org/antlr/v4/codegen/model/decl/AltLabelStructDecl.java:34-41 | tool/src/org/antlr/v4/codegen/model/decl/StructDecl.java:63-70 \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 \u0060tool/src/org/antlr/v4/codegen/model/decl/AltLabelStructDecl.java:34\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tool/src/org/antlr/v4/codegen/model/decl/StructDecl.java:61\u0060 calls \u0060hasAltSpecificContexts\u0060 and \u0060tool/src/org/antlr/v4/codegen/model/decl/AltLabelStructDecl.java:33\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":"tool/src/org/antlr/v4/codegen/model/decl/AltLabelStructDecl.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"10adbe7736286046949729f0bca7528a90b96ac27799b78e872d27843b8ce8c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): runtime/CSharp/src/Atn/ATNConfig.cs:198-202 | runtime/CSharp/src/Atn/LexerATNConfig.cs:78-82 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060runtime/CSharp/src/Atn/LexerATNConfig.cs:83\u0060 calls \u0060Update\u0060 and \u0060runtime/CSharp/src/Atn/ATNConfig.cs:203\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":"runtime/CSharp/src/Atn/ATNConfig.cs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0ee62b2adbb36203c709588dc93b0858bf2a09b061e818dd1a1ca94668eee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tool/src/org/antlr/v4/tool/DOTGenerator.java:72-78 | tool/src/org/antlr/v4/tool/DOTGenerator.java:81-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tool/src/org/antlr/v4/tool/DOTGenerator.java:72\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/tool/DOTGenerator.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf704bccb4466ad7e5c2999f56fa7411a02f4cf9f0bd3046cf7a568cfe184681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tool/src/org/antlr/v4/tool/GrammarTransformPipeline.java:306-311 | tool/src/org/antlr/v4/tool/GrammarTransformPipeline.java:328-333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tool/src/org/antlr/v4/tool/GrammarTransformPipeline.java:306\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":"tool/src/org/antlr/v4/tool/GrammarTransformPipeline.java"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"45edb34938ea612ee31497749d480b47cfbd44352df019d3c7360e77c51a038e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/atn/ATNConfig.java:181-185 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNConfig.java:74-78 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNConfig.java:79\u0060 calls \u0060update\u0060 and \u0060runtime/Java/src/org/antlr/v4/runtime/atn/ATNConfig.java:186\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":"runtime/Java/src/org/antlr/v4/runtime/atn/ATNConfig.java"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8687214af54b9346f7c35401adcdc0ad82bb96252031b28f9d7e7ab52b613317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:2127-2131 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:2136-2140 \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":"runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6594fe96b79e41fbb7048f1a308e2219930ef5a3136f5f947a42b745874de2f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tool/src/org/antlr/v4/codegen/model/ElementFrequenciesVisitor.java:217-221 | tool/src/org/antlr/v4/codegen/model/ElementFrequenciesVisitor.java:260-264 \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":"tool/src/org/antlr/v4/codegen/model/ElementFrequenciesVisitor.java"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c26a531db64e83f90c3236d546bd19e48a6c74e81667e1526864160a4eb5f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): runtime/CSharp/src/Atn/LexerATNSimulator.cs:108-112 | runtime/CSharp/src/Atn/ParserATNSimulator.cs:298-302 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42415f2db7b9e55c26edf97d498e124ae1a39b1aec1cf1d73c1fd49b616b89e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): runtime/CSharp/src/Atn/LexerModeAction.cs:100-104 | runtime/CSharp/src/Atn/LexerPushModeAction.cs:99-103 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerModeAction.cs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecdd92544813185e42ae7b2984e9a7a546a790f0eb992b631567deace98b023"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): runtime/CSharp/src/Atn/LexerMoreAction.cs:82-86 | runtime/CSharp/src/Atn/LexerPopModeAction.cs:82-86 | runtime/CSharp/src/Atn/LexerSkipAction.cs:82-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerMoreAction.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e408025c77c6e63bfdd182611adeb79e9eed1c50546acc6d7fb2c5e28daa1a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): runtime/CSharp/src/UnbufferedCharStream.cs:192-198 | runtime/CSharp/src/UnbufferedTokenStream.cs:226-232 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/UnbufferedCharStream.cs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35931601a510f2b809b7a36f0eb9b5fb10980d711c47f9713f77166499db9df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/UnbufferedCharStream.java:146-151 | runtime/Java/src/org/antlr/v4/runtime/UnbufferedTokenStream.java:161-166 \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":"runtime/Java/src/org/antlr/v4/runtime/UnbufferedCharStream.java"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a99bea4531c1fe806d7a14f050c4b2020122878d7c7a52deb61651e4c06eeb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java:132-136 | runtime/Java/src/org/antlr/v4/runtime/atn/ParserATNSimulator.java:307-311 \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":"runtime/Java/src/org/antlr/v4/runtime/atn/LexerATNSimulator.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b898cca468e7fe8705c891447cafe77dbd78f2d9d04f5128c002786e89649d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/atn/LexerModeAction.java:69-74 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerPushModeAction.java:69-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from 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":"runtime/Java/src/org/antlr/v4/runtime/atn/LexerModeAction.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3fec3ba04a6cb231b36d790d110914e876566e3a06d2c01ce96b52ce23ee17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): runtime/Java/src/org/antlr/v4/runtime/atn/LexerMoreAction.java:62-66 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerPopModeAction.java:62-66 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerSkipAction.java:62-66 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/LexerMoreAction.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f2f642f7851c2e6c09fe125c68c3ed4376cfc2d58378b6a639ee13b602c29c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tool/src/org/antlr/v4/codegen/model/RuleFunction.java:300-304 | tool/src/org/antlr/v4/codegen/model/decl/CodeBlock.java:36-40 \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":"tool/src/org/antlr/v4/codegen/model/RuleFunction.java"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c77fa9f840ba937296d26d4f87d0bd674db190b70386ed83ee375677505691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tool/src/org/antlr/v4/semantics/ActionSniffer.java:33-40 | tool/src/org/antlr/v4/semantics/AttributeChecks.java:36-43 \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":"tool/src/org/antlr/v4/semantics/ActionSniffer.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4aee02c2e9d128ebd90d5bb55928b60ea722a565b69b77df0fd7009dcc5b5d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tool/src/org/antlr/v4/semantics/ActionSniffer.java:42-50 | tool/src/org/antlr/v4/semantics/AttributeChecks.java:77-85 \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":"tool/src/org/antlr/v4/semantics/ActionSniffer.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1d207b4f5300df8441d6feb8e30974896c1c7a36610e5801ed88a4071f5b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tool/src/org/antlr/v4/tool/Alternative.java:117-122 | tool/src/org/antlr/v4/tool/Rule.java:276-281 \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":"tool/src/org/antlr/v4/tool/Alternative.java"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d208052da9344f0e73fc50355fd03da707ca2e0a4bb6bd5d51d69665091d44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/RuleContext.java:218-222 | runtime/Java/src/org/antlr/v4/runtime/tree/Trees.java:39-43 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060recog\u0060 to \u0060Recognizer\u003C?,?\u003E\u0060 in one and \u0060Parser\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":"runtime/Java/src/org/antlr/v4/runtime/RuleContext.java"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa19698ba0effdeff74562f94cb1328670e47303ca183f79dc0b12084fade20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): runtime/Java/src/org/antlr/v4/runtime/UnbufferedCharStream.java:238-246 | runtime/Java/src/org/antlr/v4/runtime/UnbufferedTokenStream.java:206-214 \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":"runtime/Java/src/org/antlr/v4/runtime/UnbufferedCharStream.java"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d8b4a592b84b27931e66a6b58a5ff72b64646e9b69eaea3ec27ea2a8da0e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): runtime/Java/src/org/antlr/v4/runtime/atn/LexerChannelAction.java:78-87 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerModeAction.java:77-86 | runtime/Java/src/org/antlr/v4/runtime/atn/LexerTypeAction.java:76-85 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Java/src/org/antlr/v4/runtime/atn/LexerChannelAction.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf76cc715739ee403b383472d4b0eaadad6effde13e33d93b233691087e401e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tool/src/org/antlr/v4/tool/Alternative.java:109-114 | tool/src/org/antlr/v4/tool/Rule.java:268-273 \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":"tool/src/org/antlr/v4/tool/Alternative.java"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedc202f800efdb9a21a5fccc245acc8d2ac21239da2ed6cb2be4af90f36053a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): runtime/Python3/src/antlr4/atn/ParserATNSimulator.py:1395-1414 | runtime/Python3/src/antlr4/atn/ParserATNSimulator.py:1425-1444 \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":"runtime/Python3/src/antlr4/atn/ParserATNSimulator.py"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"75009d11b9cd7c7e1735bc8d23b6dc358956270bd5d35c31ca3fd198b871c89b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): runtime/Python3/src/antlr4/error/DiagnosticErrorListener.py:57-63 | runtime/Python3/src/antlr4/error/DiagnosticErrorListener.py:67-73 \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":"runtime/Python3/src/antlr4/error/DiagnosticErrorListener.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbc0d626cea8316fd4354f1cb54fe0d29bd027004327df3da80f7badbbb292a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): runtime/Go/antlr/v4/dfa_serializer.go:46-69 | runtime/Go/antlr/v4/dfa_serializer.go:135-158 \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 \u0060runtime/Go/antlr/v4/dfa_serializer.go:46\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"runtime/Go/antlr/v4/dfa_serializer.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4e15ab5ac0d46ea3caf99a9642924f72aa53466020e10ec7685bc0341bf318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): runtime/Go/antlr/v4/parser_atn_simulator.go:1015-1041 | runtime/Go/antlr/v4/parser_atn_simulator.go:1068-1094 \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 \u0060runtime/Go/antlr/v4/parser_atn_simulator.go:1015\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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9ec1afe1689835af44eb08a30b5464901f198382098d25d5d8966151cafeb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): runtime/Go/antlr/v4/parser_atn_simulator.go:1329-1348 | runtime/Go/antlr/v4/parser_atn_simulator.go:1366-1385 \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 \u0060runtime/Go/antlr/v4/parser_atn_simulator.go:1329\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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc14de35fa58529ddf9b7a91726c742c52333e36c526bc99a62b62b55bde098"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): runtime/Go/antlr/v4/utils.go:333-350 | runtime/Go/antlr/v4/utils.go:359-375 \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 \u0060runtime/Go/antlr/v4/utils.go:333\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":"runtime/Go/antlr/v4/utils.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78df6c6b2cb08542b202789c54d9bfb06e3fdb95bd77523aa745093d3e2f37a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): runtime/Go/antlr/v4/comparators.go:61-75 | runtime/Go/antlr/v4/comparators.go:130-144 \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":"runtime/Go/antlr/v4/comparators.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c600a4c7bcef04a90ec5490039be36b1f6e143dce617fa5808cea27770730b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): runtime/Go/antlr/v4/jcollect.go:185-198 | runtime/Go/antlr/v4/jcollect.go:326-339 \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 \u0060runtime/Go/antlr/v4/jcollect.go:185\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"runtime/Go/antlr/v4/jcollect.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49170a577830216db7a33f63c03fcc87ed936102118360add7e2f3da1e7c02e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): runtime/Go/antlr/v4/semantic_context.go:210-221 | runtime/Go/antlr/v4/semantic_context.go:359-370 \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 \u0060runtime/Go/antlr/v4/semantic_context.go:210\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":"runtime/Go/antlr/v4/semantic_context.go"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc086ee078502479af2b1e6c979c90fdc277b1c6baeee40cbadf80988ffb3dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): runtime/Go/antlr/v4/semantic_context.go:271-277 | runtime/Go/antlr/v4/semantic_context.go:418-423 \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 \u0060runtime/Go/antlr/v4/semantic_context.go:271\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Go/antlr/v4/semantic_context.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6871c2db885c1d37e953457844834e8e99c0675a1658b69a9aa425018fd45206"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): runtime/Go/antlr/v4/parser_atn_simulator.go:1629-1633 | runtime/Go/antlr/v4/parser_atn_simulator.go:1641-1645 \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 \u0060runtime/Go/antlr/v4/parser_atn_simulator.go:1629\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":"runtime/Go/antlr/v4/parser_atn_simulator.go"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"58687b1f8eab1f4ccbaed98c152fe34801451098cbba0a03c2b82bc191f0a978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): runtime/Go/antlr/v4/statistics.go:223-228 | runtime/Go/antlr/v4/statistics.go:238-243 \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, \u0060runtime/Go/antlr/v4/statistics.go:244\u0060 calls \u0060WriteString\u0060, \u0060Itoa\u0060 and \u0060runtime/Go/antlr/v4/statistics.go:229\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":"runtime/Go/antlr/v4/statistics.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bab86593c5a984d3b820e6f47537e591f9596561498edecdc536baeb2c98479"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift:1721-1747 | runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift:1765-1789 \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 \u0060runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift:1721\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060nil\u0060 to \u0060ctx dependent=true\u0022) //if ( parser !=\u0060 in one and \u0060ctx dependent=\\(pt.isCtxDependent)\u0022) //if ( parser !=\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":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b3f7edd2405892bd416409ef626618a419c3e43d681425ebcfdb149435f875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): runtime/Swift/Sources/Antlr4/misc/IntervalSet.swift:501-521 | runtime/Swift/Sources/Antlr4/misc/IntervalSet.swift:548-569 \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 \u0060runtime/Swift/Sources/Antlr4/misc/IntervalSet.swift:501\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":"runtime/Swift/Sources/Antlr4/misc/IntervalSet.swift"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5154afddd238603662a4b37ce8fae926acef63766734585510b1c602c40074b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): runtime/Swift/Sources/Antlr4/misc/BitSet.swift:280-293 | runtime/Swift/Sources/Antlr4/misc/BitSet.swift:361-375 \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 \u0060runtime/Swift/Sources/Antlr4/misc/BitSet.swift:280\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":"runtime/Swift/Sources/Antlr4/misc/BitSet.swift"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a5e24eb83dcb11dcf0a19daf1d3fa29e856b3b719316a4f17884e160c8a4d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): runtime/Swift/Sources/Antlr4/misc/BitSet.swift:706-717 | runtime/Swift/Sources/Antlr4/misc/BitSet.swift:748-759 \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 \u0060runtime/Swift/Sources/Antlr4/misc/BitSet.swift:706\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":"runtime/Swift/Sources/Antlr4/misc/BitSet.swift"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbedd43b9505ebbe9dfb1bcfa95970f15b6652f77b79a809680f79e290723099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift:241-249 | runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift:335-341 \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 \u0060runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift:241\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":"runtime/Swift/Sources/Antlr4/atn/SemanticContext.swift"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9f301f922af776992bd8d83fb6b68be96211ae2eb88047b6903911f2c0e88a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): runtime/Swift/Sources/Antlr4/atn/LexerATNSimulator.swift:131-136 | runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift:303-308 \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":"runtime/Swift/Sources/Antlr4/atn/LexerATNSimulator.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb8947695d8979fae576579e2fd839e0a2df7ecdff3978fa3f0c855cf58fe9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): runtime/Swift/Sources/Antlr4/UnbufferedCharStream.swift:186-194 | runtime/Swift/Sources/Antlr4/UnbufferedTokenStream.swift:197-205 \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":"runtime/Swift/Sources/Antlr4/UnbufferedCharStream.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41f3f3a3a6a7d718db352aeae9628f4ee91101b6d8a1550ffccd12d57bcc2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): runtime/Swift/Sources/Antlr4/atn/ActionTransition.swift:19-25 | runtime/Swift/Sources/Antlr4/atn/PredicateTransition.swift:23-29 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060runtime/Swift/Sources/Antlr4/atn/ActionTransition.swift:15\u0060 calls \u0060init\u0060 and \u0060runtime/Swift/Sources/Antlr4/atn/PredicateTransition.swift:20\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":"runtime/Swift/Sources/Antlr4/atn/ActionTransition.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c57790767b4d4a558268ccf93cdb411b0b99f6feffe4db642f9734ff11f69e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): runtime/Dart/lib/src/atn/src/semantic_context.dart:222-233 | runtime/Dart/lib/src/atn/src/semantic_context.dart:326-337 \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 \u0060runtime/Dart/lib/src/atn/src/semantic_context.dart:222\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":"runtime/Dart/lib/src/atn/src/semantic_context.dart"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"714eceb729462fb357e61657586133877132b126defc9ec5025fbd3f228152e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): runtime/Dart/lib/src/interval_set.dart:607-618 | runtime/Dart/lib/src/interval_set.dart:621-632 \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":"runtime/Dart/lib/src/interval_set.dart"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc89cc9101ed2b3019f58509db5369f2c6b88c8fe99fae91d442f6b7653547da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): runtime/Dart/lib/src/atn/src/semantic_context.dart:271-280 | runtime/Dart/lib/src/atn/src/semantic_context.dart:375-384 \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 \u0060runtime/Dart/lib/src/atn/src/semantic_context.dart:271\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Dart/lib/src/atn/src/semantic_context.dart"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"57877a1b99def27b1975589099a8f56765d467c00503fa0ce72bfd86f21069eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): runtime/Dart/lib/src/atn/src/atn_config.dart:143-149 | runtime/Dart/lib/src/atn/src/atn_config.dart:215-222 \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 \u0060runtime/Dart/lib/src/atn/src/atn_config.dart:143\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060runtime/Dart/lib/src/atn/src/atn_config.dart:223\u0060 calls \u0060update\u0060 and \u0060runtime/Dart/lib/src/atn/src/atn_config.dart:149\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":"runtime/Dart/lib/src/atn/src/atn_config.dart"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"69418ac786f014a9272bb25625a0c087ee276a39d14b53aaa3e1d565fc61c309"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): scripts/deploy_to_website.py:22-38 | scripts/update_antlr_version.py:44-60 \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":"scripts/deploy_to_website.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"45801855bd2e0b386dde06dbc6b582695014a4930d0a949a0bab1b1679db927f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/deploy_to_website.py:22-33 | scripts/update_antlr_version.py:44-55 \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":"scripts/deploy_to_website.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b63e96746c49c3c1a0ecafc2dffe023d26e93fd4474c49af3320b48df1d8a4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Parser (LCOM4 8): Parser\u0027s methods fall into 8 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 8 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":"runtime/Java/src/org/antlr/v4/runtime/Parser.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"702e91d9045d925399416107b81635942689b530411288a5dafe7e96fc599050"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Recognizer (LCOM4 5): Recognizer\u0027s methods fall into 5 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 5 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":"runtime/CSharp/src/Recognizer.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed1eb29490f9aeffb505eaf4bc71f8e2684c0f5db5f20c024eace1b06366358"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 .NET and JavaScript/TypeScript suite: Coverage NOT MEASURED: the .NET half could not be measured \u2014 the repository wires up no coverage collector for \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 to use; the JavaScript/TypeScript half could not be measured \u2014 runtime/JavaScript/ runs jasmine, which the coverage collector does not drive yet, so no lcov was produced \u2014 a gap in the analyzer, not something this repository is missing. This repository\u0027s production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: processWhenDependencyRemoved: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"antlr4-maven-plugin/src/test/java/org/antlr/mojo/antlr4/Antlr4MojoTest.java"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e58e8bc14aafc057ed2b35b52e742e9e9a7ade9039633f0d0002f553f335c32"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testA: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0315d4ecfc379a5b1de0608065ff100f74ac8cb661ad87ee816c780736ea070b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAB: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9acb9077069bb35837432603348109ef1c3c02c5ecaeacd0d52e50acd9c09e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testABorCD: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5933733a0f42b6516e1e50561ca723820851c2484a90ccc681eff82525095b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAOptional: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1efa0dcf43fc8001ccb3bc9fba69f7ab75c7bcb79f97950bf808ff3d564fd13"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAStar: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e676405147a3034bd5c364b40644cd1b1d7fb909d9e4c8c6b84cf3ceabbc155"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAorB: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c934dfebd98095cf1fc77d268cecdc29b1f9e093e7a9bc30a3220ae80773d5b9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAorBoptional: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fd18d4e42383b94e5f035748a31e8fe81630a26e9219dce96d4e4633df9483"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAorBorEmptyPlus: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6de3aab333ef3ca988acfc6d1988551a5a40fbcfcc340479a65f9d97da18a81"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAorBplus: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab63eae930ea9ada0a87b4285da5cd404dfc79d9a61d1339fd7901da6360bc64"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAorBstar: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"228853b7dbe2883f79f237e4101a025625f321e04b61adfbe5c6ecdb086cffb9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAorBthenC: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe76b582fc51cc6b2ddd53f732d27a2d92f8d0215bf5c468e44e5e13d60d119"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAorEpsilon: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcc3c6c590e3fbcb88fc906454489828356b8f67dc281ec82f9cba53e95aaa8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testAplus: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dfb1a985db320aa2636790e733bf0014b8a7c2f7006ca5e266be30e3c71379"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEmptyOrEmpty: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e13f0c0b6fd6a5c62ee6496b93ab16dc25abfd33c126deed958f8ffb898de9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFollow: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aea28f7a8984ffa73116a4eab069149acc4edf66c6d9148efc2ba3bc6e94513"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testForRepeatedTransitionsToStopState: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"3374f24e52bbf780ea5eab6736518118abdce03c0b95130dd25d61d1aa279ba4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNestedAstar: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"1573cc992496a5e239127cd74d8ed8a9419cdcf4803bacaa7583bc03b06e9699"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testPredicatedAorB: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bafaf662d0a9f909a8025764be753e1c1bae45cb5f0b5c289e257685c77ae5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSetAorB: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"724d423411d104beef470ccd6698bbffeda95cbe769f850af0e991388eedcafb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testSetAorBoptional: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27a9b88fd97e4da700acb320ecd35c77e243e64a77e044ed1c8835f63038f60"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testStringLiteralInParser: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6ee68f52d81d0ffd14ad3cc66b1c9de3db102871b4853245ee246081d15a13"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testbA: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestATNConstruction.java"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"386a50321fe40e3f7574cb1911d6569abb78f36b3fa81bfcc879c3a5741dff14"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEmptyActions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestActionTranslation.java"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"acae4f101b8e18032b12d7162df60164e2fb0ad587b80764ae3bbb7a30e1690e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testBadInlineActions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestAttributeChecks.java"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3866b6e543957cbc4e29d130e36c7731f38d5cff0becf150082e5e0f165fab"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDynamicFinallyActions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestAttributeChecks.java"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8172d0768c46858ac9b59862ff3bf4fdeb134a5859580a5873c5439807e13b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDynamicInitActions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestAttributeChecks.java"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"784009e6adae7226f0275ddd4416b83083ec5f105efa3f8b90eb9e747a22ed1c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDynamicInlineActions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestAttributeChecks.java"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d321d09c69696ef2d53e8a8e050b91ff7fcdc58f6c22ff93648411fdcbed713e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDynamicMembersActions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestAttributeChecks.java"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"65751c5362a866b865de90370e5948fb701a71cdade87b3714b08fb23a56057e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFinallyActions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestAttributeChecks.java"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad69ba6ec8efeb2ea694880ec560d5c1035c38e67751be16a8734c4da2f771c2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInitActions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestAttributeChecks.java"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52db280e86a5217187e0db7694090c2b3cb5f35d5f03b7ec566486da5125fd1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInlineActions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestAttributeChecks.java"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f15efb7e2fd03d3946d2eaf0e3a6f3dc9155d68948651fa78cb815d5770309"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMembersActions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestAttributeChecks.java"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41cefdf9a069ccf996560621b3d25a6f07324bc5d5f76988505f5238048df1f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTokenRef: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestAttributeChecks.java"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1762146523a4b98786a569a31e802a25c551ad3531b147dbcc7bed34c2bf40c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testArgumentRetvalLocalConflicts: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestBasicSemanticErrors.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b9f6edd5c8dcc5a6ce3556d5fbfc5e678083fcd1a6d513da9b33ec94af9e27"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testIllegalNonSetLabel: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestBasicSemanticErrors.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e76754a41a9cd14e93f564d217371a192edf99649f4fc8e037b5400a52526b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testU: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestBasicSemanticErrors.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86e7797d602699183cd0e16e484c9af61f2eacab6bd85d5874b988256d37115"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNotCharSetWithRuleRef: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestErrorSets.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f0df630dbf2ba1353bbfddc11a5e3e568045e1600f18d835798923fc65de9a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNotCharSetWithString: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestErrorSets.java"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed5fbe9afb79775550df37fa2cf96feb94fee61038398356bbea14af6840147"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testArgOnPrimaryRuleInLeftRecursiveRule: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestLeftRecursionToolIssues.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dd2371f3048980c9712ed10955ef61b41b28ca59d5c4f62c7aec6db557aa8e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCheckForLeftRecursiveEmptyFollow: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestLeftRecursionToolIssues.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c909603ba53b308f2fd69a3bf1d9f5f1b14b6e8c1cbadbbbdcdce320a09eee9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCheckForNonLeftRecursiveRule: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestLeftRecursionToolIssues.java"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"058b255d542a306f2f6cbb5d6cdec80ceed6eedeb9d3092e9cc101affcc343c0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testIsolatedLeftRecursiveRuleRef: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestLeftRecursionToolIssues.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ed048fff70d7b1d573184e87b80c7000f68b79c72c3db264a5e2d05fe2527d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLeftRecursiveRuleRefWithArg: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestLeftRecursionToolIssues.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3dc548f91e0430637ca45e87a84ff3c4fc076d7714b9a803b1f86b1c1fe1d6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLeftRecursiveRuleRefWithArg2: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestLeftRecursionToolIssues.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a3142272b358a123ec602f34db81d81054a99978b66d87d21dcaf276974c04"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLeftRecursiveRuleRefWithArg3: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestLeftRecursionToolIssues.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31775ff4b47a8560fff3f45f2da94699f8c0d986f4fbb713188a8043aeb19b4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testA: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"418d3d822dd2771860dc665ceb57dc09e81e37f14b846095f66b7a05be6b5597"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testB: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4abf41010cba6e66ecd90129de2d79a32fe39a73ef1e9a614748c469d94c34"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCaseInsensitiveCharsCollision: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"7106549e769e84bc4da0c13a6c65b7c8dc962733083cc09f825bff300e4878e6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCaseInsensitiveOptionInParseRule: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f86ae8b75fe7190f87d03381f60e16e125ac8f87e7d655694d8115a3c495aa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCaseInsensitiveWithUnicodeRanges: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"0535863354846f0c10686f251f64e0b2e4f89ffc1529bbaf519b41395c23bc50"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testCharsCollision: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"e073f05703161aad90bd2d322ffaf7b389242d9f67c0f2c833c8352addffd351"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testD: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d06de3b2816ca9cd8a5aa95cd5af0a8872492b88d413ca7be0de626f276a1a1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDuplicatedCommands: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f62285c2febe14937b3bde268394ddb4f27d10f61ed589b33d4fde89561241"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testE: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ec4dac0a4c8a1ddcd1a434f8b5e43fcccf9c0eef2dfebe034bd646a767cbdb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEmptyLexerModeDetection: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4a04f236b351da25cf138bfee251109b0b33aeae0ed364540211169b00a039"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEmptyLexerRuleDetection: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25bb6581f4ae662a05d8d835a6a1d5b3172eb7fc548b9f1ecd52f7acb71b69e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testF: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebde4eee80996b72beecfb9eb6b359279b1b9600f94a7d3fb1ad2ddcea89c0e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testIllegalCaseInsensitiveOptionValue: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7eab460324066eef0b4572bcdcf771870a46ba78856b4b33a939ced0a0d8c3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testIncompatibleCommands: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a35646bf80ec4eb576c558cc36d6c3abc4dbce68ef9d1d9c04033274353876"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLabelsForTokensWithMixedTypes: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d814ffbfceb2a1287994347981e72b42444370e7ded92372980905bf9aa485"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLabelsForTokensWithMixedTypesLRWithLabels: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f3f3e833eefb5426d5797f47ca1ec1552039608c4f72c8e740ead580b0a285"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLabelsForTokensWithMixedTypesLRWithoutLabels: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"caec86165c9f74b442b8ef9b1f95e3d53b2cbca936fff7efdf49965cbf620c22"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNotImpliedCharacters: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3ac9ec7170f0dd80a8ae4b8b1ec2bb7c2adbb376e4a7474b954744e71917ff"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNotImpliedCharactersWithCaseInsensitiveOption: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"0236a0cf03c27f1470084a9edc1ebe88d1ace31c6106e7a9e94d4438eff1af3c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRedundantCaseInsensitiveLexerRuleOption: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"2819a94bd778bbbd0dd52c62d0a38b837e29187770d5a5971b82390c266ee212"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTokensModesChannelsDeclarationConflictsWithReserved: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcb70926bfaf6b000880f15402ea3268bdc6615706365c0176c6f2aa1d7e702"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTokensModesChannelsUsingConflictsWithReserved: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3902ab9a7e03f0335a796218883d584ef9a110402879bbadde74354eb580769"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUndefinedLabel: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"18dd6b27fefd3514d4766fdcc52e5020025c221d411f22cf6153864eb9c3268e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUnreachableTokens: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e735a306279f5d73379c8c1985f91b2962aad6ce90b3adccc65bf6378da685bb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testWrongIdForTypeChannelModeCommand: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestSymbolIssues.java"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6453b6bade6e557ff6ec08c0866303b7a3cd16d9994b2fb9338ff1164662dc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testA: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3868e53159ef7e16c63129e6adc7993cd91f2d265873c9001f072f8bddd2d12"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testActionAtEndOfOneLexerAlternative: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa9ba99184affa03411bf79309dc91e252d658be5618657f1290e24d5581105"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testBadRulePrequelStart: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"814a8558e4325582fa607c97d67fbba9282771224f88f8b65b9e7e1d7a813be1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testBadRulePrequelStart2: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"1852df4d4f75ea9cb3a110b9d0e40dc2b5aee4456018c51fd9eac8e42051ea19"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testChannelDefinitionInCombined: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f55f01cb76768adc99d5e70bc9e0db8adb6f7d85fb07127eabf98802db74e9a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testChannelDefinitionInLexer: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1a3933ee91342d50c76eb0a5127bb0b016c845af090043a241f42dca217a6a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testChannelDefinitionInParser: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bb33df9b180573aae3dc2692f094f28c57562aa0e5a6c956c260271486ef43"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testChannelDefinitions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f499825b41520c0295d2fdb33b1c6637b416d14e67ec976259d7df8cc69d09a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDoubleQuoteInTwoStringLiterals: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c6d009f113a580259f5a03fa7ce5b5778708873a43c3fca5c4b12c6e58deb0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testDoubleQuotedStringLiteral: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75b08ecc09b72cc1e98aa0de6cad259c2bc294d02ec4ced450d1907902383cb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEmptyBlockOptions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"17db4559f4f9c7c37200697cadc94c419f65d2a3d44319e48d01b14a1b3d71c0"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEmptyGrammarOptions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04681d1bf27e7391dea29d42e5fccd87d7365e1b046bf87869fe345855e0480"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEmptyRuleOptions: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d206476effbe93c49e6a710b46d034fb2bfe387789a2edeb3b4067bd00fb9d6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEmptyTokensBlock: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce06e0daeb3650fbf49a5c7a7ed4a57a2619c96874059eb88a03bf92b4093745"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEofClosure: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fd0984aab6bf4677152c2099194be63b0f9dc1fe8cfbde91e703f827b32f69"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEpsilonClosureAnalysis: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0c10f087289a4274dfecd9eb600533b2ddf61376978fdbc60d8ace4e407f06"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEpsilonClosureInLexer: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ed1b267db9c2cbe3bf5eaf132c2d46bf2ed7cead136d6d42ad8470e5ea1f7c"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEpsilonNestedClosureAnalysis: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"deada9e8428233ef8d7b932f037def933b5244d6d79859a01e340019e2738869"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEpsilonOptionalAnalysis: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8168ead9ff25c67fd4ee7e06a5469b632b20eb6df861321db3950f44c76fac"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testEpsilonOptionalAndClosureAnalysis: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"631fd077e929679cdefd6180e84228601be409710656c6730f1229bf0f3e7301"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testExtraColon: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efde743352113728eeb72f4fc2db922107a89ae4486fe492455eee32e25a40f"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testFragmentActionIgnored: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"778d7fe64783d8fecc01bbb895c71cd886e6d0ba0b898e03c4695923830db046"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInvalidCharSetsAndStringLiterals: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e63f450c3707b149a759c374d91bc44212b4f04ca49a653642885a9205b70e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInvalidEscapeSequences: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5e3adfa1df1bb02c23938f68ae9aee79a8962fa0a46b7bd7fe638a961d5be5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInvalidLanguageInGrammar: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3640eee6050eed28ac36836b4ba4ba6882559634cb0673d916d01288a6698c6"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInvalidLanguageInGrammarWithLexerCommand: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0cdff7c418de40f2268df943959c573196021531151e3ad1bc44e5c410c4aa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInvalidLexerCommand: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd2d7f0d69f1e4d0859bbcc7bc092202f800f9d0f452117d1709b38a76f10b9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testInvalidUnicodeEscapesInCharSet: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"11927ff3f2cf43590f93ca156e8f2db368e79d154073dea32fcd52135672ae5e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLexerCommandArgumentValidation: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9136b84fa780582eb4852ffafc9c1aa018af79b16a63422713fc868e9027c466"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testLexerRuleLabel: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0080ec5e54865ad963a070157eee017d992a05b11fa1e2e77f6258bb9ff61e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMissingRuleSemi: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb37caf636fea464eacd2b428da89ebe9bc36338a02387f6394f17acd6e16e1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMissingRuleSemi2: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"72389eaaf8451c24ab377900163e5258321faef51d8f5b5f1af6f6ff805733fd"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMissingRuleSemi3: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7b47cc8d64f32a4091c3148495c118dd31cb9da3ceed779b4db1c71480d3a3"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMissingRuleSemi4: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad3ca3c0d88aa6e4e2c27c0b8505257eedbee421c60c05de246638af36a6087"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testMissingRuleSemi5: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb1996f9206ab890655379e1d4babf423cc7630c03d35e4667a01c5c78f6663"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testModeInParser: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b46e8577ba215683b1a47b08720292d3de8e6838019e432bfc6c5071ceebc8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testNotAllowedEmptyStrings: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"5835ab95d209c0cc783db73a690e3e570b072b249ff9d1c8ae096085ab07a406"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testParserRuleNameStartingWithUnderscore: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e739f2055c8954c2ac9eee905a5da4948691b84217743e66491c151c23cdb540"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRangeInParserGrammar: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"995df5263d5b75b8034f6a5752ea7452205cd7300c51fb49256c8a93db848067"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRuleNamesAsTree: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c705b6ad60e48cdf55df88060c4fe8ecdb3adb5b895887cc8c1b8569f86d173"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testRuleRedefinition: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95c6b0f8a2b65d71d15b58d7e64994ff13a3d7ef9fd5e5c2e6983a1c1160aeb"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testTokenNamedEOF: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8989fc3c100a8888ec3fce95c9c2dca62b7fb0566e5ec6ab1d571ed28c0c25"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUnrecognizedAssocOption: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"28484631bd57a6da88ca30681c800d3ccf88365abb9a21ef12feb434d716b20b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testUnterminatedStringLiteral: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"211544e3175bb6fe25cd7e596dfde179b97cd13b9043715efa391c10d28446dc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: testValidEscapeSequences: This method\u0027s body runs code, and no assertion was recognised in it. Recognised: JUnit\u0027s assertion methods (assertEquals, assertTrue, assertInstanceOf, assertThrows, assertThrowsExactly, assertTimeoutPreemptively, assertAll and the rest of JUnit 5\u0027s list), assertThat (AssertJ, Hamcrest, Truth), fail, Mockito\u0027s verify and the \u0060assert\u0060 statement, in the test body and in helper methods of the test\u0027s own class or an in-repository base class, followed three calls deep. Verification through a helper on another object or in another class, through a custom matcher library, or through a harness that fails by throwing under some other name is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool-testsuite/test/org/antlr/v4/test/tool/TestToolSyntaxErrors.java"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a881b381020127545443afc05c2c56e47da60aa0f3df15a40320ef17d631b3b6"}},{"ruleId":"D13","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":"0fa760fae0914735346bdf4019850ee90e2a05e7d7ec0ec020220652378c0ff0"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: runtime/CSharp/src/IVocabulary.cs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d3e4b1e3b3c2c3d4d4b96dd25b59a1b7b29bc0ce8710aae0c532d6535f3a070"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 3 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/AntlrInputStream.cs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c892a8fc6ebada9d73ec1c77f700946060fe97fcb57f1243e08e71e5931d2dd3"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 3 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ArrayPredictionContext.cs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"566577bfd90bdd756b683997f15cc8baa0f72d4b02c0e51baf253e50347fb145"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 3 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d789d89950d94e548bc0dcd901b43cdb735e5a141a84e1cad261c5adca52b3"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 3 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0500e3a4f3b289cc3262ba8dff3fe15d24c964bf815adb671ec71fd4fdf00024"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 4 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNConfig.cs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2368d849f225133a84058a6ce339c18831ee4ee7957a4d5a5e96013aca0b9b"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: 4 consecutive commented-code lines"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/ParserRuleContext.cs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb71262bc9cce293c9b516a9ef2d8eb8fc88866f047a07a956ecbf21288a155"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: these fields make me pretty uncomfortable but nice to pack up info together, saves recomputation \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNConfigSet.cs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b47b173dd87a1768e6ef70fb7ac3e6f1504889debb908c7db7e0eaa2c3acc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can we track conflicts as they are added to save scanning configs later? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNConfigSet.cs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e4ff167b4212aecfe801aa6c557533659983769411b7c5802286faeca07b67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: not yet implemented \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNDeserializer.cs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17254da88a068f770d433d083df2e842643454e5301fdf90fc3f04814f02072"}},{"ruleId":"D17","level":"error","message":{"text":"FileScopedPragmaDisable: #pragma warning disable 0659 // \u0027class\u0027 overrides Object.Equals(object o) but does not override Object.GetHashCode() \u2014 the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers \u2014 that alone turns a standing exemption into a scoped one \u2014 or fix the cause and drop the directive entirely."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ArrayPredictionContext.cs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c89a3d52e212328152db17ba9163cfc41217e524470e3082a41cb7051ca17f"}},{"ruleId":"D17","level":"error","message":{"text":"FileScopedPragmaDisable: #pragma warning disable 0659 // \u0027class\u0027 overrides Object.Equals(object o) but does not override Object.GetHashCode() \u2014 the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers \u2014 that alone turns a standing exemption into a scoped one \u2014 or fix the cause and drop the directive entirely."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/EmptyPredictionContext.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"265e0036b244f45536ebe988cfa5500f5500010216b32cd153f27912df09a79b"}},{"ruleId":"D17","level":"error","message":{"text":"FileScopedPragmaDisable: #pragma warning disable 0659 // \u0027class\u0027 overrides Object.Equals(object o) but does not override Object.GetHashCode() \u2014 the disable has no matching restore anywhere in this file, so it does not end with the construct that needed it: it runs to the end of the file and silences the rule for everything written below, including code added years later that nobody weighed against it. Close it with the matching restore directive immediately after the construct it covers \u2014 that alone turns a standing exemption into a scoped one \u2014 or fix the cause and drop the directive entirely."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/SingletonPredictionContext.cs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7efca488728230ce42ddb025f01a10b47c3d1b4b68ec35b612e1df20a77d51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerATNConfig.cs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5c6e377d846057eb51a7725aec624f7cb9892ae3ef923e461324cef93774b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if the entry rule is invoked recursively, some \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerATNSimulator.cs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd556a69c01a57ee624fc94a947caa9bc4c9d59261a5c16b00c9ef89bab4b69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //\t\t// Optimize away p||p and p\u0026\u0026p TODO: optimize() was a no-op \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e2ebac8e4484dfdae573b455c6c5fdc8e3103fe283cf019b4bab4c42e93a36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /* TODO: If we are doing predicates, there is no point in pursuing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"4502b040669839e45d6982835cae8e6baa5c2cfa99cb18d5e6ef7dcf7adf4c09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can remove? only care when we add to set per middle of this method \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ParserATNSimulator.cs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4549c439dde0f037e73f69abed57604e6397b9cbbff351550d2b303d4c7b0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: track whether this is possible above during merge sort for speed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/PredictionContext.cs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"4776085ed5f5105ae7b964b5b686dfea572d7756a01d3ae29c17b92d3a5d6b98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: does not handle delayed errors per getSynValidOrSemInvalidAltThatFinishedDecisionEntryRule() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ProfilingATNSimulator.cs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b261af134a596f5658aac127fc13e2964dacbb036c37bda561bde6fc7a602f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (sam): should we really allow null here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/SetTransition.cs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"42435b84c92029453301a1ee1a8da32a9b42af1dc1ccef1be8cf37d765361f4c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (sam): what to do when configs==null? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Dfa/DFAState.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"009282415d7c30796097d9af049e61654525b5783f5e19dda56f9f434ceaa4a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Do we lose character or line position information? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Lexer.cs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf74a6528815aa204b1666869aafb6bf173e2ed1982891cb6c70da6bfc76f62"}},{"ruleId":"D17","level":"warning","message":{"text":"DeadPreprocessorBranch: #if false \u2014 no definition of that symbol was found anywhere this analysis looks: not in a \u003CDefineConstants\u003E in any project file, props or targets under any condition, not on a build script\u0027s command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles \u2014 including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/RuleDependencyChecker.cs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"617d5dd809fd0141658e7ea290e4919bb7096ec7376f478d2d9a4640fbbfe742"}},{"ruleId":"D17","level":"warning","message":{"text":"DeadPreprocessorBranch: #if false \u2014 no definition of that symbol was found anywhere this analysis looks: not in a \u003CDefineConstants\u003E in any project file, props or targets under any condition, not on a build script\u0027s command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles \u2014 including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/RuleDependencyChecker.cs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"818c2a4b02b886653c9f18d38e6c06044d5229db9fbf9c8fc2b274cfd733104f"}},{"ruleId":"D17","level":"warning","message":{"text":"DeadPreprocessorBranch: #if false \u2014 no definition of that symbol was found anywhere this analysis looks: not in a \u003CDefineConstants\u003E in any project file, props or targets under any condition, not on a build script\u0027s command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles \u2014 including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/RuleDependencyChecker.cs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd2162d84ed42af10408ba653e3ba42afd3dd4554f6413175d6cc3bf8ae46f2"}},{"ruleId":"D17","level":"warning","message":{"text":"DeadPreprocessorBranch: #if false \u2014 no definition of that symbol was found anywhere this analysis looks: not in a \u003CDefineConstants\u003E in any project file, props or targets under any condition, not on a build script\u0027s command line, not in a #define, and not in a project-template manifest; nor is it one the compiler or SDK defines itself. On that evidence the condition is decided the same way in every configuration this repository can build, and the code on the dead side of it never compiles \u2014 including the part a reader will assume is what ships. Either define the symbol in the configuration that is supposed to have it, or delete the branch and keep the behaviour you are actually shipping. If some other mechanism binds it, that mechanism is outside the list above and this row is a gap in what we read, not a fact about your code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/RuleDependencyChecker.cs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2636a33b378f630fc214bf1824d03164d945f106edf366dc3af59453a1bb8e57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: useful in parser? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Parser.cs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecef36230ee2392a9debbb5d1b580c47ba164cce188b44ac06674f79131b603"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check for invalid token/rule names, bad syntax \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Xpath/XPath.cs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9bd36896b55c9c1b458275c02c3d2ff3e8e3a7985ce3da21f28c7d55ef2de0"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS1591 \u2014 this project generates an XML documentation file as a build output, so its documentation is something it PUBLISHES to whoever consumes the assembly, and this entry switches off a rule whose only job is to report that documentation missing or malformed. The two decisions sit in the same file and the quiet one wins: the documentation this project ships has holes exactly where the rule would have pointed, no build says so, and the people who meet the gap are downstream \u2014 in their editor, at the moment they are trying to use the member. Write the documentation the rule is asking for and drop the code from the list; where only some elements genuinely cannot carry it, narrow the suppression to those sites and give each one its reason, so the rest of the API stays covered. If the documentation was never meant to be consumed, the honest fix is the other line \u2014 stop generating the file, so the project no longer publishes something it is choosing not to check."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Antlr4.csproj"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2cadeaf526965cbc76225194fb09a20d915124986eaa00be675638516d6e2c"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS1574 \u2014 this project generates an XML documentation file as a build output, so its documentation is something it PUBLISHES to whoever consumes the assembly, and this entry switches off a rule whose only job is to report that documentation missing or malformed. The two decisions sit in the same file and the quiet one wins: the documentation this project ships has holes exactly where the rule would have pointed, no build says so, and the people who meet the gap are downstream \u2014 in their editor, at the moment they are trying to use the member. Write the documentation the rule is asking for and drop the code from the list; where only some elements genuinely cannot carry it, narrow the suppression to those sites and give each one its reason, so the rest of the API stays covered. If the documentation was never meant to be consumed, the honest fix is the other line \u2014 stop generating the file, so the project no longer publishes something it is choosing not to check."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Antlr4.csproj"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef30c263a19a18fb3359ec1c98031b195555fd3cb1938aebc84994d553548ba6"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS1580 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Antlr4.csproj"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e49802a4802eb876fcae6959904aa2a78bd92d7263c787faafcc9be3484c9a"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: CS1570 \u2014 this project generates an XML documentation file as a build output, so its documentation is something it PUBLISHES to whoever consumes the assembly, and this entry switches off a rule whose only job is to report that documentation missing or malformed. The two decisions sit in the same file and the quiet one wins: the documentation this project ships has holes exactly where the rule would have pointed, no build says so, and the people who meet the gap are downstream \u2014 in their editor, at the moment they are trying to use the member. Write the documentation the rule is asking for and drop the code from the list; where only some elements genuinely cannot carry it, narrow the suppression to those sites and give each one its reason, so the rest of the API stays covered. If the documentation was never meant to be consumed, the honest fix is the other line \u2014 stop generating the file, so the project no longer publishes something it is choosing not to check."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Antlr4.csproj"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6089578d7ba26bc2620f52f6395ce10ff63e37278fe2be2250bca61251c07951"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: NU5048 \u2014 this warning is switched off for the WHOLE project, including builds years from now. It is raised by the build itself \u2014 the packaging, restore or SDK step \u2014 about the project as a whole, not by the compiler or an analyzer at a line of code, so there is no call site to narrow it to and no per-site directive that could carry a reason: this element is the only place the decision can be recorded. Say WHY here, in a comment on the entry, or fix what the rule is reporting and drop the code from the list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Antlr4.csproj"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d19c4626cf354660ee3a54ea4a00b609cf665c52c1808065ca31c6d0c4b8a6"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: 1701 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/tests/issue-2693/Test.csproj"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0ff6f56e4b6c16b82eaedec7cb2ac09a40a4db4d0845ad8e7d7fadad36e963"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: 1701 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/tests/issue-3079/Test.csproj"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dac587edf843112c936b83cd1ffc2b11dd0507ede95031ff5f6fdd3b2ca1ed"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: 1702 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/tests/issue-2693/Test.csproj"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a8d351c693a2ae862ccd620a31028b64db2c4916c3e8b79d41b0effa27a2d2"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: 1702 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/tests/issue-3079/Test.csproj"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dabff36eccd2734fe8cfa12446f8513466cd2ae93ce7947adb48dc25479e3f"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: 3021 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/tests/issue-2693/Test.csproj"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"697d58ee3f05da4f7d69c01729b2d912e25cd3fc196181b5e7f8f8b088500ce7"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: 3021 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/tests/issue-3079/Test.csproj"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed6b2bf1d37296926dd810dd3583dcaf8e5fb3e9425c9c0de798d20149547ca"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060JavaScript\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060runtime/JavaScript/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f0de920632d94f5087e8878c50eaf0d60a29f7550cbcd28060ee18c5ca61e4"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060InitERROR\u0060 spells \u0060ERROR\u0060 where 44 names in the project spell it \u0060Error\u0060: 44 of 45 names in project Antlr4 spell the token \u0060Error\u0060 (44 of 45; unit: names in project Antlr4 containing \u0060Error\u0060). Peers: Antlr4.Runtime.BailErrorStrategy (runtime/CSharp/src/BailErrorStrategy.cs:44); Antlr4.Runtime.BaseErrorListener (runtime/CSharp/src/BaseErrorListener.cs:21); BaseErrorListener.SyntaxError (runtime/CSharp/src/BaseErrorListener.cs:23); Antlr4.Runtime.ConsoleErrorListener (runtime/CSharp/src/ConsoleErrorListener.cs:11); ConsoleErrorListener.SyntaxError (runtime/CSharp/src/ConsoleErrorListener.cs:38). Rename to \u0060InitError\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNSimulator.cs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e582aa74e8bafb11cba5e846b717697577b4a5efdd36d7cc6343de7f9cb270d6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022SINGLE TOKEN DELETION\u0022 repeats the code it sits on: 3 of its 3 words (single, token, deletion) are already in \u0060IToken matchedSymbol = SingleTokenDeletion(recognizer);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/DefaultErrorStrategy.cs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8b1657d818ee11a5901a5c63f7ba9c95d8812443b970d3062c21d8121615f2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022SINGLE TOKEN INSERTION\u0022 repeats the code it sits on: 3 of its 3 words (single, token, insertion) are already in \u0060if (SingleTokenInsertion(recognizer))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/DefaultErrorStrategy.cs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f79d4c10f33aa8153bbf2ed82c81f25f1ab0a36d112dace368400f62bd891d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get all tokens from start..stop inclusively///\u0022 repeats the code it sits on: 4 of its 5 words (get, tokens, start, stop) are already in \u0060getTokens(start, stop, types)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/BufferedTokenStream.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b1a3b8abc9468547c992297451404d9ac56569732d1faa3a5b0f4266048e8f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Remove all parse listeners.\u0022 repeats the code it sits on: 3 of its 3 words (remove, parse, listeners) are already in \u0060removeParseListeners()\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/Parser.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7230149f2906af75d2657d866be163761d7645c012a956d2221942b7e1bb3f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022SINGLE TOKEN DELETION\u0022 repeats the code it sits on: 3 of its 3 words (single, token, deletion) are already in \u0060const matchedSymbol = this.singleTokenDeletion(recognizer)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/error/DefaultErrorStrategy.js"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"e772b6eccfb25227e8941d9728b29d17707fd5cf60960cbf982b3da87f4bed35"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022SINGLE TOKEN INSERTION\u0022 repeats the code it sits on: 3 of its 3 words (single, token, insertion) are already in \u0060if (this.singleTokenInsertion(recognizer))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/error/DefaultErrorStrategy.js"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c2858f4a0829db666ff09350f63cec1cd6d240389c8e887e209f3f6d7ac71c"}},{"ruleId":"D28","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":"13f855f8012b57acb24688c30cc6215ea69c74c4e32b21028591a96a8ab522cb"},"taxa":[{"id":"CWE-321","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","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":"6b1cfbd5e810ceeddfcb375606bc2633ba88dce8c35a16b2573e9df7aa5a71fc"},"properties":{"commitSha":"6d2b5b67905fe9f99bd27ec8bc79e4070178900f"}},{"ruleId":"D28","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":"028424b8cdf320c1bdac6014f47f7e838fb2378aa214e634c89f3185218b3a48"},"properties":{"commitSha":"6d2b5b67905fe9f99bd27ec8bc79e4070178900f"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"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":"9b0dce35ea5a29faf6f116a6b572b29a903aba839937a3799ded67a2b121bf28"},"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":"dd69f48ad23a3d9f8c838df2192558f82aa010a7fc9b10638660840c9252f440"},"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":"60f20ce864c8899c69fdcb0550ffd4665e06f593e79d4b4f2f9e3b915580522a"},"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":"12cc5d66da83f8c6ba8ba8f7d869ebf72ce351e2278352e93e3476c827a2fe06"},"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":"be2fd8c4a8c2a47a684bd3fb855c95aff848c800617aa983f747ff370c0ac2a3"},"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":"de5bc9672a6ee4d6ec43a9dbbbb17f78d183cb93f70eaf301641713950687db9"},"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":"c57e80a62723d14f1a4fac258b9255fe05aeb403c76951e9e16b4301c2170f99"},"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":"644d8627e120ec22216b9cd3d1d7fd64df0ec664c020d18ac22f3d229e0d5548"},"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":"320883e29992d8f262700be35ec1bb261e29101b21a49705570aafe89e4bc860"},"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":"0318237ae883efbf71da55fbd7e69035a30c8f6c03e7fc5170b785e7f035b5ea"},"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":"b7f7fb7a6edf8bea75eadfd409ab50fc3446d295a1a1f4cb35d1c4622ee7afe8"},"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":"7e7a536b187985ce829158de8776c1c81e8f61cd2d1075bff6aa2b7f4c7de68c"},"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":"984a191c980c04d4f49f0e5cb66867f01d323090b4d44e34554c7131a4fa0dcc"},"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":"c10ae22d99586863105de678b685fb8d58ddcc599b0826985e8a6da1d0b7bdba"},"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":"6026ec86c3899b95f3d5ef9e017b43da7b257cfcab82c4c46b8701297b5a98d9"},"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":"77a1563a4bdebacd50be03408fbe9e7ba49bc1f826f8e21d5d5cfe6f2c9dfedc"},"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":"2b2cf244207f8618dfa37475b6e5ad29acf056e1d7f3eb61f8f1a5e2dbcaae70"},"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":"763cdc330cb4f46880902dd158146e1fbfebda2de6ef980733d8f043c8cb115b"},"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":"6b58298e40acebef10c9e964d2b4a70f78b8e3e1d266d3c1e5d5d923229c847d"},"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":"e77ed1412f03fc8139659eef09fa6a22e1d36d3699c76eaa685673fb1a092a44"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45a1c1be042d8ccda1480e298fcb067c290b007cc7ada5037c45e6b73e756dc8"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66f4993a9f021aef57327268beca0ae3d619ca3224ebf73c1dc661e67167ec72"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bd414a939a92e9aed73eebcebc7f8fb9eb09a19809f415b0b02a5d1369a14fe"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9792f584986bdb775872b7b747b573de2a92ad7bbb4ea643e2c60574ac9b390e"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea4767b637f60b1bb459939dd26ac6a5ae1ae508e8da556e2dfdb230b4c9dde7"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eacad29d3327922d28087095c46e622a70fc65a3e85f5d7abad98b041b255f96"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb692cf474d42c7cf99fee19308796c3f220e1037b08afd24de1668c94b81337"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9b74902bf76a71d144242df0cb3867bfc13fd211f4ef8ba00222c0213c99244"},"taxa":[{"id":"CWE-328","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":"ccf505bd3cf874a2d13a719c255b2773e506a50c56fbe7c252be41dce9237201"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1e3d9aef61340a077f92d9a9d2837cdef26250bba700c25cddd6c86eabcf40c"},"properties":{"dependency":{"package":"org.codehaus.plexus:plexus-utils","version":"3.4.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c83b6c87f930b8d55f9b51c8fe3730a1523c23acb1140a84d78468c4ad9cd223"},"properties":{"dependency":{"package":"@babel/plugin-transform-modules-systemjs","version":"7.25.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ddf9f47f959785722b4bbdc5bd967ef79039476c5c17641f85308ed18ad49ddc"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.11","advisory":"[GHSA redacted]","aliases":["[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]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37cc3ff14cb91472eac1e6d89d8803db7bb6f49b2df37946c1a146bfecaede00"},"properties":{"dependency":{"package":"browserslist","version":"4.23.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a8dcbf137acac34718625bf4163475cd51ed7d6d0fd55607c14de43e578e818"},"properties":{"dependency":{"package":"cross-spawn","version":"7.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb79739217c39ea6b83239715a71bfa95b9d34eda12e5360d54dfd3d3c9580db"},"properties":{"dependency":{"package":"fast-uri","version":"3.0.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]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"796b302c9b08b722be050cad02c8f95ef1285d44759edcc0f1701d170aee07d8"},"properties":{"dependency":{"package":"flatted","version":"3.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4250911fa5bb133bcfed8689457e373232e8ac15174a4999545c4ea0db6840a9"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11b088ae55ab69ffa9755f7900b94f255dabb88e664fdd0ed7226778335d4645"},"properties":{"dependency":{"package":"minimatch","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bf1ef997b3942268b392832f0525837bc0e691fbdb2414efdb27ad71f98d959"},"properties":{"dependency":{"package":"picomatch","version":"2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d69cd582a542aac107174670e1f18fff304f9da2aeaa7eee8e8e92de5dafc9e"},"properties":{"dependency":{"package":"serialize-javascript","version":"6.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1bdd4b7abd772e049d2ce6a3025c2815269e7d6b4934e563ec1dc5791bd0806"},"properties":{"dependency":{"package":"stdlib","version":"1.20.99","advisory":"GO-2024-2598","aliases":["BIT-golang-2023-45288","BIT-golang-2023-45289","BIT-golang-2023-45290","BIT-golang-2024-24783","BIT-golang-2024-24784","BIT-golang-2024-24785","BIT-golang-2024-24789","BIT-golang-2024-24790","BIT-golang-2024-24791","BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","GO-2024-2599","GO-2024-2600","GO-2024-2609","GO-2024-2610","GO-2024-2687","GO-2024-2887","GO-2024-2888","GO-2024-2963","GO-2024-3105","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"runtime/Go/antlr/v4/file_stream.go","line":23,"symbol":"os.Open"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53a2f0f4219abdb279d9ad83a80f20d3a648b8301f78819f6ae542b480a685d9"},"properties":{"dependency":{"package":"@babel/helpers","version":"7.25.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2055f48d67234792adddbd0d64ebc23d13d370d02ab32bcd04d5d6254eecd07f"},"properties":{"dependency":{"package":"@babel/runtime","version":"7.25.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"383687d882ac41bd9898e6a1ed881811398f1135766d2faab78f0ca75bbbface"},"properties":{"dependency":{"package":"ajv","version":"6.12.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"984c59c35df73ad760f8fc178a72841a6ac1ec36753831894f45c4373d612d2d"},"properties":{"dependency":{"package":"ajv","version":"8.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26496da3cbf2dd74f61f4ee339b5f838e397f5fffc0c3805ad499d99e56aa99d"},"properties":{"dependency":{"package":"micromatch","version":"4.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec5679fce86dc292763ea66f45efc37f000df8a659b53b849cfb0107433279a"},"properties":{"dependency":{"package":"webpack","version":"5.93.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"runtime/JavaScript/package.json"}}}},{"ruleId":"D30","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":"cb398c9a722c0940058ad7548bbcac83593dba731afd43020e451188a7a662dc"},"properties":{"dependency":{"package":"@babel/core","version":"7.25.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"runtime/JavaScript/package.json"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9deb0b3e9568df1171bacf908174d514cb7e71041f1c1975b38340d1bde8fc0"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2e1c33b058c005e6250f1c0f084e946c06ff1870f1bdd4ba3f17649dd503141"}},{"ruleId":"D31","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":"e0c4bf8c3bdb5d9b70cd596105fda9b11ad3bc983d307a5e0af2b5978a51dd2b"},"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":"D31","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":"373e305f6001577651b42479d2cf4d60bd4ebf60635dcdbb799a1c0961be0633"}},{"ruleId":"D31","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":"4f922ade00e1480db9bbc3fbf3b45b99a905f40b6c188e273d7867fc9c0f0f24"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","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":"51d455d7456cc3a6d11f80192463fb0759268d2bc1b332cab5d2bf2b0555a612"},"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":"D34","level":"note","message":{"text":"Concentrated knowledge decay: 86 of 96 significant files have no living knowledge, while the repository is still being changed at a low rate (1 commit(s) in the last 90 days) \u2014 so this is one repo-wide knowledge-decay state, not 86 separate risks. Counted over 96 of the 179 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"008bd8d3156a7f5206da709f59f1f87af76671c6b9becea72c8c9cffbcbd4f8e"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Parser.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b1e6a55af85c7ce480a8de6abea8112747d839870665c4276fa8c0c0c27118"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/DefaultErrorStrategy.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8200b7eed23f1de690d7727381eeab4b972e8b15ef75bdd15f9feeef51aafa0"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/PredictionMode.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf692e5eacce9ee2280b3a6bbd332eefd3af4735351df91bc3aa71a50afde7b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/IntervalSet.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7cad945e14e157d1bedd445f10c8631b45b19f188e71f32e5b5138647e9e7e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/TokenStreamRewriter.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"295a2ef85f52f127409b165943a4e87418b13a69b102007623a8aff36644bc52"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Pattern/ParseTreePatternMatcher.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5234c9e2e4266532b94a48b745a808887c150aee3445e47c91ac397a20039b9b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/RuleDependencyChecker.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aeda1c463d3f0a5877cb44fddb5de439fb2c99bb3977362618e43165ab538d0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/BufferedTokenStream.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f42d1907fb60ac53579ff72c85e3a4363b9e826e05dc8fa1b067415cc7983f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Lexer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65be5f7fb71263eb4192d7344bbabda88d0247b242d063bf27731ed7bc78cbf2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/SemanticContext.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4f08dbe39e83cd0db580bf07d80a119ff16b2d39feb187bc73b8a73cf6f3d9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/UnbufferedCharStream.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd09153387271e1a16ebd94d6ef4c17a5e57f880b017984696d933dfb8db20a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/ParserRuleContext.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da21b268fa29e200ac9d268959711a2586121d13a7089c16171656ee163b261"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/IIntStream.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a135fb1a09e0e8feba0e92b4126208f5facd7a0c92d947a962c7da48a7e2cf2e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Recognizer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba3a8b3857eb35a1dc6512fac5722ae03686a6dcf7419a4651262429d9b1349"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/UnbufferedTokenStream.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28945197aecdd7e97e628fdbe093c547fd70f1c3ba9c0079e5fd219a1ee566e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/ParserInterpreter.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52dad01486e6bde0f13dcfb58a6bd429a433ae881fefd1fd9bfe809fc61e007e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerActionExecutor.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6983aff8203e2e722804b738ea0bb8bf0cb4613bbb4ab2a45e4e0fce8f55ddee"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/ListTokenSource.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63da4b811fb434de7aa6a15d51104539b45b307f047a2c072771a3e3adc21a49"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNConfigSet.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b39788bfdf1bcee65512e3b4b8415f48c7406fadb05fdae2d13a5fb67ace788"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/CommonToken.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e26a65e28ffe2e65d2e99bfefe8e6e5ba7ee38bcd8a6323ce3646e0cb713734"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Pattern/ParseTreeMatch.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"549809a78ada3676b75724da1912701df1ecfed2a14b3ec3ed259c15dff35b38"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Xpath/XPath.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a300280232ba36e4389f5e77a1c4dece93e1a319560c5fac42e69659cd74bad8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/RuleContext.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91297b89afdb17592b6602287b42f2355300149f07d7cf91644f5535c8d6490a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/AntlrInputStream.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75821b371a9f97f21b9c150e203edff8f778c523a55f1470e63a7eb55bac55e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATN.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ded7394bab01577cc62bc2204f8eb46a161607238d838b2cb094adbbc4ad119"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/IIntSet.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"634c172ed0b92167c78e204c14372abd28f9f0e5f946c6d7298bdca1090944ec"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/IParserErrorListener.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a784cff1f7fc809a748218035b35786eac590fc940ae86a8689fe0d44716bc2a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Sharpen/BitSet.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71076651bc395e5ad94d6efe222306063e9e4e8c4d219176ee4da52fe3e14b3f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Pattern/RuleTagToken.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf23b52376b8f9b5391a4f14a67332eda6d67270e1e8de1b1cef7392ee190a6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/AbstractParseTreeVisitor.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8550761aeb3ebdb6958acd29cf5dc18aeccd35174adabe6051024d7dd5b94ae7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/ITokenStream.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"348c1603ab7e49af9ae2d8606a8eeb52bf5f944c58ddf00a11766963a036fdb5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Trees.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc75cdd290da04430faf9e732bb488f9e96a0b187e890bf96b3295c4ed5ca4fe"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Pattern/ParseTreePattern.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d48245d2d5f204d3305aff7e3627193f0a6db07a82de7e2b3c1d0bb707bd5dd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/RecognitionException.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb71af7e078316a8757768faa3920631384256d9a0e2f2b200641f5ef06edfd2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNConfig.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a9342895cb9b72d4c1ef73c6f04cac47e3551351a4a5b58f5f90e3c0af1b92"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/DiagnosticErrorListener.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d7c91a625e74a0f698ebe3a7ba463373b0ba85bf035875dbe332810ff75999"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/IAntlrErrorStrategy.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade711ef37cc5f7efab85e0b68b4509aaa60343e750ddc6d7376cb5d892b37ec"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/Interval.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dc787a8ed6b12819254f2598537638df9247e40f1f23360d59087e7e484801"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Dfa/SparseEdgeMap.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"593e4fd4aa63d656a18397122d2c1a8943c31b6b7587c1e5fc14daa9ac9561c3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Dfa/DFAState.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a700ec1a42d77fb6484dc4b149767bc5755ce8dcda41b1bd9c757c59cb6df0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/IToken.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ddaae2905ac2ffeb14644c99eb20068ba0157088eb7acf1d168540fdb02acd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerCustomAction.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da9442c4676aa7f0706a130b3a922686beabd87fccf07eafdb5fe99397863e3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Vocabulary.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b840a216211623750387fafa0cc0e2b57615bfa5ab3e5f2b929aae5acdbbcce4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/CommonTokenStream.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"257810b0f86d61505b28b937b0bc862019eb00693833191d2c48a9ec1975ed35"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/IVocabulary.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1554ffae9f383c8faa40a8446134f1a171057306a9d76649549da93fe8914f81"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerIndexedCustomAction.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb09151b0918d14fbfbc76c42e6c98d3fc5ac4be65abefd6c9cff4111c44633"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNState.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1512c6811b68c42bde058b728b27bbe955eea19a8ab8fbf1f424f0ff81375c29"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Dfa/ArrayEdgeMap.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41a184ed61f0a8d92617fbd46c3bbb2b90e84c41cac75ff81d065cbab5a73f9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/ITokenSource.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35aac9b9029e3197a38f43782693e4c73f107ffbb7e2c6f4833805f033229328"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Pattern/TagChunk.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c7a275c996af11c335cf4022ca6bb012d9a566391c5ae4b4ae46ee034ec061"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/CommonTokenFactory.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73838f750e5e6317b97079d2752d79bf2e75e99f339d752f9ce81315d233d8bb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/MurmurHash.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f755055a7c97cd4f831bb4fd3c3663fea2b71762e31b11172cc9b761feea096"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/Pattern/TokenTagToken.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7f513edda710a92fdcee48185d049e3a7d172c2d3bea945dd03140f85aeb4c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/AmbiguityInfo.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65d2efd9faa0c6c1fe9cb9e227d142d62c43c5d3a999920c31bf4ea5f87f54a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Dfa/DFASerializer.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c585f03e18574e0d8f7c06fef291b623ab5d33a5214b83fc351a0e01594d28f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/BailErrorStrategy.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f80cbe0c4a3b44087e25f3507b23ef76daac1a17046d4ab4ddbd6374809e2b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/PredicateEvalInfo.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edffeb6db583f08e0882e0242eaa9ff88159ad728ecb08953f83793260741081"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Misc/Utils.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae40476073dc5b4171f419b545b1ffcad906c7ce174a91a5845d50d09bf3b2e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/CharStreams.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ad265c9d65c3809b6a45c3ca25d4835dbc4fe21320e70fcf773ae37fadd472"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerChannelAction.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca767b9fef240f00290ea57186b0dccc84d1bf25efbc075cff74e3a3fa704dc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerPushModeAction.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77343d4f67f323886e324958a90bee7ac38aea0e573f8d2722bc976502da12eb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerModeAction.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc12ef244248b4c6f7ac3c939fd383f02587eeff81b6430c7762842c0d9f59c5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Dfa/SingletonEdgeMap.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef70cc8ca57f015bb6fe94e9723a6756af0790a9a6d8a7dcf0604354bdc380c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerTypeAction.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d698fb38dba0d054c8b5372acb22b5f07b8fd46eb5020b66ed00d72579e55ce7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNSimulator.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6ea7452dc860e768c9e3efbecf0e794248352a370a603ffbb952b37b9cd05a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/LexerInterpreter.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ab1fcca5bed7ebc63d1be446e64d48f9e8f77004564c55ad137d51054e5875"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/ParseTreeWalker.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1c752696c493f7df4b7d018ec526540ab538b09b160fc2ec09953e1886ce53"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/DecisionEventInfo.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd63911e9cd4467d953cd26350fda5f8f8e99be3d31ef342af2f147ff238dfbd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ArrayPredictionContext.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35caed8663983b9594dcef6b0093ccf5b520f35a09813a298c7c2f4dcac29fb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/FailedPredicateException.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b73cb79158dbb569fc39fe72da1bb30a968d0ccc830fe12245629871b89789c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNDeserializationOptions.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1255af3feafe247957a7488b9e06b1f68a125ca8e88b595d434b251814114422"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/Transition.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68e5f26f35ef27b6bd056a2113e3a5488d57d676794cfc0e68c725147934924"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/TerminalNodeImpl.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c6862f7ad140f66299d2cc1c1da2f19ba3d62be0e73fc7c109ba92f1277576"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ILexerAction.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4593f55f21f4326c56de7c7b5c3c387e2e26bd2a271aa353b49510cda43ab28a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ConflictInfo.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10a9b1d26131a1a8c67b4b39faac373f93ee098573770f158d3d34f001acc09"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerPopModeAction.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb42e11d63e06fd2d4d5441ca02ce5e5fe2ad3ebe7138af12d5813a4ed9a0dd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/NoViableAltException.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7111047c1f9d37e8d9f69c61e738d8c083761b16532dd50717180423a445eb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerMoreAction.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68053dc1182b49033c02219f5f57f606fff6e09a45eae43f682458921d08c06"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LexerSkipAction.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56e44fd47e8d854d95cc1d87b32001c8448e259bae5e0260a28a5b78ab0d55b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/IAntlrErrorListener.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76fa6db9b97b32f77627de424efccbd084f9c879980a7f071ccb9c1ff1295df"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/SingletonPredictionContext.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7122c2830e2e8b9a9e725915fb920f807a338d1de81562cb8e66e73853bd0ed9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/IParseTreeVisitor.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88b7f0e99d4a704930b25b0e3e50e6f68a3deff30e1885a70112c843b280703"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ContextSensitivityInfo.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c1a18c9b1a089d1e9e6ac8b0d307d12fa0e3fddfe136e023410414c1cf97a4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/LookaheadEventInfo.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de45676bb7611d00b0bd61d9aea80024e1826be65f321829b9835c4210efbd2b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/ProxyParserErrorListener.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d8856af491096307c8caa8ac1079462e860f492d7fb7b5848a941e80a0a17e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Dfa/AbstractEdgeMap.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a649a462313e95c8a2e1d62d1aaf7b3a6e5d3e758ff72e4e752189f1f8232282"}},{"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":"D44","level":"warning","message":{"text":"End-of-life runtime: .NET net5.0: runtime/CSharp/tests/issue-2693/Test.csproj declares .NET net5.0 as this project\u0027s target framework, and .NET 5, support ended 2022-05-10. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-05-10 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/tests/issue-2693/Test.csproj"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d77f7bf37e9005a5117f87a26e30af81791a6fbb753870e88ec73a6eccecd9e"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: .NET net5.0: runtime/CSharp/tests/issue-3079/Test.csproj declares .NET net5.0 as this project\u0027s target framework, and .NET 5, support ended 2022-05-10. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2022-05-10 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/tests/issue-3079/Test.csproj"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2639b8a72701a3d911cbe2d5350afa7bc31d4442eaffcda7cd284ebeda35e12"}},{"ruleId":"AX2","level":"warning","message":{"text":"Stateful shared instance: ParserRuleContext: \u0060ParserRuleContext\u0060 keeps one instance of itself in the static \u0060EMPTY\u0060, so that one instance serves the whole process and is shared by every thread that reaches it \u2014 and it mutates instance state outside any lock (_start, _stop, children; e.g. \u0060_start\u0060 at line 136)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/ParserRuleContext.cs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"785f040919167ed33bcc5904df54f81652c21bf5d5aa596050d415c2338f4221"}},{"ruleId":"AX2","level":"warning","message":{"text":"Stateful shared instance: ATNDeserializationOptions: \u0060ATNDeserializationOptions\u0060 keeps one instance of itself in the static \u0060defaultOptions\u0060, so that one instance serves the whole process and is shared by every thread that reaches it \u2014 and it mutates instance state outside any lock (readOnly, verifyATN, generateRuleBypassTransitions, optimize; e.g. \u0060readOnly\u0060 at line 63)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNDeserializationOptions.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bdcd23cdbf28a14ade9ade908ca961baa6127f5572ec889e13a4da2ce98b26"}},{"ruleId":"AX2","level":"warning","message":{"text":"Stateful shared instance: TerminalNodeImpl: \u0060TerminalNodeImpl\u0060 is not registered, but the singleton \u0060ParserRuleContext\u0060 creates it and keeps it in \u0060children\u0060, so one instance outlives every request and is shared by every caller that reaches it \u2014 and it mutates instance state outside any lock (_parent; e.g. \u0060_parent\u0060 at line 46)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/TerminalNodeImpl.cs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8f451a37e446716f2a173f67780840e8b44f8cd76ea0f12ebd9f829ff00a27"}},{"ruleId":"AX2","level":"warning","message":{"text":"Stateful shared instance: ATNConfigSet: \u0060ATNConfigSet\u0060 is not registered, but the singleton \u0060DFAState\u0060 creates it and keeps it in \u0060configSet\u0060, so one instance outlives every request and is shared by every caller that reaches it \u2014 and it mutates instance state outside any lock (hasSemanticContext, dipsIntoOuterContext, cachedHashCode, readOnly, configLookup; e.g. \u0060hasSemanticContext\u0060 at line 100)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Atn/ATNConfigSet.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3f9d7fd8868018805930f659e76b2fb0b84be51ffc2eb0b91ac981b62431a3"}},{"ruleId":"AX3","level":"error","message":{"text":"Namespace dependency cycle: The namespaces Antlr4.Runtime \u2194 Antlr4.Runtime.Atn \u2194 Antlr4.Runtime.Dfa \u2194 Antlr4.Runtime.Misc \u2194 Antlr4.Runtime.Tree \u2194 Antlr4.Runtime.Tree.Pattern depend on each other. The lightest dependency in the cycle is Antlr4.Runtime \u2192 Antlr4.Runtime.Tree.Pattern (Antlr4.Runtime.Parser \u2192 Antlr4.Runtime.Tree.Pattern.ParseTreePattern, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Parser.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"026cebe6bb0cf63e77e1af0ad7f987a948e2d605f6491042b3673a81ca6c5b18"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: ATNFactory (26 abstract methods): \u0060ATNFactory\u0060 declares 26 abstract methods: \u0060action\u0060, \u0060action\u0060, \u0060alt\u0060, \u0060block\u0060, \u0060charSetLiteral\u0060, \u0060createATN\u0060, \u0060epsilon\u0060, \u0060label\u0060, \u0060lexerAltCommands\u0060, \u0060lexerCallCommand\u0060, \u0060lexerCommand\u0060, \u0060listLabel\u0060, \u0060newState\u0060, \u0060optional\u0060, \u0060plus\u0060, \u0060range\u0060, \u0060rule\u0060, \u0060ruleRef\u0060, \u0060sempred\u0060, \u0060set\u0060, \u0060setCurrentOuterAlt\u0060, \u0060setCurrentRuleName\u0060, \u0060star\u0060, \u0060stringLiteral\u0060, \u0060tokenRef\u0060, \u0060wildcard\u0060. Counted over its ABSTRACT methods, once per signature; \u0060default\u0060, \u0060static\u0060 and \u0060private\u0060 methods and constants are not counted, because no implementer is forced to write them. Those 26 declarations carry 25 distinct name(s), so part of the width is overloading rather than separate responsibilities \u2014 but 25 operations clears the \u003E15 bar on its own, so the row is about responsibilities, not signatures. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/automata/ATNFactory.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"53970991f38b58469a66e25aa3f5d5fa852bbdfb60b5bf438c29434ca9487071"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: OutputModelFactory (35 abstract methods): \u0060OutputModelFactory\u0060 declares 35 abstract methods: \u0060action\u0060, \u0060alternative\u0060, \u0060epsilon\u0060, \u0060finishAlternative\u0060, \u0060getChoiceBlock\u0060, \u0060getCodeBlockLevel\u0060, \u0060getComplexChoiceBlock\u0060, \u0060getComplexEBNFBlock\u0060, \u0060getController\u0060, \u0060getCurrentBlock\u0060, \u0060getCurrentOuterMostAlt\u0060, \u0060getCurrentOuterMostAlternativeBlock\u0060, \u0060getCurrentRuleFunction\u0060, \u0060getEBNFBlock\u0060, \u0060getGenerator\u0060, \u0060getGrammar\u0060, \u0060getLL1ChoiceBlock\u0060, \u0060getLL1EBNFBlock\u0060, \u0060getLL1Test\u0060, \u0060getRoot\u0060, \u0060getTreeLevel\u0060, \u0060lexer\u0060, \u0060lexerFile\u0060, \u0060needsImplicitLabel\u0060, \u0060parser\u0060, \u0060parserFile\u0060, \u0060rule\u0060, \u0060rulePostamble\u0060, \u0060ruleRef\u0060, \u0060sempred\u0060, \u0060set\u0060, \u0060setController\u0060, \u0060stringRef\u0060, \u0060tokenRef\u0060, \u0060wildcard\u0060. Counted over its ABSTRACT methods, once per signature; \u0060default\u0060, \u0060static\u0060 and \u0060private\u0060 methods and constants are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tool/src/org/antlr/v4/codegen/OutputModelFactory.java"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfecf6a3c0cdf5d2bd4de3a93e482c7c8b4ce6a4739907a1ab6ed3c568aa8559"}},{"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":"M4","level":"note","message":{"text":"README/code drift: doc/javascript-target.md names Node.js 14, but the repository declares engines \u0060\u003E=16\u0060. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"doc/javascript-target.md"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac23daa6ae7441611c788efd4f1443aa2e521e5ea2a15adce7496604497b94d"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 2 public types in \u0060Antlr4.Runtime.Tree\u0060 are marked as implementation by their own namespace, folder or name: \u0060ErrorNodeImpl\u0060 (runtime/CSharp/src/Tree/ErrorNodeImpl.cs:22, name ends in \u0060Impl\u0060), \u0060TerminalNodeImpl\u0060 (runtime/CSharp/src/Tree/TerminalNodeImpl.cs:9, name ends in \u0060Impl\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/src/Tree/ErrorNodeImpl.cs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"417a63b5c7f3b2f9796e159e5ea09684e23722ca1da293c9eec2a0c00ffbe521"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add spotbugs with find-sec-bugs (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 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/hosted.yml"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060runtime/CSharp/tests/issue-2693/Test.csproj\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/CSharp/tests/issue-2693/Test.csproj"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"23689e9f3416ef3cd4e06b1358d14c5cd86d0e7d08d36043ad8a8757998f506a"}},{"ruleId":"P6","level":"note","message":{"text":"Changelog looks stale/thin: The changelog this check read carries 1 versioned entry, against a bar of 3. Counted as either the distinct \u0060x.y.z\u0060 versions it names (a link\u0027s target is not counted) or its version-shaped section headings (\u0060## [1.2.0]\u0060, \u0060## V14.x.x\u0060, \u0060## Updates in 8.0.x\u0060), whichever is the larger \u2014 so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read \u2014 release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository \u2014 are not counted here, and this row is about what is re-findable in the tree rather than about how often you release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9a74c249fe67853238d9c15085f7f97d31f51bb82455046aa10c2cef82f67b8"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 2 typed \u00B7 146 plain JS \u2014 the untyped files are runtime/JavaScript/spec/BitSetSpec.js, runtime/JavaScript/spec/HashMapSpec.js, runtime/JavaScript/spec/HashSetSpec.js, runtime/JavaScript/spec/IntervalSetSpec.js, runtime/JavaScript/spec/helpers/Reporter.js, runtime/JavaScript/spec/imports/NodeCommonJSImportSpec.cjs (\u002B140 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (58 matched lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/misc/HashMap.js:8 \u00B7 runtime/JavaScript/src/antlr4/misc/HashSet.js:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 327 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/misc/HashMap.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"989aa5992db1742c4b5c5b3d754dc945b1d4e152e4cde826287adc5b1d5ee496"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js:1423 \u00B7 runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js:1458 \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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0f1b23eaa34c682d5f912a9edf30c069f4c4cbcbbf6217742d57c5e0822916"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/action/LexerChannelAction.js:14 \u00B7 runtime/JavaScript/src/antlr4/action/LexerTypeAction.js:13 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/action/LexerChannelAction.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec00d37185d0f8de243f19d9e856ee13f6a6d2cb1ea8ac609dfa07c39f6f34d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/action/LexerModeAction.js:12 \u00B7 runtime/JavaScript/src/antlr4/action/LexerPushModeAction.js:12 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/action/LexerModeAction.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"30384592e3bd3dd218b7688a13d05ff1578f3a0b99f463de577a1f7a7ca4fbb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/atn/SemanticContext.js:94 \u00B7 runtime/JavaScript/src/antlr4/atn/SemanticContext.js:197 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/SemanticContext.js"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e19afa537fb26048b127bd6ad7d2ed0d4546b0f33e6db11dfc816c3371512cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/atn/SemanticContext.js:129 \u00B7 runtime/JavaScript/src/antlr4/atn/SemanticContext.js:230 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/SemanticContext.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea95ea5abcf938d9b6ea4aa4487ee0ac79520a8514282b38b12335ec9c6ae85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/Recognizer.js:97 \u00B7 runtime/JavaScript/src/antlr4/error/DefaultErrorStrategy.js:542 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/Recognizer.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"85eedded60a0f6e7b8f6df89eb193aea8e951a310f92321af50ef7ac42583cfd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/atn/PrecedencePredicate.js:27 \u00B7 runtime/JavaScript/src/antlr4/atn/Predicate.js:18 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/PrecedencePredicate.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1966181d2d65378b93295e063e23457c27b7ab47342d5783402fa09e50152b13"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/BufferedTokenStream.js:276 \u00B7 runtime/JavaScript/src/antlr4/BufferedTokenStream.js:297 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/BufferedTokenStream.js"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01512e4695c46d4e40ab04edd1daa836e13f2c310ea65fdae765cb3d1786bf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/Parser.js:98 \u00B7 runtime/JavaScript/src/antlr4/Parser.js:132 \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":"runtime/JavaScript/src/antlr4/Parser.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"146d21d6142a91a76fc02207a578d73716f25f2b17a6c8ceac016cb7f25f51e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/TokenStreamRewriter.js:217 \u00B7 runtime/JavaScript/src/antlr4/TokenStreamRewriter.js:265 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/TokenStreamRewriter.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"762ab627a19e6e9a1c41c1a23f2d79b8b28d00dfd4b438ea6747daac59e94b34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/misc/IntervalSet.js:186 \u00B7 runtime/JavaScript/src/antlr4/misc/IntervalSet.js:207 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/misc/IntervalSet.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b475b90370fe15b1678a958cfe92fa6913d29361dedfca15da0ede45941d077"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/transition/ActionTransition.js:8 \u00B7 runtime/JavaScript/src/antlr4/transition/PredicateTransition.js:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/transition/ActionTransition.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"756b63f32ad2f2997577da96d2e4f9e1c252295fe42791ee7bf8006b9ac48c8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/BufferedTokenStream.js:160 \u00B7 runtime/JavaScript/src/antlr4/BufferedTokenStream.js:361 \u2014 the two spans are one implementation copied and then locally edited \u2014 71 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/BufferedTokenStream.js"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f616089c74acad8b9053873676271d7ccab02cb27887360652dc31256b04053"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/Parser.js:508 \u00B7 runtime/JavaScript/src/antlr4/atn/ATN.js:132 \u2014 the two spans are one implementation copied and then locally edited \u2014 90 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/Parser.js"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b76401cd2f281e5e4e4ede25e1cd66bde04b80c01a40b5eaf5d1556b3c63de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/atn/ATNConfig.js:84 \u00B7 runtime/JavaScript/src/antlr4/atn/ATNConfig.js:109 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ATNConfig.js"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"166762ab4d2527fdf59aba8705bafcf29d4eb84f443f4d7890d052d1da1d413d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js:1698 \u00B7 runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js:1709 \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":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f12d39d9c104f7114e947239cbaeaa23a9b47faa075085d62b227483747eabe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/atn/PredictionMode.js:436 \u00B7 runtime/JavaScript/src/antlr4/atn/PredictionMode.js:543 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/PredictionMode.js"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fddabda679acc3d64b2d7a16703ef3a0d1ea6bbee1933fc4e61d9a5c20409bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/atn/SemanticContext.js:162 \u00B7 runtime/JavaScript/src/antlr4/atn/SemanticContext.js:261 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/SemanticContext.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74a04f0f00ac136a0a5d9aea9fdb413ca3162ae5e651fb51edcdf4edeb685ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/context/ParserRuleContext.js:156 \u00B7 runtime/JavaScript/src/antlr4/context/ParserRuleContext.js:177 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/context/ParserRuleContext.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f976663839b339c00b00c39787bd31274bf19b282b54ab46a78185e660f9e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7 locations): runtime/JavaScript/src/antlr4/action/LexerChannelAction.js:29 \u00B7 runtime/JavaScript/src/antlr4/action/LexerCustomAction.js:44 \u00B7 runtime/JavaScript/src/antlr4/action/LexerIndexedCustomAction.js:48 \u00B7 runtime/JavaScript/src/antlr4/action/LexerModeAction.js:27 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 7 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/action/LexerChannelAction.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ac9a04fd4056b2364e51deebcf4561c4dfefe60111828a5003330aaecdf690"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/atn/SemanticContext.js:189 \u00B7 runtime/JavaScript/src/antlr4/atn/SemanticContext.js:288 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/SemanticContext.js"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3f054a48128c66275f322e5de8936d0a19f0e9af448ddb79f3b439e0fe396e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/error/ErrorListener.js:12 \u00B7 runtime/JavaScript/src/antlr4/error/ProxyErrorListener.js:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/error/ErrorListener.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"edca61b69874c7531f5d3bf1f9605a7ab2484fbd0679c535c54cbff21f32749a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/atn/LexerATNSimulator.js:289 \u00B7 runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js:735 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/LexerATNSimulator.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d65af2667712c3458f2aecd127a2f75c5481c2a4afd756834ea4afd89be1a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): runtime/JavaScript/src/antlr4/utils/stringHashCode.js:34 \u00B7 runtime/JavaScript/src/antlr4/utils/stringHashCode.js:55 \u2014 the two spans are one implementation copied and then locally edited \u2014 119 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/utils/stringHashCode.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4561e8ce400820ecf1133c9d8ea7bbe5805d5a96ac212808e784e8e8dc65d9b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reduceToSingleOperationPerIndex (cyclomatic 31, cognitive 58): reduceToSingleOperationPerIndex has cyclomatic complexity 31 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/TokenStreamRewriter.js"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0527983f0bbdf7562f4945b7bf36b8fa4ddadbac2f79f4c3410c0aef8322b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeArrays (cyclomatic 30, cognitive 50): mergeArrays has cyclomatic complexity 30 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/context/PredictionContextUtils.js"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1aff84a619b2971dc24288d701f9840c33cde65b02fc21f81505b2a78f0da2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function computeReachSet (cyclomatic 26, cognitive 45): computeReachSet has cyclomatic complexity 26 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55dfe2f94cfcc2b739efc8898df1e145cde68af51cc85e3262623b42ba460ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execATN (cyclomatic 22, cognitive 54): execATN has cyclomatic complexity 22 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd6adfd8db0ccc03f645e2ad69d21e2c08f80f4a66ba815ae7286782471cdf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _LOOK (cyclomatic 22, cognitive 40): _LOOK has cyclomatic complexity 22 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/LL1Analyzer.js"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d478eec4a417a0a84a9c32d9f29fe0b0bbb57d6245e5b459ef8d21dfc555146"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function canDropLoopEntryEdgeInLeftRecursiveRule (cyclomatic 19, cognitive 20): canDropLoopEntryEdgeInLeftRecursiveRule has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9724ca8c2de7f0522611a71d5d4c2578ad4c840be59a936616b07be091a01f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closure (cyclomatic 18, cognitive 33): closure has cyclomatic complexity 18 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/LexerATNSimulator.js"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1371aa87fa5effcc56a2b00f4ee5cd04a8ac9f4ab138c741aee99f8360a5a706"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeSingletons (cyclomatic 18, cognitive 32): mergeSingletons has cyclomatic complexity 18 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/context/PredictionContextUtils.js"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6985ade46e051da8216f877139475094340e25ac779db01e0c08d2968484a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closure_ (cyclomatic 17, cognitive 44): closure_ has cyclomatic complexity 17 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8a03fa559bd51c79ce8826008aadce699c7d7413c6fe26ba7252621d9b68b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readEdges (cyclomatic 17, cognitive 40): readEdges has cyclomatic complexity 17 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ATNDeserializer.js"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"463c4b872251144b82373feb625fb6b163f1db09260f0c2f33b7a8c4ed481d4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyATN (cyclomatic 17, cognitive 22): verifyATN has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ATNDeserializer.js"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a226c37119d92606e51aa29da12aa9b92eaa199c9656493bf53090b6eddf8a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getEpsilonTarget (cyclomatic 15, cognitive 20): getEpsilonTarget has cyclomatic complexity 15 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/LexerATNSimulator.js"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bff4546c3d0332a4fdcfeb25baa358a56fb8004c262931bd13d08b85c821e5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function execATNWithFullContext (cyclomatic 14, cognitive 25): execATNWithFullContext has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2edf904e565409fee26c50615ff4de9a8728cd02cc446d4b85758d6c81d5b33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getText (cyclomatic 14, cognitive 21): getText has cyclomatic complexity 14 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/TokenStreamRewriter.js"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0d1065a928ec02177d115770f61457921fe43373ed48b1db0666b48e54637d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextToken (cyclomatic 13, cognitive 30): nextToken has cyclomatic complexity 13 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/Lexer.js"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d706780048e194b394688be9fb1b7ed9d7a51f948139efbb42b675cceaf9a8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getCachedPredictionContext (cyclomatic 13, cognitive 19): getCachedPredictionContext has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/context/PredictionContextUtils.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc8d4673e55448ce50a905cc0120d3e6b69b4da14528dd62ab7c7d3566be2c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toString (cyclomatic 12, cognitive 18): toString has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/context/RuleContext.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fb3957335174956460c005d4c8b7d16b271638f7e2a8bd94a563c62f516829"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sync (cyclomatic 12, cognitive 9): sync has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/error/DefaultErrorStrategy.js"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"48732c5c916baf6a5b1da744d72c2831f4b2e9e431757ba3052a1581410929e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function closureCheckingStopState (cyclomatic 11, cognitive 29): closureCheckingStopState has cyclomatic complexity 11 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da7e4e84797643eb89101db91631640e06caa97f8b2c77ce9071c80c9a8acab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyPrecedenceFilter (cyclomatic 11, cognitive 18): applyPrecedenceFilter has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a40728718d0d1d2117ffc471fe22d5afb8d42fe08091c5d0b8a3a1596fa671"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getNodeText (cyclomatic 11, cognitive 15): getNodeText has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/tree/Trees.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bce5e264fb51a1313764bb02daf250f5ab30603e4f761adea9153c6d8bf946f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readStates (cyclomatic 11, cognitive 13): readStates has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ATNDeserializer.js"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fafe8563123ee08dd371b364131ede6a54696dff929f4e4f3d506c20eb13d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeRange (cyclomatic 11, cognitive 13): removeRange has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/misc/IntervalSet.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6e5135bd2a7c6e8bb196f7b6e4e9074db216e4c34d2c4ce266e0623b0df45c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getText (cyclomatic 11, cognitive 10): getText has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/BufferedTokenStream.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e676cac9de9cbc84c48177baf554736b444f667fbf945b85f080576a528494"}},{"ruleId":"R3","level":"warning","message":{"text":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js: 1656 lines of code: runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js has 1656 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ParserATNSimulator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc946ae349b7d75c6c50b3639ff501e0ca151d7e9a0b2390a596722e70581038"}},{"ruleId":"R3","level":"warning","message":{"text":"runtime/JavaScript/src/antlr4/error/DefaultErrorStrategy.js: 669 lines of code: runtime/JavaScript/src/antlr4/error/DefaultErrorStrategy.js has 669 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/error/DefaultErrorStrategy.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4973fcbdf296ea11e31e8d2091e0235ed8ab0c7101551d2dc19afd326dfbdc3"}},{"ruleId":"R3","level":"warning","message":{"text":"runtime/JavaScript/src/antlr4/atn/LexerATNSimulator.js: 600 lines of code: runtime/JavaScript/src/antlr4/atn/LexerATNSimulator.js has 600 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/LexerATNSimulator.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f668a52d5af625b7926212b80d13415d0a299fbf58f6127d182265e967a5358"}},{"ruleId":"R3","level":"warning","message":{"text":"runtime/JavaScript/src/antlr4/Parser.js: 590 lines of code: runtime/JavaScript/src/antlr4/Parser.js has 590 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/Parser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83be6731523d20387a25069aba2110b14092fcf3e070bacfc51966b07e834800"}},{"ruleId":"R3","level":"warning","message":{"text":"runtime/JavaScript/src/antlr4/atn/ATNDeserializer.js: 556 lines of code: runtime/JavaScript/src/antlr4/atn/ATNDeserializer.js has 556 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/ATNDeserializer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf05e5328a2b9a0c2149b8440e117a58e74260006261dd49ee36161a0f66be8"}},{"ruleId":"R3","level":"warning","message":{"text":"runtime/JavaScript/spec/rewriter/TokenStreamRewriterSpec.js: 549 lines of code: runtime/JavaScript/spec/rewriter/TokenStreamRewriterSpec.js has 549 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/spec/rewriter/TokenStreamRewriterSpec.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d03d02b341b0a69b06710e8fa2c99ebb294c5bab9f7f867450ed3afa835542c"}},{"ruleId":"R3","level":"warning","message":{"text":"runtime/JavaScript/src/antlr4/atn/PredictionMode.js: 544 lines of code: runtime/JavaScript/src/antlr4/atn/PredictionMode.js has 544 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/atn/PredictionMode.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96789fc5f8c6178ab0de201deee615ab5099fb362d510d9a7dc91880899603d"}},{"ruleId":"R3","level":"warning","message":{"text":"runtime/JavaScript/src/antlr4/context/PredictionContextUtils.js: 431 lines of code: runtime/JavaScript/src/antlr4/context/PredictionContextUtils.js has 431 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/context/PredictionContextUtils.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ae6c908f31d03601e4d90b095f9b0ae8b8e67e313d4fffb1d59fe8a8acde1a"}},{"ruleId":"R3","level":"warning","message":{"text":"runtime/JavaScript/src/antlr4/TokenStreamRewriter.js: 405 lines of code: runtime/JavaScript/src/antlr4/TokenStreamRewriter.js has 405 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/TokenStreamRewriter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5524888ebc6cf3a16b0a6147d7a879f563e4bef6b9a99e15687fe0fbc1d0e283"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/context/InterpreterRuleContext.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29adef376caca26c0556b8fd8a5d6046da268f0fa454533d4dd528371de25bd6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/utils/titleCase.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a7f9093dfe9f32728781b284b909155cfb4b1b7087fc5962b8fc23ff38a6ec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/TokenSource.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff79f4dc3c1c27a6218e75d57bbc4600ae47c666343dbe9af12ae259f9af57c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (5 application, 66 tooling, 12 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/context/InterpreterRuleContext.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e58847b106d9ef9d06192f3abb935fe83527f0091cb33e8f42dbc0b9650115"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~9 LoC): no import path from any entry point (5 application, 66 tooling, 12 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/utils/titleCase.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d749d25427263080da93794409833cb3078bb8b8468e7f9e0cc9a3494202e6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/src/antlr4/TokenSource.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f770145d03fd81a93e9b2855180ee21eec0af66f4d95496346dc476d4489e4"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027glob-parent\u0027: Declared in runtime/JavaScript/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e5dc755bdc0f5f57b1cdda0e8deb034267487bc9dcf2be38ca0b54e417272739"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027minimist\u0027: Declared in runtime/JavaScript/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2934ade0722cebec3da7888d2e20c2652bf80f45e56af4bdc66e6f6951286e05"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027source-map-support\u0027: Declared in runtime/JavaScript/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3e2948512562b806330fa6a4cf0eebd2d7e43326a9f0d9fe4f838217e8d64a3b"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: runtime/JavaScript/spec/imports/builds/node-cjs-ts/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/spec/imports/builds/node-cjs-ts/package.json"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"be93f38b426ca803f5d36a1f02427e0893d0783061cabca945a7012246c8048c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: runtime/JavaScript/spec/imports/builds/node-esm-ts/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/JavaScript/spec/imports/builds/node-esm-ts/package.json"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bef0a4a199783b03847add4cc8261b417b91f22e74ef91d15dc083c8b74e4f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx != null \u0026\u0026 ctx.invokingState \u003E= 0 \u0026\u0026 following.Contains(TokenConstants.EPSILON)\u0060 appears character-identically in 2 files \u2014 runtime/CSharp/src/Atn/ATN.cs, runtime/CSharp/src/Parser.cs. 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":"runtime/CSharp/src/Atn/ATN.cs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a52487274cbede8d2271be1a535dc1b86765d9151ac82162d2d62be6a301b36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx != null \u0026\u0026 ctx.invokingState \u003E= 0 \u0026\u0026 following.contains(Token.EPSILON)\u0060 appears character-identically in 2 files \u2014 runtime/Dart/lib/src/atn/src/atn.dart, runtime/Dart/lib/src/parser.dart. 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":"runtime/Dart/lib/src/atn/src/atn.dart"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a039d81ef243ef05223c017a14fdb862c558064763ca1fd7d99dc2810335e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx != nil \u0026\u0026 ctx.GetInvokingState() \u003E= 0 \u0026\u0026 following.contains(TokenEpsilon)\u0060 appears character-identically in 2 files \u2014 runtime/Go/antlr/v4/atn.go, runtime/Go/antlr/v4/parser.go. 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":"runtime/Go/antlr/v4/atn.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f5214c1c6227dc562824b4b0ba0c36db5009ca0ab93d13739528e7ada1f35f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060anyLabelDef!=null \u0026\u0026 (anyLabelDef.type==LabelType.RULE_LIST_LABEL || anyLabelDef.type==LabelType.TOKEN_LIST_LABEL)\u0060 appears character-identically in 2 files \u2014 tool/src/org/antlr/v4/tool/Alternative.java, tool/src/org/antlr/v4/tool/Rule.java. 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":"tool/src/org/antlr/v4/tool/Alternative.java"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23e419fd941d83919fd4f5bd4e3b12d071b570a133f6bfad5c2d9f610dd734d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060anyLabelDef!=null \u0026\u0026 anyLabelDef.type==LabelType.RULE_LABEL\u0060 appears character-identically in 2 files \u2014 tool/src/org/antlr/v4/tool/Alternative.java, tool/src/org/antlr/v4/tool/Rule.java. 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":"tool/src/org/antlr/v4/tool/Alternative.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c75b7ea7fe63acb12bf9c44b8f9c28e65cf8744c987371ce2f55d2282cac2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060anyLabelDef!=null \u0026\u0026 anyLabelDef.type==LabelType.TOKEN_LABEL\u0060 appears character-identically in 2 files \u2014 tool/src/org/antlr/v4/tool/Alternative.java, tool/src/org/antlr/v4/tool/Rule.java. 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":"tool/src/org/antlr/v4/tool/Alternative.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f0d86f73a7f73cc6cb148aae907b1174681f2ceb38faaad7c8f2e30ba4ac43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060types==null || types.contains(t.getType())\u0060 appears character-identically in 2 files \u2014 runtime/Java/src/org/antlr/v4/runtime/BufferedTokenStream.java, tool/src/org/antlr/v4/tool/ast/GrammarAST.java. 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":"runtime/Java/src/org/antlr/v4/runtime/BufferedTokenStream.java"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea32e1c975efaa2a8c30e153e1ee9eba9f2a057a0b0fbc62c1c9eca37ee8c41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060valueText.equals(\u0022true\u0022) || valueText.equals(\u0022false\u0022)\u0060 appears character-identically in 2 files \u2014 tool/src/org/antlr/v4/semantics/BasicSemanticChecks.java, tool/src/org/antlr/v4/semantics/RuleCollector.java. 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":"tool/src/org/antlr/v4/semantics/BasicSemanticChecks.java"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebedad936038cce9cb0a5bde518ef005e1b31de6fda931890fbf6a7dc84cac2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx !== null \u0026\u0026 ctx.invokingState \u003E= 0 \u0026\u0026 following.contains(Token.EPSILON)\u0060 appears character-identically in 2 files \u2014 runtime/JavaScript/src/antlr4/Parser.js, runtime/JavaScript/src/antlr4/atn/ATN.js. 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":"runtime/JavaScript/src/antlr4/Parser.js"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"616a4265fec34fe3733b330c1c3b62a09c719afcf7c82efcf7dc00950cb65ead"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060equalsFunction || standardEqualsFunction\u0060 appears character-identically in 2 files \u2014 runtime/JavaScript/src/antlr4/misc/HashMap.js, runtime/JavaScript/src/antlr4/misc/HashSet.js. 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":"runtime/JavaScript/src/antlr4/misc/HashMap.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d827e3dd488ce36ca3008739aababb5c7fd4707443cf1960a8ec15c02923f607"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hashFunction || standardHashCodeFunction\u0060 appears character-identically in 2 files \u2014 runtime/JavaScript/src/antlr4/misc/HashMap.js, runtime/JavaScript/src/antlr4/misc/HashSet.js. 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":"runtime/JavaScript/src/antlr4/misc/HashMap.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b351b1f0c5199a6519ccc8592ce6529276ba00bb55756d1f835371a432e3ed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getTextInInterval\u0060 turns every thrown error into \u0060\u0022\u003Cunknown\u003E\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/atn/ParserATNSimulator.swift"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9264dfd7349b41349c6893cb5928b718670e0e3ac4923c9c13ddcaa8e86e24"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getTextInInterval\u0060 turns every thrown error into \u0060\u0022\u003Cunknown\u003E\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the error or let it propagate (\u0060throws\u0060). If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment at the \u0060catch\u0060, \u0060guard\u0060 or \u0060??\u0060, or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"runtime/Swift/Sources/Antlr4/DiagnosticErrorListener.swift"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5569f00b30cb89fbe0d437b621d279b08c4d318b314dbb6268dde9c5ef690b3f"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"Reliance on Component That is Not Updateable","shortDescription":{"text":"Reliance on Component That is Not Updateable"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-252","guid":"78915dc5-e486-f858-bc3c-aa570ad9010d","name":"Unchecked Return Value","shortDescription":{"text":"Unchecked Return Value"},"helpUri":"https://cwe.mitre.org/data/definitions/252.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-321","guid":"0ce564a5-a44c-3358-b3db-317712e6e019","name":"Use of Hard-coded Cryptographic Key","shortDescription":{"text":"Use of Hard-coded Cryptographic Key"},"helpUri":"https://cwe.mitre.org/data/definitions/321.html"},{"id":"CWE-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"Reversible One-Way Hash","shortDescription":{"text":"Reversible One-Way Hash"},"helpUri":"https://cwe.mitre.org/data/definitions/328.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-391","guid":"d9ef5687-8d79-9b51-b509-b83411fbcdc3","name":"Unchecked Error Condition","shortDescription":{"text":"Unchecked Error Condition"},"helpUri":"https://cwe.mitre.org/data/definitions/391.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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"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/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"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-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":60,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}